Document Type
Thesis
Date of Award
Fall 10-31-1994
Degree Name
Master of Science in Electrical Engineering - (M.S.)
Department
Electrical and Computer Engineering
First Advisor
Edwin Hou
Second Advisor
Sotirios Ziavras
Third Advisor
Kyriacos Mouskos
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.
Recommended Citation
Antoniou, Nicholaos C., "Processor allocation for partitionable multiprocessor systems" (1994). Theses. 1589.
https://digitalcommons.njit.edu/theses/1589
