The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.09 - September (1988 vol.37)
pp: 1073-1087
ABSTRACT
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
INDEX TERMS
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.
CITATION
D.M. Nicol, J.H. Saltz, "Dynamic Remapping of Parallel Computations with Varying Resource Demands", IEEE Transactions on Computers, vol.37, no. 9, pp. 1073-1087, September 1988, doi:10.1109/12.2258
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool