Efficient token-based control in rings

In this paper we deal with the efficiency of token-based strategies for the basic problem of controlling the allocation of a shared resource in a ring of n processing entities. We propose new protocols that allow a bounded number of exchanged messages per access request to the resource, while this a...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Feuerstein, E.
Otros Autores: Leonardi, S., Marchetti-Spaccamela, A., Santoro, N.
Formato: Capítulo de libro
Lenguaje:Inglés
Publicado: 1998
Acceso en línea:Registro en Scopus
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 05823caa a22006377a 4500
001 PAPER-2939
003 AR-BaUEN
005 20230518203224.0
008 190411s1998 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-0042764700 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
030 |a IFPLA 
100 1 |a Feuerstein, E. 
245 1 0 |a Efficient token-based control in rings 
260 |c 1998 
270 1 0 |m Leonardi, S.; Dipto. di Informatica e Sistemistica, Univ. di Roma La Sapienza, Roma, Italy; email: leon@dis.uniromal.it 
506 |2 openaire  |e Política editorial 
504 |a Andrews, D., Schulz, G., A token-ring architecture for local area networks: An update (1982) Proc. IEEE COMPCON, , Fall 
504 |a ANSI/IEEE Standards 802.2-1985, , 802.3-1985, 802.4-1985, 802.5-1985 
504 |a Bertsekas, D., Gallager, R., (1992) Data Networks, 2nd Ed., , Prentice-Hall 
504 |a Burns, J.E., Pachl, J., Uniform self-stabilizing rings (1989) ACM Trans. Programming Languages and Systems, 11 (2), pp. 330-344 
504 |a Bux, W., Performance issues in local area networks (1984) IBM J., 23 (4) 
504 |a Dijkstra, E.W., Self-stabilizing systems in spite of distributed control (1974) Comm. ACM, 17 (11), pp. 643-644 
504 |a Halsall, F., Data communications (1992) Computer Networks and Open Systems, 3rd Ed., , Addison-Wesley 
504 |a Israeli, A., Jalfon, M., Token management schemes and random walks yield self-stabilizing mutual exclusion (1990) Proc. 9th ACM Symposium on Principles of Distributed Computing, pp. 119-129 
504 |a Kakugawa, H., Yamashita, M., Uniform randomized self-stabilizing mutual exclusion on unidirectional ring under unfair c-deamon (1995) Proc. 2nd Workshop on Self-Stabilizing Systems, pp. 141-1413 
504 |a Lann, G.L., Distributed systems - Towards a formal approach (1977) Inform. Processing, 77, pp. 155-160. , B. Gilchrist (ed.), North-Holland 
504 |a Misra, J., Detecting termination of distributed computations using markers (1983) Proc. 2nd ACM Symposium on Principles of Distributed Computing, pp. 290-294 
504 |a Rego, V., Ni, L.M., Analytic models of cyclic service systems and their application to token-passing local networks (1988) IEEE Trans. Computers, C-37 (10), pp. 1224-1234 
504 |a Raynal, M., (1988) Distributed Algorithms and Protocols, , John Wiley & Sons 
504 |a Ross, F.E., FDDI - A tutorial (1986) IEEE Commun. Mag., 24, pp. 10-17 
504 |a Singhal, M., A taxonomy of distributed mutual exclusion (1993) J. Parallel Distrib. Comput., 18, pp. 94-101 
504 |a Suzuki, I., Kasami, T., A distributed mutual exclusion algorithm (1985) ACM Trans. Comput. Syst., 3-4, pp. 344-349 
504 |a Tarjan, R.E., Amortized computational complexity (1985) SIAM J. Alg. Discrete Meth., 6 (2), pp. 306-318 
520 3 |a In this paper we deal with the efficiency of token-based strategies for the basic problem of controlling the allocation of a shared resource in a ring of n processing entities. We propose new protocols that allow a bounded number of exchanged messages per access request to the resource, while this amount is unbounded for classical solutions. We also guarantee all the requests to be served within a maximum delay. The new proposed protocols are request-message-based strategies, in that a process entity sends a message to "inform" the token of the access request. © 1998 Elsevier Science B.V. All rights reserved.  |l eng 
536 |a Detalles de la financiación: Universidad de Buenos Aires 
536 |a Detalles de la financiación: 20244 
536 |a Detalles de la financiación: Ministry of Scientific Research, Egypt, MSR 
536 |a Detalles de la financiación: Emory Eye Center 
536 |a Detalles de la financiación: Natural Sciences and Engineering Research Council of Canada, A2415 
536 |a Detalles de la financiación: * A short abstract of this paper appears in the Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Cvm-puting, 1996. The work is partially supported by EU ESPRIT Long Term Research Project ALCOM-IT under contract no. 20244, and by Italian Ministry of Scientific Research Project 40% “Algoritmi, Modelli di Calcolo e Strutture Informative”, EEC project KIT-DYNDATA, by Natural Science and Engineering Research Council Research Grant A2415 and by University of Buenos Aires’ program “Programa Investigadores Jbvenes”. * Corresponding author. Email: leon@dis.uniromal.it. 1E mail: efeuerst@dc.uba.ar. 2 Email: albcrto@dis.uniromal.it. 3 Email: santoro@scs.carleton.ca. 
593 |a Departamento de Computación, FCEyN, Universidad de General Sarmiento, Buenos Aires, Argentina 
593 |a Dipto. di Informatica e Sistemistica, Univ. di Roma La Sapienza, Roma, Italy 
593 |a School of Computer Science, Carleton University, Ottawa, Ont. K1S 5B6, Canada 
690 1 0 |a AMORTIZED ANALYSIS 
690 1 0 |a DISTRIBUTED COMPUTING 
700 1 |a Leonardi, S. 
700 1 |a Marchetti-Spaccamela, A. 
700 1 |a Santoro, N. 
773 0 |d 1998  |g v. 66  |h pp. 175-180  |k n. 4  |p Inf. Process. Lett.  |x 00200190  |w (AR-BaUEN)CENRE-1599  |t Information Processing Letters 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-0042764700&partnerID=40&md5=4369387b482fa37209ff593a66816a08  |y Registro en Scopus 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_00200190_v66_n4_p175_Feuerstein  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_00200190_v66_n4_p175_Feuerstein  |y Registro en la Biblioteca Digital 
961 |a paper_00200190_v66_n4_p175_Feuerstein  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
999 |c 63892