Using local-spin k -exclusion algorithms to improve wait-free object implementations

We present the first shared-memory algorithms for k-exclusion in which all process blocking is achieved through the use of 'local-spin' busy waiting. Such algorithms are designed to reduce interconnect traffic, which is important for good performance. Our k-exclusion algorithms are starvat...

Full description

Bibliographic Details

Published in:	Distributed computing Vol. 11; no. 1; pp. 1 - 20
Main Authors:	Anderson, James H., Moir, Mark
Format:	Journal Article
Language:	English
Published:	08.12.1997
ISSN:	0178-2770, 1432-0452
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!