
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

A NetworkTopologyIndependent Static Task Allocation Strategy for Massively Parallel Computers
Takanobu BABA Akehito GUNJI Yoshifumi IWAMOTO
Publication
IEICE TRANSACTIONS on Information and Systems
Vol.E76D
No.8
pp.870881 Publication Date: 1993/08/25 Online ISSN:
DOI: Print ISSN: 09168532 Type of Manuscript: PAPER Category: Computer Networks Keyword: networktopologyindependence, parallel computer, processor graph, task allocation strategy, task graph,
Full Text: PDF>>
Summary:
A networktopologyindependent static task allocation strategy has been designed and implemented for massively parallel computers. For mapping a task graph to a processor graph, this strategy evaluates several functions that represent some intuitively feasible properties or the graphs. They include the connectivity with the allocated nodes, distance from the median of a graph, connectivity with candidate nodes, and the number of candidate nodes within a distance. Several greedy strategies are defined to guide the mapping process, utilizing the indicated function values. An allocation system has been designed and implemented based on the allocation strategy. In experiments we have defined about 1000 nodes in task graphs with regular and irregular topologies, and the same order of processors with mesh, tree, and hypercube topologies. The results are summarized as follows. 1) The system can yield 4.0 times better total communication costs than an arbitrary allocation. 2) It is difficult to select a single strategy capable of providing the best solutions for a wide range of taskprocessor combinations. 3) Comparison with hypercubetopologydependent research indicates that our topologyindependent allocator produces better results than the dependent ones. 4) The order of computaion time of the allocator is experimentally proved to be O (n^{2}) where n represents the number of tasks.


