Implementation of processor allocation in an N-Cube multiprocessor on Macintosh

Graduate Project

Öffentlich Deposited

Citeable URL: https://ir.library.oregonstate.edu/concern/graduate_projects/rn301860n

Descriptions

Attribute Name	Values
Creator	Liu, Jinyue
Abstract	The processor allocation in an n-dimensional hypercube multiprocessor using buddy strategy, gray code strategy, and a new strategy is implemented on Macintosh. Our implementations show that when processor relinquishment is not considered (i.e. static allocation), all these strategies are optimal in the sense that each incoming request sequence is always assigned to a minimal subcube. Our implementations also show that the gray code strategy outperforms the buddy strategy in detecting the availability of subcubes, and furthermore, when some faulty processors are considered or processors are allocated dynamically, the new strategy does better than the buddy strategy or gray code strategy in subcube recognition.
Resource Type	Capstone Project
Date Issued	1990-04
Degree Level	Master's
Degree Name	Master of Science (M.S.)
Degree Field	Computer Science
Degree Grantor	Oregon State University
Commencement Year	1990
Committee Member	Bose, Bella Minoura, Toshimi D'Ambrosio, Bruce
Academic Affiliation	Computer Science
Urheberrechts-Erklärung	In Copyright
Publisher	Oregon State University
Peer Reviewed	No
Language	English [eng]

Miniaturansicht	Titel	Hochladedatum	Sichtbarkeit	Aktionen
	Liu_Jinyue_1990_04.pdf	2023-01-04	Öffentlich	Herunterladen