Loading...
Please wait, while we are loading the content...
Similar Documents
Elimination trees and the construction of pools and stacks (1995).
| Content Provider | CiteSeerX |
|---|---|
| Author | Shavit, Nir Touitou, Dan |
| Abstract | Shared pools and stacks are two coordination structures with a history of applications ranging from simple producer /consumer buffers to job-schedulers and procedure stacks. This paper introduces elimination trees, a novel form of diffracting trees that offer pool and stack implementations with superior response (on average constant) under high loads, while guaranteeing logarithmic time "deterministic " termination under sparse request patterns. 1 Introduction As multiprocessing breaks away from its traditional number crunching role, we are likely to see a growing need for highly distributed and parallel coordination structures. A real-time application such as a system of sensors and actuators will require fast response under both sparse and intense activity levels (typical examples could be a radar tracking system or a traffic flow controller). Shared pools and stacks are two structures that offer a potential solution to such coordination problems, with a history of applications rang... |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Elimination Tree Fast Response Traditional Number Procedure Stack Simple Producer Consumer Buffer Parallel Coordination Structure Coordination Problem Typical Example Logarithmic Time Deterministic Termination High Load Potential Solution Real-time Application Coordination Structure Intense Activity Level Stack Implementation Superior Response Traffic Flow Controller Novel Form Sparse Request Pattern |
| Content Type | Text |
| Resource Type | Article |
