Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problem
Communications of the ACM
Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
Some Results of the Earliest Deadline Scheduling Algorithm
IEEE Transactions on Software Engineering
Time warp on a shared memory multiprocessor
Transactions of the Society for Computer Simulation International
What is predictability for real-time systems?
Real-Time Systems
MIDAS: Integrated Design and Simulation of Distributed Systems
IEEE Transactions on Software Engineering
Task scheduling and synchronization for multiprocessor real-time systems
Task scheduling and synchronization for multiprocessor real-time systems
An effective synchronization network for hot-spot accesses
ACM Transactions on Computer Systems (TOCS)
Performance of a riskfree Time Warp operating system
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Time Warp simulation in time constrained systems
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
A machine independent interface for lightweight threads
ACM SIGOPS Operating Systems Review
Design and performance analysis of hardware support for parallel simulations
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
A spectrum of options for parallel simulation
WSC '88 Proceedings of the 20th conference on Winter simulation
Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)
Distributed simulation, algorithms and performance analysis (load balancing, distributed processing)
The treatment of state in optimistic systems
PADS '95 Proceedings of the ninth workshop on Parallel and distributed simulation
Parallel and distributed simulation
WSC '95 Proceedings of the 27th conference on Winter simulation
Infrastructure for rapid execution of strike-planning systems
WSC '95 Proceedings of the 27th conference on Winter simulation
State saving for interactive optimistic simulation
Proceedings of the eleventh workshop on Parallel and distributed simulation
XSim: real-time analytic parallel simulations
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Experiment scheduling in faster-than-real-time simulation
Proceedings of the sixteenth workshop on Parallel and distributed simulation
Real time simulation framework for RT-DEVS models
Transactions of the Society for Computer Simulation International - Recent advances in DEVS methodology--part II
Predictable Time Management for Real-Time Distributed Simulation
Proceedings of the seventeenth workshop on Parallel and distributed simulation
Hi-index | 0.00 |
This paper describes issues concerning the design of an optimistic parallel discrete event simulation system that executes in environments that impose real-time constraints on the simulator's execution. Two key problems must be addressed by such a system. First the timing characteristics of the parallel simulator must be sufficiently predictable to allow one to guarantee that real-time deadlines for completing simulation computations will be met. Second, the optimistic computation must be able to interact with its surrounding environment with as little latency as possible, necessitating rapid commitment of I/O operations.To address the first question, we show that optimistic simulators that never send incorrect messages (sometimes called “aggressive-no-risk” simulators) provide sufficient predictability to allow traditional schedulability analysis techniques commonly used in real-time systems to be applied. We show that incremental state saving techniques introduce sufficient unpredictability that they are not well-suited for real-time environments. We observe that the traditional “lowest timestamp first” scheduling policy used in many optimistic parallel simulation systems is an optimal (in the real-time sense) scheduling algorithm when event timestamps and real-time deadlines are the same. Finally, to address the question for rapid commitment of I/O operations, we utilize a continuous GVT computation scheme for shared-memory multiprocessors where a new value of GVT is computed after processing each event in the simulation.These ideas are incorporated in a parallel, optimistic, real-time simulation system called PORTS. Initial performance measurements of the shared-memory based PORTS system executing on a Kendall Square Research multiprocessor are presented. Initial performance results are encouraging, demonstrating that PORTS achieves performance approaching that of a conventional Time Warp system for the benchmark programs that were tested.