SimSnap: Fast-forwarding via native execution and application-level checkpointing

Proceedings - Eighth Workshop on Interaction between Compilers and Computer Architectures, INTERACT-8 2004

Volumn , Issue , 2004, Pages 65-74

  Szwed, Peter K ^a   Marques, Daniel ^b   Buels, Robert M ^a   McKee, Sally A ^a   Schulz, Martin ^a  

^a Cornell University   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION-LEVEL CHECKPOINTING (ALC); ARCHITECTURAL SIMULATIONS; CLUSTERING ANALYSIS; CODE ADDITIONS;

BENCHMARKING; COMPUTER SIMULATION; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; OPTIMIZATION; PERTURBATION TECHNIQUES; TIME MEASUREMENT;

COMPUTER ARCHITECTURE;

EID: 4544385770     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INTERA.2004.1299511     Document Type: Conference Paper

References (24)

1. A. Beguelin, E. Seligman, and P. Stephan. Application level fault tolerance in heterogeneous networks of workstations. Journal of Parallel and Distributed Computing, 43 (2): 147-155, 1997.
2. G. Bronevetsky, D. Marques, K. Pingali, an P. Stodghill. Automated application-level checkpointing of mpi programs. In Principles and Practice of Parallel Programming (PPoPP), pages 84-94, June 2003.
3. G. Bronevetsky, D. Marques, K. Pingali, and P. Stodghill. Collective operations in an application-level fault tolerant mpi system. In Proceedings of the 2003 International Conference on Supercomputing, pages 234-243, June 2003.
4. M. Chandy and L. Lamport. Distributed snapshots: Determining global states of distributed systems. ACM Transactions on Computer Systems, 3(1):63-75, 1985.
5. T. Conte, M. Hirsch, and K. Menezes. Reducing state loss for effective trace sampling of superscalar processors. In Proceedings of the 1996 IEEE International Conference on Computer Design, pages 468-477, Oct. 1996.
6. S. P. E. Corporation. SPEC CPU benchmark suite. http://www.specbench.org/ osg/cpu2000/, 2000.
7. R. Desikan, D. Burger, and S. Keckler. Measuring Experimental Error in Multiprocessor Simulation. In Proceedings of the 28th Annual International Symposium on Computer Architecture, pages 266-277, June 2001.
8. R. Desikan, D. Burger, S. Keckler, and T. Austin. Sim-alpha: a Validated, Execution-Driven Alpha 21264 Simulator. Technical Report TR-01-23, Department of Computer Sciences, The University of Texas at Austin, 2001.
9. A. Ferrari, S. Chapin, and A. Grimshaw. A heterogeneous checkpoint/restart mechanism based on automatic code modification. Technical Report CS-97-05, University of Virginia Department of Computer Science, Mar. 1997.
10. D. Jefferson. Virtual time. ACM Trans. Prog. Lang. Syst., 7(3):404-425, 1985.
11. J. H. Jr. and K. Skadron. Minimal subset evaluation: Rapid warm-up for simulated hardware state. In Proceedings of the 2001 IEEE International Conference on Computer Design, Sept. 2001.
12. J. H. Jr. and K. Skadron. Memory reference reuse latency: Accelerated sampled microarchitecture simulation. In IEEE International Symposium on Performance Analysis of Systems and Software, Mar. 2003.
13. A. KleinOsowski and D. Lilja. MinneSPEC: A new SPEC benchmark workload for simulation-based computer architecture research. http://www.arctic.umn.edu/ ~lilja/papers/minnespec-cal-v2.pdf, 2000.
14. A. KleinOsowski and D. Lilja. MinneSPEC: A new SPEC benchmark workload for simulation-based computer architecture research. Computer Architecture Letters, 11, June 2002.
15. T. Lafage and A. Seznec. Choosing representative slices of program execution for microarchitecture simulations: A preliminary application to the data stream. In Proceedings of the Third IEEE Workshop on Workload Characterization, pages 102-110, Sept. 2000.
16. M. Litzkow and M. Solomon. Supporting checkpoint and process migration outside the UNIX kernel. In Usenix Winter Technical Conference, pages 283-290, Jan. 1992.
17. J. Plank, M. Beck, and G. Kingsley. Compiler-assisted memory exclusion for fast checkpointing. IEEE Technical Committee on Operating Systems and Application Environments, 7(4):10-14, winter 1995.
18. J. Plank, M. Beck, G. Kingsley, and K. Li. Libckpt: Transparent checkpointing under UNIX. In Usenix Winter Technical Conference, pages 213-223, Jan. 1995.
19. J. Plank, Y. Chen, K. Li, M. Beck, and G. Kingsley. Memory exclusion: Optimizing the performance of checkpointing systems. Software - Practice and Experience, 29(2): 125-142, 1999.
20. B. Ramkumar and V. Strumpen. Portable checkpointing for heterogeneous architectures. In International Symposium on Fault-Tolerant Computing, pages 58-67, June 1997.
21. J. Robinson, S. H. Russ, B. Heckel, and B. Flachs. A task migration implementation of the message-passing interface. In Proceedings of High Performance Distributed Computing, pages 61-68, Aug. 1996.
22. T. Sherwood, E. Perelman, and B. Calder. Basic block distribution analysis to find periodic behavior and simulation points in applications. In Proceedings of the 2001 International Conference on Parallel Architectures and Compilation Techniques, pages 3-14, Sept. 2001.
23. T. Sherwood, E. Perelman, G. Hamerly, and B. Calder. Automatically characterizing large scale program behavior. In Proceedings of the 10th Symposium on Architectural Support for Programming Languages and Operating Systems, pages 45-57, Oct. 2002.
24. S. Woo, M. Ohara, E. Torrie, J. Singh, and A. Gupta. The SPLASH-2 Programs: Characterization and Methodological Considerations. In Proceedings of the 22nd Annual International Symposium on Computer Architecture, pages 24-36, June 1995.