This Article 
 Bibliographic References 
 Add to: 
Dynamic Remapping of Parallel Computations with Varying Resource Demands
September 1988 (vol. 37 no. 9)
pp. 1073-1087
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

[1] C. Anderson and C. Greengard, "On vortex methods,"SIAM J. Numer. Anal., vol. 22, pp. 413-440, 1985.
[2] S. Baden, "Dynamic load balancing of a vortex calculation running on multiprocessors," Univ. California, Berkeley, Comput. Sci. Tech. Rep., 1986.
[3] R. E. Bank, "A multi-level iterative method for nonlinear elliptic equations," inElliptic Problem Solvers, M. Schultz, Ed. New York: Academic 1981.
[4] D. Bai and A. Brandt, "Local mesh refinement multilevel techniques," Dep. Appl. Math., Weizmann Instit. Sci. Rep., 1984.
[5] J. A. Bannister and K. S. Trivedi, "Task allocation in fault-tolerant distributed systems,"Acta Informatica, vol. 20, pp. 261-281, 1983.
[6] M. J. Berger and S. Bokhari, "The partitioning of non-uniform problems," ICASE Rep. 85-55, Nov. 1985.
[7] M. J. Berger and A. Jameson, "Automatic adaptive grid refinement for the Euler equations,"AIAA J., vol. 23, pp. 561-586, 1985.
[8] M. J. Berger and J. Oliger, "Adaptive mesh refinement for hyperbolic partial differential equations,"J. Comp. Phys., vol. 53, pp. 484- 512, 1984.
[9] S. Bokhari, "Partitioning problems in parallel, pipelined, and distributed computing," ICASE Rep. 85-54, Nov. 1985.
[10] A. Brandt, "Multilevel adaptive solutions to boundary value problems,"Math. Computat., vol. 31, pp. 333-390, 1977.
[11] K. M. Chandy and J. Misra, "Distributed simulation: A case study in design and verification of distributed programs,"IEEE Trans. Software Eng., vol. SE-5, pp. 440-452, Sept. 1979.
[12] W. W. Chu, L. J. Holloway, M. Lan, and K. Efe, "Task allocation in distributed data processing,"Computer, vol. 13, pp. 57-69, Nov. 1980.
[13] A. I. Concepcion, "Distributed simulation on multi-processors: Specification, design, and architecture," Ph.D. dissertation, Wayne State Univ., Jan. 1985.
[14] H. A. David,Order Statistics. New York: Wiley, 1981.
[15] P. J. Denning, "Working sets past and present,"IEEE Trans. Software Eng., vol. SE-6, pp. 64-84, Jan. 1980.
[16] A. Dutta, G. Koehler, and A. Whinston, "On optimal allocation in a distributed processing environment,"Management Sci., vol. 28, pp. 839-853, Aug. 1982.
[17] D. Eager, E. Lazowska, and J. Zahorjan, "Adaptive load sharing in homogeneous distributed systems,"IEEE Trans. Software Eng., vol. SE-12, no. 5, pp. 662-675, May 1986.
[18] G. S. Fishman,Principles of Discrete Event Simulation. New York: Wiley, 1978.
[19] G. J. Foschini, "On heavy traffic diffusion analysis and dynamic routing in packet switched networks," inComputer Performance, K. M. Chandy and M. Reiser Eds. New York: North-Holland, 1977.
[20] G. C. Fox and W. Furmanski, "Load balancing by a neural network," Cal. Tech Rep. C3P 363, Sept. 1986.
[21] G. C. Fox and S. W. Otto, "Concurrent computation and theory of complex systems," Cal Tech Rep. C3P 255, CALT-68-1343, Mar. 1986.
[22] E. Gelenbe, "On the optimum checkpoint interval,"J. ACM, vol. 26, no. 2, pp. 259-270, 1979.
[23] A. George, M. T. Heath, J. Liu, and E. Ng, "Sparse Cholesky factorization on a local-memory multiprocessort," Oak Ridge Tech. Rep. ORNL/TM-9962.
[24] W. D. Gropp, "Local uniform mesh refinement with moving grids," Yale Tech. Rep. YALEU/DCS/RR-313, Apr. 1984.
[25] W. D. Gropp, "Local uniform mesh refinement on loosely-coupled parallel processors," Yale Tech. Rep. YALEU/DCS/RR-352, Dec. 1984.
[26] W. D. Gropp, "Dynamic grid manipulation for PDE's on hypercube parallel processors," Yale. Tech. Rep. YALEU/DCS/RR-458, Mar. 1986.
[27] D. Gusfield, "Parametric combinatorial computing and a problem of module distribution,"J. ACM, no. 3, pp. 551-563, 1983.
[28] A. Harten and J. M. Hyman, "Self-adjusting grid methods for one-dimensional hyperbolic conservation laws," Los Alamos Rep. LA- 9105, 1981.
[29] M. A. Iqbal, J. H. Saltz, and S. H. Bokhari, "Performance tradeoffs in static and dynamic load balancing strategies," inProc. 1986 Int. Conf. Parrallel Processing.
[30] D. Jefferson, "Virtual Time,"ACM Trans. Programming Languages, Vol. 7, No. 3, July 1985, pp. 404-425.
[31] A. Leonard, "Vortex methods for flow simulation,"J. Comp. Phys., vol. 37, pp. 289-335, 1980.
[32] S. McCormick and J. Thomas, "The fast adaptive composite grid method for elliptic equations,"Math. Computat., vol. 46, pp. 439- 456, 1986.
[33] L. M. Ni, C. Xu, and T. B. Gendreau, "A distributed drafting algorithm for load balancing,"IEEE Trans. Software Eng., vol. SE-11, no. 10, pp. 1153-1161, Oct. 1985.
[34] D. M. Nicol and P. F. Reynolds, Jr., "The automated partitioning of simulations for parallel execution," Univ. Virginia Dep. Comput. Sci. Tech. Rep. TR-85-15, Aug. 1985.
[35] D. M. Nicol and P. F. Reynolds, Jr., "Dynamic remapping decisions in multi-phase parallel computations," ICASE Rep. 86-58, Sept. 1986.
[36] J. K. Peacock, E. Manning, and J. W. Wong, "Synchronization of distributed simulation using broadcast algorithms,"Comput. Networks, vol. 4, pp. 3-10, 1980.
[37] M. M. Rai and T. L. Anderson, "The use of adaptive grid generation method for transonic airfoil flow calculations," AIAA Paper 81, 1012, June 1981.
[38] P. F. Reynolds, Jr., "A shared resource algorithm for distributed simulation," inProc. Ninth Annu. Int. Comput. Architecture Conf., Austin, TX, Apr. 1982, pp. 259-266.
[39] S. Ross,Applied Probability Models with Optimization Applications. San Francisco, CA: Holden and Day, 1971.
[40] S. Ross,Stochastic Processes. New York: Wiley, 1983.
[41] J. H. Saltz and M. C. Chen, "Automated problem mapping: The crystal runtime system," inProc. Hypercube Microprocessor Conf., Knoxville, TN, Sept. 1986.
[42] J. H. Saltz and D. M. Nicol, "Statistical methodologies for the control of dynamic remapping," ICASE Rep. 8646, June 1986;Proc. Army Res. Workshop Parallel Processing Medium Scale Multiprocessors, Palo Alto, CA, Jan. 1986.
[43] J. H. Saltz, "Automated problem scheduling and reduction of synchronization delay effects," ICASE Rep. 87-22, May 1987, submitted for publication.
[44] R. Smith and J. Saltz, "Performance analysis of strategies for moving mesh control," inProc. CMG XV Int. Conf. Management Perform. Eval. Comput. Syst., 1984, pp. 301-308.
[45] J. R. Spirn,Program Behavior: Models and Measurements, Operating and programming systems series. New York, Elsevier, 1976.
[46] J. A. Stankovic, "An application of Bayesian decision theory to decentralized control of job scheduling,"IEEE Trans. Comput., vol. C-34, pp. 117-130, Feb. 1985.
[47] J. A. Stankovic, K. Ramamritham, and S. Cheng, "Evaluation of a flexible task scheduling algorithm for distributed hard real-time systems,"IEEE Trans. Comput., vol. C-34, pp. 1130-1143, Dec. 1985.
[48] H. S. Stone, "Critical load factors in distributed computer systems,"IEEE Trans. Software Eng., vol. SE-4, pp. 254-258, May 1978.
[49] D. Towsley, "Queueing network models with state-dependent routing,"J. ACM, vol. 27, pp. 323-337, Apr. 1980.
[50] A. N. Tantawi and D. Towsley, "Optimal static load balancing in distributed computer systems,"J. ACM, pp. 445-465, Apr. 1985.
[51] W. Usab and E. M. Murman, "Embedded mesh solutions of the Euler equation using a multiple-grid method," inProc. AIAA Comput. Fluid Dynam. Conf., Danvers, MA, July 1983, paper 83-1946.
[52] D. R. Wells, "Multirate linear multistep methods for the solution of systems of ordinary differential equations," Univ. Illinois Rep. UIUCDCS-R-82-1093, July 1982.
[53] O. C. Zienkiewicz and A. W. Craig, "Adaptive mesh refinement and a posteriori error estimation for the p-version of the finite element method, inAdaptive Computational Methods for Partial Differential Equations, Ivo Babuska, Ed. Philadelphia, PA: SIAM, 1983.

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.
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, Sept. 1988, doi:10.1109/12.2258
Usage of this product signifies your acceptance of the Terms of Use.