Catalogo Articoli (Spogli Riviste)
OPAC HELP
Titolo: A NETWORKTOPOLOGYINDEPENDENT STATIC TASK ALLOCATION STRATEGY FOR MASSIVELYPARALLEL COMPUTERS
Autore: BABA T; GUNJI A; IWAMOTO Y;
 Indirizzi:
 UTSUNOMIYA UNIV,FAC ENGN UTSUNOMIYA TOCHIGI 321 JAPAN
 Titolo Testata:
 IEICE transactions on information and systems
fascicolo: 8,
volume: E76D,
anno: 1993,
pagine: 870  881
 SICI:
 09168532(1993)E76D:8<870:ANSTAS>2.0.ZU;29
 Fonte:
 ISI
 Lingua:
 ENG
 Keywords:
 NETWORKTOPOLOGYINDEPENDENCE; PARALLEL COMPUTER; PROCESSOR GRAPH; TASK ALLOCATION STRATEGY; TASK GRAPH;
 Tipo documento:
 Article
 Natura:
 Periodico
 Settore Disciplinare:
 Science Citation Index Expanded
 Citazioni:
 NO
 Recensione:
 Indirizzi per estratti:



 Citazione:
 T. Baba et al., "A NETWORKTOPOLOGYINDEPENDENT STATIC TASK ALLOCATION STRATEGY FOR MASSIVELYPARALLEL COMPUTERS", IEICE transactions on information and systems, E76D(8), 1993, pp. 870881
Abstract
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 severalfunctions that represent some intuitively feasible properties of 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 indicatedfunction 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(n2) where n represents the number of tasks.
ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 26/09/20 alle ore 05:47:52