Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Coterie join operation and tree structured k-coteries
Autore:
Harada, T; Yamashita, M;
Indirizzi:
Hiroshima Univ, Grad Sch Management, Naka Ku, Hiroshima 7300053, Japan Hiroshima Univ Hiroshima Japan 7300053 Naka Ku, Hiroshima 7300053, Japan Kyushu Univ, Dept Comp Sci & Commun Engn, Higashi Ku, Fukuoka 8128581, Japan Kyushu Univ Fukuoka Japan 8128581 gn, Higashi Ku, Fukuoka 8128581, Japan
Titolo Testata:
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS
fascicolo: 9, volume: 12, anno: 2001,
pagine: 865 - 874
SICI:
1045-9219(200109)12:9<865:CJOATS>2.0.ZU;2-O
Fonte:
ISI
Lingua:
ENG
Soggetto:
MUTUAL EXCLUSION; DISTRIBUTED ALGORITHM; QUORUM ALGORITHM; MULTIPLE ENTRIES; CRITICAL SECTION; REPLICATED DATA; SYSTEMS;
Keywords:
availability; distributed systems; k-coteries; k-semicoteries; k-mutual exclusion problem; message complexity; nondominatedness; quorums;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
23
Recensione:
Indirizzi per estratti:
Indirizzo: Harada, T Hiroshima Univ, Grad Sch Management, Naka Ku, 1-1-89 Higashi Senda, Hiroshima 7300053, Japan Hiroshima Univ 1-1-89 Higashi Senda HiroshimaJapan 7300053 pan
Citazione:
T. Harada e M. Yamashita, "Coterie join operation and tree structured k-coteries", IEEE PARALL, 12(9), 2001, pp. 865-874

Abstract

The coterie join operation proposed by Neilsen and Mizuno produces, from ak-coterie and a coterie, a new k-coterie. For the coterie join operation, this paper first shows 1) a necessary and sufficient condition to produce anondominated k-coterie (more accurately, a nondominated k-semicoterie satisfying Nonintersection Property) and 2) a sufficient condition to produce ak-coterie with higher availability. By recursively applying the coterie join operation in such a way that the above conditions hold, we define nondominated k-coteries, called tree structured k-coteries, the availabilities ofwhich are thus expected to be very high. This paper then proposes a new k-mutual exclusion algorithm that effectively uses a tree structured k-coterie, by extending Agrawal and El Abbadi's tree algorithm. The number of messages necessary for k processes obeying the algorithm to simultaneously enterthe critical section is approximately bounded by klog(n/k) in the best case, where n is the number of processes in the system.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 05/04/20 alle ore 03:30:30