| 1 |
Conservative algorithms impose one or more constraints
-
Object interactions limited to just "neighbors" (e.g., Chandy-Misra)
-
Object interactions have non-zero time scales (e.g., lookahead)
-
Object interactions follow FIFO constraint
|
| 2 |
Optimistic algorithms impose no constraints but require a more sophisticated engine
-
Support for rollbacks (and advanced features for rollforward)
-
Require flow control to provide stability
-
Optimistic approaches support real-time applications better...
|
| 3 |
The most important thing is for applications to develop their models to maximize parallelism
-
The simulation will not execute in parallel faster than the critical path
|
