Article

Free access

The effect of state-saving in optimistic simulation on a cache-coherent non-uniform memory access architecture

Authors:

Christopher D. Carothers,

Kalyan S. Perumalla, and

Richard M. FujimotoAuthors Info & Claims

WSC '99: Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 2

December 1999

Pages 1624 - 1633

https://doi.org/10.1145/324898.325340

Published: 01 December 1999 Publication History

PDF eReader

References

[1]

Brown, R. 1988. Calendar queues: Afast 0(1) priority queue implementation for the simulation event set problem. Communications of the ACM, volume 31, number 10, pages 1220-1227, October.

Digital Library

Google Scholar

[2]

Carothers, C. D., R. M. Fujimoto, and Y-B. Lin 1995. A Case Study in Simulating PCS Networks Using Time Warp. In Proceedings of the 9th Workshop on Parallel and Distributed Simulation, pages 87-94, June.

Digital Library

Google Scholar

[3]

Carothers, C. D., K. S. Perumalla, and R. M. Fujimoto 1999. Efficient Optimistic Parallel Simulations Using Reverse Computation. In Proceedings of the 13th Workshop on Parallel and Distributed Simulation, pages 126-135, May.

Digital Library

Google Scholar

[4]

Fujimoto, R. M. 1989. Time Warp on a shared memory multiprocessor. In Proceedings of the 1989 International Conference on Parallel Processing, volume 3, pages 242-249, August.

Google Scholar

[5]

Fujimoto, R. M. 1989. Time Warp on a shared memory multiprocessor. Transactions of the Society for Computer Simulation, volume 6, number 3, pages 211-239, July.

Digital Library

Google Scholar

[6]

Fujimoto, R. M., and K. Panesar 1995. Buffer management in shared memory time warp systems. In Proceedings of the 9th Workshop on Parallel and Distributed Simulation, pages 149-156, June.

Digital Library

Google Scholar

[7]

Fujimoto, R. M., and M. Hybinette 1997. Computing global virtual time in shared memory multiprocessors. ACM Transactions on Modeling and Computer Simulation, volume 7, number 4, pages 425-446, October.

Digital Library

Google Scholar

[8]

Gomes, F. 1996. Optimizing Incremental State-Saving and Restoration. Ph.D. thesis, Dept. of Computer Science, University of Calgary.

Digital Library

Google Scholar

[9]

Jacob, B., and T. Mudge 1998. A look at several memory management units, TLB-refill mechanisms, and page table organizations. In Proceedings of 8th Int. Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS-VIII), pages 295-306, October.

Digital Library

Google Scholar

[10]

Jefferson, D. R. Virtual time 1985. ACM Transactions on Programming Languages and Systems, volume 7, number 3, pages 404-425, July.

Digital Library

Google Scholar

[11]

Jiang, D., and J. P. Singh 1998. A Methodology and an Evaluation of the SGI Origin2000. In Proceedings of 1998 SIGMETRICS Conference on Measurement and Modeling of Computer Systems, pages 171-181, June.

Digital Library

Google Scholar

[12]

Laudon, J, and D. Lenoski 1997. The SGI Origin: a cc- NUMA highly scalable server In Proceedings of the 24th International Symposium on Computer Architecture, pages 241-251, June.

Digital Library

Google Scholar

[13]

MIPS R10000 Microprocessor User Manual Version 2.0, 1996.

Google Scholar

[14]

Poplawski, A., and D. M. Nicol 1998. Nops: AConservative Parallel Simulation Engine for TeDIn Proceedings of the 12 th Workshop on Parallel and Distributed Simulation, volume 23, pages 180-187, May.

Digital Library

Google Scholar

[15]

Ronngren, R., and R. Ayani 1997. Parallel and sequential priority queue algorithms. ACM Transactions on Modeling and Simulation, volume 7, number 2, pages 157-209, April.

Digital Library

Google Scholar

[16]

Samadi, B 1985. Distributed Simulatio in, Algorithms and Performance Analysis. PhD. Thesis, University of California, Los Angeles, Computer Science Department.

Digital Library

Google Scholar

[17]

Sleator, D. D., and R. E. Tarjan 1986. Self-adjusting heaps. SIAM Journal on Computing, volume 15, number 1, pages 52-59, February.

Digital Library

Google Scholar

[18]

Steinman, J. S. 1993. Incremental state-saving in SPEEDES using C++. In Proceedings of the 1993 Winter Simulation Conference, pages 687-696, December.

Digital Library

Google Scholar

[19]

Uhlig, R., D. Nagle, T. Stanley, T. Mudge 1994. Design Tradeoffs for Software-Managed TLBs. ACM Transactions on Computer Systems, volume 12, number 3, pages 175-205, August.

Digital Library

Google Scholar

[20]

Wieland, F., L. Hawley, A. Feinberg, M. DiLorento, L. Blume, P. Reiher, B. Beckman, P. Hontalas, S. Bellenot, and D. R. Jefferson 1989. Distributed combat simulation and Time Warp: The model and its performance. In Proceedings of the SCS Multiconference on Distributed Simulation, volume 21, pages 14-20, March.

Google Scholar

Cited By

View all

Wang SLuo BShi WTiwari D(2016)Application configuration selection for energy-efficient execution on multicore systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.09.00387(43-54)Online publication date: Jan-2016
https://doi.org/10.1016/j.jpdc.2015.09.003
Pellegrini AQuaglia FTaylor SMustafee NSon Y(2015)NUMA Time WarpProceedings of the 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/2769458.2769479(59-70)Online publication date: 10-Jun-2015
https://dl.acm.org/doi/10.1145/2769458.2769479
Perumalla KPark A(2014)Reverse computation for rollback-based fault tolerance in large parallel systemsCluster Computing10.1007/s10586-013-0277-417:2(303-313)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1007/s10586-013-0277-4
Show More Cited By

