The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title:	Processor allocation for partitionable multiprocessor systems
Author:	Antoniou, Nicholaos C.
View Online:	njit-etd1994-061 (x, 56 pages ~ 1.7 MB pdf)
Department:	Department of Electrical and Computer Engineering
Degree:	Master of Science
Program:	Electrical Engineering
Document Type:	Thesis
Advisory Committee:	Hou, Edwin (Committee chair) Ziavras, Sotirios (Committee member) Mouskos, Kyriacos (Committee member)
Date:	1994-10
Keywords:	Hypercube networks (Computer networks) Computer architecture.
Availability:	Unrestricted
Abstract:	The processor allocation problem in an n-dimensional hypercube multipro-cessor is similar to the conventional memory allocation problem. The main objective is to maximize the utilization of available resources as well as minimize the inherent system fragmentation. In this thesis, a new processor allocation strategy is proposed, and compared with the existing strategies, such as, the Buddy strategy, the Single Gray Code strategy (SGC), the Multiple Gray Code (MGC), and the Maximal Set of Subcubes (MSS). We will show that our proposed processor allocation strategy outperforms the existing strategies, by having the advantage of being able to allocate unused processors to other jobs/algorithms.