Mapping strategies in message-based multiprocessor systems (Q1116317): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 03:35, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Mapping strategies in message-based multiprocessor systems |
scientific article |
Statements
Mapping strategies in message-based multiprocessor systems (English)
0 references
1989
0 references
Machines with distributed memory have the mapping problem - assigning process to processors. In this paper we define the mapping problem as an optimization problem and discuss the question, how far is an optimum solution from an average or random solution. The term robustness is introduced and explained in detail with two examples, the SUPREMUM and the hypercube architecture. For the SUPRENUM architecture we show that a simple mapping strategy (optimal clustering of the processes) gives almost as good results as the optimal mapping. Optimal mapping is more important for the hypercube architecture. For nonhomogeneous networks adaptive routing seems promising.
0 references
local memory multiprocessors
0 references
process-processor placement
0 references
sensitivity analysis
0 references
distributed memory
0 references
SUPREMUM
0 references
hypercube
0 references
SUPRENUM
0 references