Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
USING LOCAL-SPIN KAPPA-EXCLUSION ALGORITHMS TO IMPROVE WAIT-FREE OBJECT IMPLEMENTATIONS
Autore:
ANDERSON JH; MOIR M;
Indirizzi:
UNIV N CAROLINA,DEPT COMP SCI CHAPEL HILL NC 27599 UNIV PITTSBURGH,DEPT COMP SCI PITTSBURGH PA 15260
Titolo Testata:
Distributed computing
fascicolo: 1, volume: 11, anno: 1997,
pagine: 1 - 20
SICI:
0178-2770(1997)11:1<1:ULKATI>2.0.ZU;2-3
Fonte:
ISI
Lingua:
ENG
Soggetto:
SYNCHRONIZATION;
Keywords:
KAPPA-ASSIGNMENT; KAPPA-EXCLUSION; LOCAL SPINNING; RESILIENCY; SHARED-MEMORY MULTIPROCESSORS; SHARED SUBJECTS; WAIT-FREE;
Tipo documento:
Article
Natura:
Periodico
Citazioni:
26
Recensione:
Indirizzi per estratti:
Citazione:
J.H. Anderson e M. Moir, "USING LOCAL-SPIN KAPPA-EXCLUSION ALGORITHMS TO IMPROVE WAIT-FREE OBJECT IMPLEMENTATIONS", Distributed computing, 11(1), 1997, pp. 1-20

Abstract

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 starvation-free, and are designed to be fast in the absence of contention, and to exhibit scalable performance as contention rises. Incontrast, all previous starvation-free k-exclusion algorithms requireunrealistic operations or generate excessive interconnect traffic under contention. We also show that efficient, starvation-free k-exclusion algorithms can be used to reduce the time and space overhead associated with existing wait-free shared object implementations, while stillproviding some resilience to delays and failures. The resulting ''hybrid'' object implementations combine the advantages of local-spin spinlocks, which perform well in the absence of process delays (caused, for example, by preemptions), and wait-free algorithms, which effectively tolerate such delays. We present performance results that confirm that this k-exclusion-based technique can improve the performance of existing wait-free shared object implementations. These results also show that lock-based implementations can be susceptible to severe performance degradation under multiprogramming, while our hybrid implementations are not.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 09/07/20 alle ore 20:20:15