The Library
Contention resolution with bounded delay
Tools
Tools
Tools
Paterson, Michael S. and Srinavasan, Aravind (1995) Contention resolution with bounded delay. University of Warwick. Department of Computer Science. (Department of Computer Science research report). (Unpublished)
|
PDF (Department of Computer Science Research Report)
WRAP_cs-rr-285.pdf - Other - Requires a PDF viewer. Download (1491Kb) | Preview |
Abstract
When many distributed processes contend for a single shared resource that can service at most one process per time slot, the key problem is devising a good distributed protocol for contention resolution. This has been studied in the context of multiple-access channels (e.g. ALOHA, Ethernet), and recently for PRAM emulation and routing in optical computers. Under a stochastic model of continuous request generation from a set of n synchronous processes, Raghavan and Upfal have recently shown a protocol which is stable if the request rate is at most λ0 for some fixed λ0 < 1; their main result is that for any given resource request, its expected delay (expected time to get serviced) is O(log n). Assuming further that the initial clock times of the processes are within a known bound B of each other, we present a stable protocol, again for some fixed positive request rate λ1,0< λ1 < 1, wherein the expected delay for each request is O(1), independent of n. We derive this by showing an analogous result for an infinite number of processes, assuming that all processes agree on the time; this is the first such result. We also present tail bounds which show that for every given resource request, it is unlikely to remain unserviced for much longer than expected, and extend our results to other classes of input distributions.
| Item Type: | Report | ||||
|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
| Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
| Library of Congress Subject Headings (LCSH): | Contention resolution protocols (Computer network protocols) | ||||
| Series Name: | Department of Computer Science research report | ||||
| Publisher: | University of Warwick. Department of Computer Science | ||||
| Official Date: | April 1995 | ||||
| Dates: |
|
||||
| Number: | Number 211 | ||||
| Number of Pages: | 14 | ||||
| DOI: | CS-RR-285 | ||||
| Institution: | University of Warwick | ||||
| Theses Department: | Department of Computer Science | ||||
| Status: | Not Peer Reviewed | ||||
| Publication Status: | Unpublished | ||||
| Reuse Statement (publisher, data, author rights): | M.S. Paterson and A. Srinivasan, “Contention Resolution with Bounded Delay”, <i>Annual Symposium on Foundations of Computer Science</i>, IEEE Computer Society Press, pp. 104-113 (1995) | ||||
| Funder: | European Strategic Programme of Research and Development in Information Technology (ESPRIT) | ||||
| Grant number: | 7141 (ESPRIT) | ||||
| Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
