SRADS with Local RollbackReport
There is reason to believe bounded aggressive processing (limiting the degree to which processes act on conditional knowledge) may be a good alternative to unbounded processing. Simulations characterized by substantial variance in logical process processing times can lead to conditions where, without bound, some processes may cause frequent repairs (e.g. rollbacks) to occur. We present an algorithm, SRADS/LR, in which we bound aggressiveness and discuss its expected impact on performance.
Note: Abstract extracted from PDF text
All rights reserved (no additional license for public reuse)
Dickens, PM, and Jr Reynolds. "SRADS with Local Rollback." University of Virginia Institute for Parallel Computation Tech Report (1990).
University of Virginia, Institute for Parallel Computation