A network-topology independent task allocation strategy for parallel computers

Author

Baba, Takanobu ; Iwamoto, Yoshifumi ; Yoshinaga, Tsutomu

Author_Institution

Dept. of Inf. Sci., Utsunomiya Univ., Japan

fYear

1990

fDate

12-16 Nov 1990

Firstpage

878

Lastpage

887

Abstract

For mapping a task graph to a processor graph, this strategy evaluates several functions that represent some intuitively feasible properties of the graphs. Several strategies are defined to guide the mapping process, utilizing the indicated values. An allocation system has been designed and implemented based on this strategy. The experimental results indicate the following: the system can yield 2.14 times better allocation than an arbitrary allocation; it is difficult to select a single strategy capable of providing the best solutions for a wide range of task-processor combinations; and the computation time of the allocator is reasonable. The effect of task and processor topology combinations on the allocation results is also discussed

Keywords

parallel programming; resource allocation; A-NET; Actor-Network; network-topology independent; processor graph; processor topology; task allocation strategy; task graph; task-processor combinations; Computer networks; Concurrent computing; Costs; Dolphins; Hypercubes; Information science; Network topology; Scheduling algorithm; Telecommunication traffic; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Supercomputing '90., Proceedings of

Conference_Location

New York, NY

Print_ISBN

0-8186-2056-0

Type

conf

DOI

10.1109/SUPERC.1990.130114

Filename

130114