Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Processor Allocation For Partitionable Multiprocessor Systems, Nicholaos C. Antoniou
Processor Allocation For Partitionable Multiprocessor Systems, Nicholaos C. Antoniou
Theses
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 …
Data Broadcasting And Reduction, Prefix Computation, And Sorting On Reduced Hypercube (Rh) Parallel Computers, Arup Mukherjee
Data Broadcasting And Reduction, Prefix Computation, And Sorting On Reduced Hypercube (Rh) Parallel Computers, Arup Mukherjee
Theses
The binary hypercube parallel computer has been very popular due to its rich interconnection structure and small average internode distance which allow the efficient embedding of frequently used topologies. Communication patterns of many parallel algorithms also match the hypercube topology. The hypercube has high VLSI complexity. however. due to the logarithmic increase in the number of connections to each node with the increase in the number of dimensions of the hypercube. The reduced hypercube (RH) interconnection network. which is obtained by a uniform reduction in the number of links for each hypercube node. yields lower-complexity interconnection networks when compared to …