Item Details

Print View

SRADS With Local Rollback

Dickens, PM; Reynolds, Jr
Format
Report
Author
Dickens, PM
Reynolds, Jr
Abstract
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
Language
English
Date Received
2012-10-30
Published
University of Virginia, Institute for Parallel Computation, 1990
Published Date
1990
Rights
All rights reserved (no additional license for public reuse)
Collection
Libra Open Repository

Availability

Access Online