skip to main content
10.1145/1504176.1504222acmconferencesArticle/Chapter ViewAbstractPublication PagesppoppConference Proceedingsconference-collections
poster

Preliminary results on nb-feb, a synchronization primitive for parallel programming

Published:14 February 2009Publication History

ABSTRACT

We introduce a non-blocking full/empty bit primitive, or NB-FEB for short, as a promising synchronization primitive for parallel programming on may-core architectures. We show that the NB-FEB primitive is universal, scalable and feasible. NB-FEB, together with registers, can solve the consensus problem for an arbitrary number of processes (universality). NB-FEB is combinable, namely its memory requests to the same memory location can be combined into only one memory request, which consequently mitigates performance degradation due to synchronization "hot spots" (scalability). Since NB-FEB is a variant of the original full/empty bit that always returns a value instead of waiting for a conditional flag, it is as feasible as the original full/empty bit, which has been implemented in many computer systems (feasibility).

References

  1. Krste Asanovic et al. The landscape of parallel computing research: A view from berkeley. Technical Report No. UCB/EECS-2006-183, University of California, Berkeley, 2006.Google ScholarGoogle Scholar
  2. Guy E. Blelloch, Phillip B. Gibbons, and S. Harsha Vardhan. Combinable memory-block transactions. In Proc. of the ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 23--34, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. David E. Culler, Jaswinder Pal Singh, and Anoop Gupta. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Maurice Herlihy. Wait-free synchronization. ACM Transaction on Programming and Systems, 11(1):124--149, January 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Clyde P. Kruskal, Larry Rudolph, and Marc Snir. Efficient synchronization of multiprocessors with shared memory. ACM Trans. Program. Lang. Syst., 10(4):579--601, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. M. Michael and M. L. Scott. Implementation of atomic primitives on distributed shared memory multiprocessors. In Proc. of the IEEE Symp. on High-Performance Computer Architecture, pages 222--231, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  7. Srinivas Sridharan, Arun Rodrigues, and Peter Kogge. Evaluating synchronization techniques for light-weight multithreaded/multicore architectures. In Proc. of the ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 57--58, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Preliminary results on nb-feb, a synchronization primitive for parallel programming

          Recommendations

          Comments

          Login options

          Check if you have access through your login credentials or your institution to get full access on this article.

          Sign in
          • Article Metrics

            • Downloads (Last 12 months)4
            • Downloads (Last 6 weeks)0

            Other Metrics

          PDF Format

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader
          About Cookies On This Site

          We use cookies to ensure that we give you the best experience on our website.

          Learn more

          Got it!