The Community for Technology Leaders
Green Image
The issue of deciding when to invoke a global load remapping mechanism is studied. Such a decision policy must effectively weigh the costs of remapping against the performance benefits, and should be general enough to apply automatically to a wide range of computations. The authors propose a general mapping decision heuristic, then study its effectiveness and its anticipated behavior on two ver
remapping; parallel computations; resource demands; global load remapping; decision policy; mapping decision heuristic; load evolution; system degradation; heuristic programming; operating systems (computers); optimisation; parallel processing; scheduling.

D. Nicol and J. Saltz, "Dynamic Remapping of Parallel Computations with Varying Resource Demands," in IEEE Transactions on Computers, vol. 37, no. , pp. 1073-1087, 1988.
86 ms
(Ver 3.3 (11022016))