Memory management algorithms for optimistic parallel simulation

DOI10.1016/0020-0255(94)90051-5MaRDI QIDQ1328537zbMATH OpenOpenAlexFDO

Authors Yi-Bing Lin

Publication date 26 July 1994

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(94)90051-5

zbMATH Keywords

time warpmemory management algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Optimal memory management for time warp parallel simulation
• Hierarchical memory management for parallel programs
• On the problem of optimizing parallel programs for complex memory hierarchies
• Scalable optimistic parallel simulation
• Memory management optimization problems for integrated circuit simulators
• Optimization of data exchange in parallel computers with distributed memory
• Efficient external memory algorithms by simulating coarse-grained parallel algorithms

Cites work

• A study of time warp rollback mechanisms
• A time-division algorithm for parallel simulation
• Memory management algorithms for optimistic parallel simulation
• On terminating a distributed discrete event simulation
• Optimal memory management for time warp parallel simulation
• Parallelism analyzers for parallel discrete event simulation

Cited in

(3)

• scientific article; zbMATH DE number 1822253 (Why is no real title available?)
• ROSS: A high-performance, low-memory, modular time warp system.
• Memory management algorithms for optimistic parallel simulation

This page was built for publication: Memory management algorithms for optimistic parallel simulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328537)