An adaptive partitioning algorithm for distributed discrete event simulation systems

Journal of Parallel and Distributed Computing

Volumn 62, Issue 9, 2002, Pages 1454-1475

  Boukerche, Azzedine ^a  

^a UNIVERSITY OF NORTH TEXAS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036747245     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2002.1856     Document Type: Article

References (41)

1. E. R. Barnes, An algorithm for partitioning the nodes of a graph, SIAM J. Algebraic Discrete Methods 3 (1982), 541-550.
2. S. Bokhari, "Assignment Problems in Parallel and Distributed Computing," Kluwer Academic Publishers, Boston, 1987.
3. A. Boukerche, Partitioning PCS wireless networks for parallel simulation, Internat. J. Interconnection Networks 1 (2000), 173-193.
4. A. Boukerche, Time management in parallel simulation, in "High Performance Cluster Computing" (R. Buyya, Ed.), pp. 375-394, Prentice-Hall, Englewood Cliffs, NJ, 1999.
5. A. Boukerche and S. K. Das, Nature-inspired optimization algorithms for parallel simulations, in "Solutions to Parallel and Distributed Computing Problems: Lesson from Biological Sciences" (A. Zomaya, F. Ercal, and S. Olariu, Eds.), pp. 87-109, Wiley & Sons, New York, 2001.
6. A. Boukerche and S. K. Das, "Dynamic Load Balancing Strategies for Parallel Simulations," pp. 10-28, IEEE/ACM PADS, New York, 1997.
7. A. Boukerche and C. Tropper, "Parallel Simulation on the Hypercube Multiprocessor," Distributed Computing, pp. 181-190, Springer-Verlag, Berlin, 1995.
8. T. Bui, C. Heigham, C. Jones, and T. Leighton, Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms, in "Proceedings of the 26th ACM/IEEE Design Automation Conference," pp. 775-778, 1989.
9. K. M. Chandy and J. Misra, Asynchronous distributed simulation via sequence of parallel computations, Comm. ACM 24 (April 1981), 198-206.
10. K. M. Chandy and J. Misra, Distributed simulation: A case study in design and verification of distributed programs, IEEE Trans. Software Eng. SE-5 (1979), 440-452.
11. A. Ferscha, Parallel and distributed simulation of discrete event systems, in "Handbook of Parallel and Distributed Computing" (A. Zomaya, Ed.), McGraw-Hill, New York, 1995.
12. C. M. Fiduccia and R. M. Mattheyses, A linear-time heuristic for improving network partitions, in "Proceedings of the 19th Design Automation Conference," Las Vegas, pp. 175-181, 1982.
13. R. M. Fujimoto, Parallel discrete event simulation, Comm. ACM 33 (1990), 30-53.
14. B. P. Gan, Y. H. Low, S. Turner, W. Cai, and W. J. Hsu, Load balancing for conservative stimulation on shared memory multiprocessor systems, in "Proceedings of the 14th IEEE/ACM PADS 2000," pp. 139-146, 2000.
15. M. R. Garey and D. S. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness," W.H. Freeman and Company, New York, 1979.
16. D. Glazer and C. Tropper, On process migration and load balancing in time warp, IEEE Trans. Parallel Distrib. Systems 4 (March 1993), 318-327.
17. A. Galluscio, Douglass, B. Malloy, and J. Turner, A comparison of two methods for advancing time in parallel discrete event simulation, in "Proceedings of the 1995 Winter Simulation Conference," pp. 650-657, 1995.
18. F. Glover, Tabu Search--Part 1, ORSA J. Comput. 1 (1986), 190-206.
19. R. W. Hockney, The communication challenge for MPP: Intel Paragon and Meiko CS-2, Parallel Comput. 20 (1994), 383-398.
20. L. Ingber, Simulated annealing: Practive versus theory, Math. Comput. Modeling 18 (1993), 29-57.
21. J. Keller et al., Scalability analysis for conservative simulation of logical circuits, in "VLSI Design, Special Issue: Current Advances in Parallel Logic Simulation" (A. Boukerche, Ed.), Vol. 9, pp. 219-236, 1999.
22. B. W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System Tech. J. 49 (1970), 291-307.
23. H. Kim and J. Jean, Concurrency preserving partitioning algorithm for parallel logic simulation, in "VLSI Design, Special Issue: Current Advances in Parallel Logic Simulation" (A. Boukerche, Ed.), Vol. 9, pp. 219-236, 1999.
24. S. Kirkpatrick, C. D. Gelatt, and M. P., Vecchi, Optimization by simulated annealing, Science 220 (1983), 671-680.
25. R. Klin and P. Banerjee, Optimization by simulated evolution with applications to standard cell placement, in "Proceedings of the 27th ACM/IEEE Design Automation Conference," 1990.
26. L. Kleinrock, "Queueing Systems," John Wiley & Sons, New York, 1976.
27. S. A. Kravits and R. Rutenbar, Placement by simulated annealing on a multiprocessor, IEEE Trans. Comput. Des. CAD-6 (July 1987), 534-549.
28. Y. B. Lin and E. D. Lazowska, "Conservative Parallel Simulation for Systems with no Lookahead Prediction," TR 89-07-07, Department of Computer Science and Engineering, University of Washington, 1989.
29. T. M. Nabhan and A. Y. Zomaya, A parallel computing engine for a class of time critical processes, IEEE Trans. Systems Man Cybernet.--Part B 27 (1997).
30. T. M. Nabhan and A. Y. Zomaya, A parallel simulated annealing algorithm with low computation overhead, IEEE Trans. Parallel Distrib. Systems 6 (1997), 1226-1253.
31. B. Nandy and W. M. Loucks, On a parallel partitioning techniques for use with conservative parallel simulation, in "Proceeding of the 7th Workshop on Parallel and Distributed Simulation," pp. 43-51, 1993.
32. D. M. Nicol, Parallel discrete-event simulation of FCFS stochastic queuing networks, in "Proceedings of the ACM SIGPLAN Symposium on Parallel Programming, Environments, Applications, and Languages," Yale University, July 1988.
33. L. A. Sanchis, Multi-way partitioning network partitioning, IEEE Trans. Comput. 38 (January 1989), 62-81.
34. F. Sarkar and S. K. Das, "Design and implementation of dynamic load balancing algorithms for rollback reduction in optimistic PDES, in "VLSI Design, Special Issue: Current Advances in Parallel Logic Simulation" (A. Boukerche Guest-Ed.), Vol. 9, pp. 271-290, 1999.
35. W. K. Su, and C. L. Seitz, Variants of the Chandy-Misra-Bryant distributed discrete event simulation algorithm, in "Proceedings of the SCS Multiconference on Distributed Simulation," Vol. 21, 1989.
36. C. Sporrer and H. Bauer, Corolla partitioning for distributed logic simulation of VLSI-circuits, in "Proceedings of the SCS Multiconference on Parallel and Distributed Simulation," SCS Simulation Serie, Vol. 23, pp. 85-92, 1993.
37. L. Tao, B. Narahari, and Y. C. Zaho, "Partitioning Problems in Heterogeneous Computing," Workshop on Heterogeneous Processing, pp. 23-28, 1993.
38. A. C. Palaniswamy and P. Wilsey, An analytical comparison of periodic checkpointing and incremental state saving, in "Proceedings of the PADS'97," pp. 127-134, 1993.
39. E. E. Witte, R. D. Chamberlain, and M. A. Franklin, Task assignment by parallel simulated annealing, IEEE Trans. Parallel Distrib. Systems (1991).
40. S. Salleh and A. Y. Zomaya, 1998, Multiprocessor scheduling using mean-field annealing, J. Future Generation Comput. Systems, 14 393-408.
41. A. Y. Zomaya and R. Kazman, 1999, Simulated annealing techniques, in "Handbook of Algorithms and Theory of Computation" (M.J. Atallah, Ed.) (Chap. 37) pp. 37.1-37.19, CRC Press, Boca Raton, FL,