Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
Empirical evaluation of mutual exclusion algorithms for distributed systems
Autore:
Fu, SS; Tzeng, NF; Chung, JY;
Indirizzi:
IBM Corp, Thomas J Watson Res Ctr, Inst Adv Commerce, Yorktown Heights, NY10598 USA IBM Corp Yorktown Heights NY USA 10598 rce, Yorktown Heights, NY10598 USA Uni Louisiana Lafayette, Ctr Adv Comp Studies, Lafayette, LA 70504 USA UniLouisiana Lafayette Lafayette LA USA 70504 s, Lafayette, LA 70504 USA
Titolo Testata:
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
fascicolo: 7, volume: 60, anno: 2000,
pagine: 785 - 806
SICI:
0743-7315(200007)60:7<785:EEOMEA>2.0.ZU;2-L
Fonte:
ISI
Lingua:
ENG
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
37
Recensione:
Indirizzi per estratti:
Indirizzo: Fu, SS IBM Corp, Thomas J Watson Res Ctr, Inst Adv Commerce, POB 704, Yorktown Heights, NY 10598 USA IBM Corp POB 704 Yorktown Heights NY USA 10598 eights, NY 10598 USA
Citazione:
S.S. Fu et al., "Empirical evaluation of mutual exclusion algorithms for distributed systems", J PAR DISTR, 60(7), 2000, pp. 785-806

Abstract

Mutual exclusion in distributed memory systems is realized by passing messages among sites to establish a sequence for the waiting sites to enter thecritical section. We have evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system, with their empirical results compared ill terms of such criteria as the number of message exchanges and response time. The results take into account the effects of critical section request rate, critical section duration, and system size. Our results indicate that the Star algorithm (1991, M. L. Neilsen and hi. Mizuno, in "Proc. 11th Int. Conf. Distributed Computing Systems" pp. 354-360) achieves the shortest response time in most cases among all the algorithms on a small to medium-sized system, when sites request the critical section many times before involving any barrier synchronization. This is because (1) it requires the exchange of no more than three messages par criticalsection entry, and (2) contention can quickly be alleviated after several entries into the critical section, if no barrier synchronization is involved in the meantime. On the other hand, if every site enters the critical section only once before encountering a barrier, the improved Ring algorithm 1995, S. S. Fu and N.-F. Tzeng, "Efficient Token-Based Approach to Mutual Exclusion in Distributed Memory Systems," Tech. Rep. TR-95-8-1, CACS, Univ. Southwestern Louisiana, Lafayette) is found to outperform others under a heavy load: but the Star algorithm and the CSL algorithm (1990. Y. I. Chang, M. Singhal. and M. T. Liu, in "Proc. 1990 Int. Conf. Parallel Processing," Vol. III, pp. 295-302 prevail when the request rate becomes light. The best solution to mutual exclusion in distributed memory systems is determined byhow participating sites generate their mutual exclusion requests. (C) 2000Academic Press.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 23/01/20 alle ore 12:12:13