CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

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

Phuong Ha ; Philippas Tsigas (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Otto Anshus
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming p. 295-296 . (2009)
[Konferensbidrag, refereegranskat]

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).

Nyckelord: many-core architectures, non-blocking synchronization, full/empty bit, universal primitives, combinability.

Denna post skapades 2010-01-11. Senast ändrad 2017-11-13.
CPL Pubid: 106278