Index Terms

The effect of state-saving in optimistic simulation on a cache-coherent non-uniform memory access architecture
1. Computing methodologies
  1. Modeling and simulation
    1. Model development and analysis
      1. Model verification and validation
    2. Simulation types and techniques
      1. Massively parallel and high-performance simulations

Recommendations

Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs
SPAA '23: Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures

Lock-free data structures are an important tool for the development of concurrent programs as they provide scalability, low latency and avoid deadlocks, livelocks and priority inversion. However, they require some sort of additional support to guarantee ...
Read More
High-endurance hybrid cache design in CMP architecture with cache partitioning and access-aware policy
GLSVLSI '13: Proceedings of the 23rd ACM international conference on Great lakes symposium on VLSI

In recent years, NVM (non-volatile memory) technologies, such as STT-RAM (spin transfer torque RAM) and PRAM (phase change RAM), have drawn a lot of attention due to their low leakage and high density. However, both NVMs suffer from high write latency ...
Read More
State saving for interactive optimistic simulation
PADS '97: Proceedings of the eleventh workshop on Parallel and distributed simulation

Time Warp's optimistic scheduling requires the maintenance of simulation state history to support rollback in the event of causality violations. State history, and the ability to rollback the simulation, can provide unique functionality for human-in-the-...
Read More

Comments

Information & Contributors

Information

Published In

WSC '99: Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 2

December 1999

1754 pages

ISBN:0780357809

DOI:10.1145/324898

Editors:
Phillip A. Farrington
Univ. of Alabama in Huntsville, Huntsville
,
Harriet Black Nembhard
Univ. of Wisconsin-Madison, Madison
,
Gerald W. Evans
Univ. of Louisville, Louisville, KY
,
David T. Sturrock
Systems Modeling, Searickley, PA

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

WSC99

Sponsor:

WSC99: Winter Simulation Conference 1999

December 5 - 8, 1999

Arizona, Phoenix, USA

Acceptance Rates

Overall Acceptance Rate 3,413 of 5,075 submissions, 67%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
288
Total Downloads

Downloads (Last 12 months)29
Downloads (Last 6 weeks)4

Other Metrics

View Author Metrics

Citations

Cited By

View all

Wang SLuo BShi WTiwari D(2016)Application configuration selection for energy-efficient execution on multicore systemsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2015.09.00387(43-54)Online publication date: Jan-2016
https://doi.org/10.1016/j.jpdc.2015.09.003
Pellegrini AQuaglia FTaylor SMustafee NSon Y(2015)NUMA Time WarpProceedings of the 3rd ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/2769458.2769479(59-70)Online publication date: 10-Jun-2015
https://dl.acm.org/doi/10.1145/2769458.2769479
Perumalla KPark A(2014)Reverse computation for rollback-based fault tolerance in large parallel systemsCluster Computing10.1007/s10586-013-0277-417:2(303-313)Online publication date: 1-Jun-2014
https://dl.acm.org/doi/10.1007/s10586-013-0277-4
Holder ACarothers C(2011)Investigating the memory characteristics of a massively parallel time warp kernelProceedings of the Winter Simulation Conference10.5555/2431518.2431869(2953-2964)Online publication date: 11-Dec-2011
https://dl.acm.org/doi/10.5555/2431518.2431869
Holder ACarothers C(2011)Investigating the memory characteristics of a massively parallel Time Warp kernelProceedings of the 2011 Winter Simulation Conference (WSC)10.1109/WSC.2011.6147997(2948-2959)Online publication date: Dec-2011
https://doi.org/10.1109/WSC.2011.6147997
Monteiro PMonteiro M(2010)A pattern language for parallelizing irregular algorithmsProceedings of the 2010 Workshop on Parallel Programming Patterns10.1145/1953611.1953624(1-14)Online publication date: 30-Mar-2010
https://dl.acm.org/doi/10.1145/1953611.1953624
Xiaodong Zhu Junmin Wu Xiufeng Sui Wei Yin Qingbo Wang Zhe Gong (2010)PCAsim: A parallel cycle accurate simulation platform for CMPs2010 International Conference On Computer Design and Applications10.1109/ICCDA.2010.5540881(V1-597-V1-601)Online publication date: Jun-2010
https://doi.org/10.1109/ICCDA.2010.5540881
Bauer DCarothers CNicol DFujimoto R(2006)Eliminating remote message passing in optimistic simulationProceedings of the 38th conference on Winter simulation10.5555/1218112.1218295(995-1003)Online publication date: 3-Dec-2006
https://dl.acm.org/doi/10.5555/1218112.1218295
Bauer Jr. DCarothers C(2006)Eliminating Remote Message Passing in Optimistic SimulationProceedings of the 2006 Winter Simulation Conference10.1109/WSC.2006.323187(995-1003)Online publication date: Dec-2006
https://doi.org/10.1109/WSC.2006.323187
Bauer DYaun GCarothers CYuksel MKalyanaraman S(2005)Seven-O'ClockProceedings of the 19th Workshop on Principles of Advanced and Distributed Simulation10.1109/PADS.2005.27(39-48)Online publication date: 1-Jun-2005
https://dl.acm.org/doi/10.1109/PADS.2005.27
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs

High-endurance hybrid cache design in CMP architecture with cache partitioning and access-aware policy

State saving for interactive optimistic simulation

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Releasing Memory with Optimistic Access: A Hybrid Approach to Memory Reclamation and Allocation in Lock-Free Programs

High-endurance hybrid cache design in CMP architecture with cache partitioning and access-aware policy

State saving for interactive optimistic simulation

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations