This Article 
 Bibliographic References 
 Add to: 
On Process Migration and Load Balancing in Time Warp
March 1993 (vol. 4 no. 3)
pp. 318-327

A load balancing algorithm for a discrete event simulation executed under Time Warp ispresented. The algorithm rests upon recent developments in active process migration,which permit the use of dynamic strategies. Dynamic load balancing allows forreadjustments when resource requirements vary during simulation. It is also useful wheninitial resource predictions are unknown or incorrect. A simulated multiprocessorenvironment (PARALLEX) was developed in order to evaluate the algorithm. The resultsindicate that substantial performance gains may be realized with the algorithm.

[1] Y. Artsy and R. Finkel, "Designing a process migration facility,"IEEE Comput. Mag., Sept. 1989.
[2] D. Jefferson and H. Sowizral, "Fast concurrent simulation using the Time Warp mechanism, Part I: Local control," TR-83-204, U.S.C., Los Angeles, CA, 1983.
[3] D. Jefferson, "Virtual Time,"ACM Trans. Programming Languages, Vol. 7, No. 3, July 1985, pp. 404-425.
[4] R. M. Fujimoto, "Parallel discrete event simulation,"Commun. ACM, vol. 33, no. 10, pp. 30-53, Oct. 1990.
[5] P. Reiher and D. Jefferson, "Virtual time based dynamic load management in the Time Warp operating system,"Distributed Simulation, vol. 22, no. 1, 1989.
[6] F. Douglis and J. Ousterhout, "Process migration in the sprite operating system," inProc. Seventh Int. Conf. Distributed Comput. Syst., CS Press, Los Alamitos, CA, 1987.
[7] B. P. Miller, "DEMOS/MP: The development of a distributed operating system,"Software Practice and Experience, vol. 17, no. 4, Apr. 1987.
[8] M. Theimer, K. Lantz, and D. Cheriton, "Preemptive remote execution facilities for the V-System," Dep. Comput. Sci., Stanford Univ., Tech. Rep. STAN-CS-85-1087, Sept. 1985.
[9] G.J. Popek and B.J. Walker,The Locus Distributed System Architecture, MIT Press, Cambridge, Mass., 1985.
[10] E. Zayas, "Attacking the Process Migration Bottleneck,"Proc. 11th Symp. Operating Syst. Principles, Nov. 1987, pp. 13-24.
[11] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[12] J. R. Agre, "Simulation of Time Warp distributed simulations,"Distributed Simulation, vol. 21, no. 2, 1989.
[13] D. W. Glazer and C. Tropper, "A new metric for dynamic routing algorithms,"IEEE Trans. Commun., vol. 38, no. 3, Mar. 1990.
[14] L. Bomans and D. Roose, "Benchmarking the iPSC/2 Hypercube Multiprocessor,"Concurrency: Practice and Experience. vol. 1, no. 1, pp. 3-18, Sept. 1989.
[15] iPSC/2 Performance Report, Intel Scientific Computers, Beaverton, OR, Jan. 1988.
[16] L. Kleinrock,Queueing Systems Vol. 1: Theory. New York: Wiley-Interscience, 1975.
[17] Butterfly GP1000 Switch Tutorial, BBN Advanced Computers Inc., 1989.
[18] N. Krivossidis, "On performance evaluation of Time Warp," Tech. Rep. TR-SOCS-91.3, School of Computer Sci., McGill Univ., Montreal, P.Q., Canada, 1991.
[19] D. W. Glazer, "Load balancing a Time Warp simulation," Tech. Rep. TR-SOCS-91.1, School of Computer Sci., McGill Univ., Montreal, P.Q., Canada, 1991.

Index Terms:
Index Termsprocess migration; load balancing; Time Warp; discrete event simulation; active processmigration; resource requirements; simulated multiprocessor environment; PARALLEX;discrete event simulation; resource allocation
D.W. Glazer, C. Tropper, "On Process Migration and Load Balancing in Time Warp," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 3, pp. 318-327, March 1993, doi:10.1109/71.210814
Usage of this product signifies your acceptance of the Terms of Use.