Julian Shun
Guy E. Blelloch
Jeremy T. Fineman
Phillip B. Gibbons
ABSTRACT
No abstract available.
- G. E. Blelloch, P. B. Gibbons, and H. V. Simhadri. Combinable memory-block transactions. In SPAA, 2008. Google Scholar
Digital Library
- G. E. Blelloch, J. T. Fineman, P. B. Gibbons, and J. Shun. Internally deterministic algorithms can be fast. In PPoPP, 2012. Google ScholarDigital Library
- P. Fatourou and N. D. Kallimanis. Revisiting the combining synchronization technique. In PPoPP, 2012. Google ScholarDigital Library
- A. Gottlieb, B. D. Lubachevsky, and L. Rudolph. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Program. Lang. Syst., 5(2), 1983. Google ScholarDigital Library
- J. M. Mellor-Crummey and M. L. Scott. Synchronization without contention. SIGPLAN Not., 26(4), 1991. Google ScholarDigital Library
- L. Rudolph and Z. Segall. Dynamic decentralized cache schemes for MIMD parallel processors. In ISCA, 1984. Google ScholarDigital Library
- N. Shavit and A. Zemach. Combining funnels: a dynamic approach to software combining. J. Parallel Distrib. Comput., 60(11), 2000. Google ScholarDigital Library
- J. Shun, G. E. Blelloch, J. T. Fineman, and P. B. Gibbons. Priority update as a parallel primitive. Technical Report CMU-CS-13-101, 2013.Google Scholar
Index Terms
- Reducing contention through priority updates
Recommendations
The effect of contention in CSMA networks: Model and fairness protocol
Multi-hop wireless networks using Carrier Sense Multiple Access (CSMA) suffer from various forms of unfairness. A majority of the existing work focuses on fairness issues due to hidden terminals and the impact on backoff mechanisms. This paper focuses ...
A backward-compatible multiple-round collision avoidance scheme for contention based medium access control
Random-access mechanisms play an important role in wireless networks, and have been extensively studied in recent years. Although many previous studies have proposed enhanced algorithms, each one has only considered either throughput or fairness. In ...
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
DIALM-POMC '05: Proceedings of the 2005 joint workshop on Foundations of mobile computingWireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for example wireless community networks) may co-exist without central coordination, ...
Comments