An evolutionary algorithm to optimize log/restore operations within optimistic simulation platforms
Pages 206 - 215
Abstract
In this work we address state recoverability in advanced optimistic simulation systems by proposing an evolutionary algorithm to optimize at run-time the parameters associated with state log/restore activities. Optimization takes place by adaptively selecting for each simulation object both (i) the best suited log mode (incremental vs non-incremental) and (ii) the corresponding optimal value of the log interval. Our performance optimization approach allows to indirectly cope with hidden effects (e.g., locality) as well as cross-object effects due to the variation of log/restore parameters for different simulation objects (e.g., rollback thrashing). Both of them are not captured by literature solutions based on analytical models of the overhead associated with log/restore tasks. More in detail, our evolutionary algorithm dynamically adjusts the log/restore parameters of distinct simulation objects as a whole, towards a well suited configuration. In such a way, we prevent negative effects on performance due to the biasing of the optimization towards individual simulation objects, which may cause reduced gains (or even decrease) in performance just due to the aforementioned hidden and/or cross-object phenomena. We also present an application-transparent implementation of the evolutionary algorithm within the ROme OpTimistic Simulator (ROOT-Sim), namely an open source, general purpose simulation environment designed according to the optimistic synchronization paradigm. Further, we provide the results of an experimental study testing our proposal on a suite of simulation models for wireless communication systems.
References
[1]
http://traffico.octotelematics.it/.
[2]
Private communication.
[3]
T. Bäck, U. Hammel, and H.-P. Schwefel. Evolutionary computation: Comments on the history and current state. IEEE Transactions on Evolutionary Computation, 1:3--17, 1997.
[4]
A. Boukerche, S. K. Das, A. Fabbri, and O. Yildz. Exploiting model independence for parallel PCS network simulation. In Proceedings of the 13th Workshop on Parallel and Distributed Simulation, pages 166--173. IEEE Computer Society, May 1999.
[5]
C. A. C. Coello, D. A. Van Veldhuizen, and G. B. Lamon. Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer, 2002.
[6]
V. Cortellessa and F. Quaglia. A checkpointing-recovery scheme for time warp parallel simulation. Parallel Computing, 27(9):1227--1252, 2001.
[7]
D. Cucuzzo, S. D'Alessio, F. Quaglia, and P. Romano. A lightweight heuristic-based mechanism for collecting committed consistent global states in optimistic simulation. In Proceedings of the 11th IEEE International Symposium on Distributed Simulation and Real-Time Applications, pages 227--234, 2007.
[8]
K. Deb. Multi-Objective Optimization using Evolutionary Algorithms. Wiley, 2001.
[9]
K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan. A fast elitist non-dominated sorting genetic algorithm for multi-objective optimisation: Nsga-ii. In PPSN VI: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature, pages 849--858, London, UK, 2000. Springer-Verlag.
[10]
J. Fleischmann and P. A. Wilsey. Comparative analysis of periodic state saving techniques in Time Warp simulators. In Proceedings of the 9th Workshop on Parallel and Distributed Simulation, pages 50--58. IEEE Computer Society, June 1995.
[11]
M. P. Fourman. Compaction of symbolic layout using genetic algorithms. In Proceedings of the 1st International Conference on Genetic Algorithms, pages 141--153, Hillsdale, NJ, USA, 1985. L. Erlbaum Associates Inc.
[12]
S. Franks, F. Gomes, B. Unger, and J. Cleary. State saving for interactive optimistic simulation. In Proceedings of the 11th workshop on Parallel and Distributed Simulation, pages 72--79. IEEE Computer Society, 1997.
[13]
R. M. Fujimoto. Parallel discrete event simulation. Communications of the ACM, 33(10):30--53, Oct. 1990.
[14]
http://www.dis.uniroma1.it/~quaglia/software/ROOT-Sim.
[15]
D. R. Jefferson. Virtual Time. ACM Transactions on Programming Languages and System, 7(3):404--425, July 1985.
[16]
S. Kandukuri and S. Boyd. Optimal power control in interference-limited fading wireless channels with outage-probability specifications. IEEE Transactions on Wireless Communications, 1(1):46--55, 2002.
[17]
J. Knowles and D. Corne. The Pareto archived evolution strategy: a new baseline algorithm for Pareto multiobjective optimisation. volume 1, page 105 Vol. 1, 1999.
[18]
F. Kursawe. A variant of evolution strategies for vector optimization. In PPSN I: Proceedings of the 1st Workshop on Parallel Problem Solving from Nature, pages 193--197, London, UK, 1991. Springer-Verlag.
[19]
R. A. Meyer, J. Martin, and R. Bagrodia. Slow memory: the rising cost of optimism. In Proceedings of the 14th Workshop on Parallel and Distributed Simulation (PADS 2000, 2000.
[20]
A. Park and R. Fujimoto. Optimistic parallel simulation over public resource-computing infrastructures and desktop grids. In Proc. of the 12th IEEE International Symposium on Distributed Simulation and Real Time Applications, 2008.
[21]
G. T. Parks and I. Miller. Selective breeding in a multiobjective genetic algorithm. In PPSN V: Proceedings of the 5th International Conference on Parallel Problem Solving from Nature, pages 250--259, London, UK, 1998. Springer-Verlag.
[22]
A. Pellegrini, R. Vitali, and F. Quaglia. Di-DyMeLoR: Logging only dirty chunks for efficient management of dynamic memory based optimistic simulation objects. In Proceedings of the 2009 ACM/IEEE/SCS 23rd Workshop on Parallel and Distributed Simulation (PADS 2009.
[23]
K. S. Perumalla. μ-sik: A micro-kernel for parallel/distributed simulation systems. In PADS '05: Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation, pages 59--68, Washington, DC, USA, 2005. IEEE Computer Society.
[24]
B. R. Preiss, W. M. Loucks, and I. D. MacIntyre. Effects of the checkpoint interval on time and space in Time Warp. ACM Transactions on Modeling and Computer Simulation, 4(3):223--253, July 1994.
[25]
F. Quaglia. A cost model for selecting checkpoint positions in Time Warp parallel simulation. IEEE Transactions on Parallel and Distributed Systems, 12(4):346--362, Feb. 2001.
[26]
F. Quaglia and A. Santoro. Non-blocking checkpointing for optimistic parallel simulation: Description and an implementation. IEEE Transactions on Parallel and Distributed Systems, 14(6):593--610, June 2003.
[27]
R. Rönngren and R. Ayani. Adaptive checkpointing in Time Warp. In Proceedings of the 8th Workshop on Parallel and Distributed Simulation, pages 110--117. Society for Computer Simulation, July 1994.
[28]
R. Rönngren and R. Ayani. A comparative study of parallel and sequential priority queue algorithms. ACM Transactions on Modeling and Computer Simulation, 7(2):157--209, 1997.
[29]
R. Rönngren, M. Liljenstam, R. Ayani, and J. Montagnat. Transparent incremental state saving in Time Warp parallel discrete event simulation. In Proceedings of the 10th Workshop on Parallel and Distributed Simulation, pages 70--77. IEEE Computer Society, May 1996.
[30]
A. Santoro and F. Quaglia. Transparent state management for optimistic synchronization in the High Level Architecture. In Proceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation, pages 171--180. IEEE Computer Society, June 2005.
[31]
A. Santoro and F. Quaglia. A version of MASM portable across different UNIX systems and different hardware architectures. In Proceedings of the 9th International Symposium on Distributed Simulation and Real Time Applications. IEEE Computer Society, Oct. 2005.
[32]
J. D. Schaffer. Multiple objective optimization with vector evaluated genetic algorithms. In Proceedings of the 1st International Conference on Genetic Algorithms, pages 93--100, Hillsdale, NJ, USA, 1985. L. Erlbaum Associates Inc.
[33]
H. M. Soliman and A. S. Elmaghraby. An analytical model for hybrid checkpointing in Time Warp distributed simulation. IEEE Transactions on Parallel and Distributed Systems, 9(10):947--951, Oct. 1998.
[34]
J. Steinman. Incremental state saving in SPEEDES using C Plus Plus. In Proceedings of the Winter Simulation Conference, pages 687--696. Society for Computer Simulation, Dec. 1993.
[35]
R. Toccaceli and F. Quaglia. DyMeLoR: Dynamic memory logger and restorer library for optimistic simulation objects with generic memory layout. In PADS '08: Proceedings of the 22nd Workshop on Principles of Advanced and Distributed Simulation, pages 163--172, Rome, Italy, 2008. IEEE Computer Society.
[36]
R. Vitali, A. Pellegrini, and F. Quaglia. Autonomic log/restore for advanced optimistic simulation systems. In Proceedings of the 18th International Symposium on Modeling, Analysis, and Simulation of Computer Systems, pages 319--327, Miami, Florida, USA, 2010. IEEE Computer Society.
[37]
D. West and K. Panesar. Automatic incremental state saving. In Proceedings of the 10th Workshop on Parallel and Distributed Simulation, pages 78--85. IEEE Computer Society, May 1996.
[38]
E. Zitzler, K. Deb, and L. Thiele. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary Computation, 8:173--195, 2000.
[39]
E. Zitzler, M. Laumanns, and L. Thiele. Spea2: Improving the strength Pareto evolutionary algorithm. Technical report, 2001.
[40]
E. Zitzler and L. Thiele. Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach, 1999.
Index Terms
- An evolutionary algorithm to optimize log/restore operations within optimistic simulation platforms
Recommendations
Parallel discrete event simulation for DEVS cellular models using a GPU
HPC '12: Proceedings of the 2012 Symposium on High Performance ComputingThe discrete event systems specification (DEVS) simulation has been studied to analyze complex homogeneous systems which is represented by the cellular models. In the simulation of large-scale DEVS cellular model, it requires a high-performance ...
Conservative vs. optimistic parallel simulation of DEVS and Cell-DEVS: a comparative study
SCSC '10: Proceedings of the 2010 Summer Computer Simulation ConferenceThe conservative Parallel DEVS protocol offers a novel approach that allows conservative simulation of DEVS-based PDES systems. The protocol is based on the classical Chandy-Misra-Bryant synchronization mechanism, and it extends the DEVS abstract ...
Parallel VHDL simulation
DATE '98: Proceedings of the conference on Design, automation and test in EuropeIn this paper we evaluate parallel VHDL simulation based on conservative parallel discrete event simulation (conservative PDES) algorithms. We focus on a conservative simulation algorithm based on critical and external distances. This algorithm exploits ...
Comments
Information & Contributors
Information
Published In
March 2011
527 pages
ISBN:9781936968008
- General Chairs:
- Jason Liu,
- Francesco Quaglia,
- Program Chairs:
- Stephan Eidenbenz,
- Stephen Gilmore
Sponsors
- ICST
In-Cooperation
Publisher
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)
Brussels, Belgium
Publication History
Published: 21 March 2011
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SIMUTools '11
Sponsor:
SIMUTools '11: 4th International ICST Conference on Simulation Tools and Techniques
March 21 - 25, 2011
Barcelona, Spain
Acceptance Rates
Overall Acceptance Rate 20 of 73 submissions, 27%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 57Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 15 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in