Bounds on contention management algorithms
نویسندگان
چکیده
منابع مشابه
Bounds on Contention Management Algorithms
We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds. Our randomized algorithm is efficient: in some notorious problem instances (e.g., dining philosophers) it is exponentially faster than prior work from a worst case perspective. Both algorithms are (i) local and (ii) starvation-f...
متن کاملBounds On Contention Management Algorithms1
We present two new algorithms for contention management in transactional memory, the deterministic algorithm CommitRounds and the randomized algorithm RandomizedRounds. Our randomized algorithm is efficient: in some notorious problem instances (e.g., dining philosophers) it is exponentially faster than prior work from a worst case perspective. Both algorithms are (i) local and (ii) starvation-f...
متن کاملBounds on Contention Management in Radio Networks
The local broadcast problem assumes that processes in a wireless network are provided messages, one by one, that must be delivered to their neighbors. In this paper, we prove tight bounds for this problem in two well-studied wireless network models: the classical model, in which links are reliable and collisions consistent, and the more recent dual graph model, which introduces unreliable edges...
متن کاملEfficient Low-Contention Parallel Algorithms
The queue-read queue-write asyn-chronous PRAM model. Parallel algorithms for shared-memory machines. The design and analysis of a new hybrid sorting algorithm. A new universal class of hash functions and dynamic hashing in real time. NYU Ultracomputer { designing an MIMD shared memory parallel computer. In this paper we have presented highly parallel work-optimal algorithms for several fundamen...
متن کاملAnalysis of contention tree algorithms
The Capetanakis–Tsybakov–Mikhailov contention tree algorithm provides an efficient scheme for multiaccessing a broadcast-communication channel. This paper studies statistical properties of multiple-access contention tree algorithms with ternary feedback for arbitrary degree of node. The particular quantities under investigation are the number of levels required for a random contender to have su...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.10.010