Keeping track of the latest gossip in a distributed system

Distributed Computing

Volumn 10, Issue 3, 1997, Pages 137-148

  Mukund, Madhavan ^a   Sohoni, Milind ^b  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

^b INDIAN INSTITUTE OF TECHNOLOGY BOMBAY   (India)

Author keywords

Asynchronous automata; Bounded time stamps; Distributed algorithms; Synchronous communication

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; FINITE AUTOMATA; PROBLEM SOLVING; SYNCHRONIZATION;

BOUNDED TIME STAMPS; GOSSIP PROBLEM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0031120345     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460050031     Document Type: Article

References (31)

1. Cori R, Metivier Y: Approximations of a trace, asynchronous automata and the ordering of events in a distributed system. Proc ICALP'88. LNCS 317: 147-161 (1988)
2. Cori R, Metivier Y, Ziclonka W: Asynchronous mappings and asynchronous cellular automata. Inf Comput 106: 159-202 (1993)
3. Cori R, Sopena E: Some combinatorial aspects of time-stamp systems. Eur J Comb 14: 95-102 (1993)
4. Diekert V: Combinatorics on traces. LNCS 454 (1990)
5. Dolev D, Shavit N: Bounded concurrent time-stamps arc constructible. Proc 21st ACM STOC, pp 454-466, 1989
6. Dwork C, Waarts O: Simple and efficient bounded concurrent timestamping or bounded concurrent time-stamps arc comprehensible. Proc 24th ACM STOC, pp 655-666, 1992
7. Gastin P, Petit A: Asynchronous cellular automata for infinite traces. Proc ICALP'92. LNCS 623: 583-594 (1992)
8. Gawlick R, Lynch N, Shavit N: Concurrent time stamping made simple. Proc ISTCS'92. LNCS 601: 171-183 (1992)
9. Hedetniemi SM, Hedetniemi ST, Liestman AL: A survey of gossiping and broadcasting in communication networks. Networks 18: 319-349 (1988)
10. Halpern J, Moses Y: Knowledge and common knowledge in a distributed environment. J Assoc Comput Mach 37: 549-578 (1990)
11. Hoare CAR: Communicating sequential processes. PrenticeHall, London 1984
12. Israeli A, Li M: Bounded time-stamps. Proc 28th IEEE FOCS, pp 371-382, 1987
13. Klarlund N, Mukund M, Sohoni M: Determinizing asynchronous automata. Proc ICALP 1994. LNCS 820: 130-141 (1994)
14. Klarlund N, Mukund M, Sohoni M: Determinizing Büchi asynchronous automata. Proc FST&TCS 1995. LNCS 1026: 456-470 (1995)
15. Krishnan R, Venkatesh S: Optimizing the gossip automaton. Report TCS-94-3, School of Mathematics, SPIC Science Foundation, Madras, India 1994
16. Lamport L, Lynch N: Distributed computing: models and methods. In: van Leeuwen (ed) Handbook of theoretical computer science, vol B. North-Holland, Amsterdam 1990, pp 1157-1200
17. Li M, Vitanyi P: How to share concurrent asynchronous wait free variables. Proc ICALP'89. LNCS 372: 488-507 (1989)
18. Lodaya K, Parikh R, Ramanujam R, Thiagarajan PS: A logical study of distributed transition systems. Inf Comput 119: 91-118 (1995)
19. Mazurkiewicz A: Basic notions of trace theory. In: de Bakker JW, de Roever W-P, Rozenberg G (eds) Linear time, branching time and partial order in logics and models for concurrency. LNCS 354: 285-363 (1989)
20. Milner R: Communication and concurrency. Prentice-Hall, London 1989
21. Mukund M, Narayan Kumar K, Sohoni M: Keeping track of the latest gossip in message-passing systems. Proc Structures in Concurrency Theory (STRICT), Berlin 1995. Workshops in Computing Series, Springer, Berlin Heidelberg New York, 1995, pp 249-263
22. Mukund M, Sohoni M: Keeping track of the latest gossip: bounded time-stamps suffice. Proc FST&TCS'93. LNCS 761: 388-399 (1993)
23. Mukund M, Sohoni M: Gossiping, asynchronous automata and Zielonka's theorem. Report TCS-94-2, School of Mathematics, SPIC Science Foundation, Madras, India 1994
24. Muscholi A: On the complementation of Büchi asynchronous cellular automata. Proc ICALP 1994. LNCS 820: 142-153 (1994)
25. Parikh R, Ramanujam R: Distributed processes and the logic of knowledge. Proc Logics of programs '85. LNCS 193: 256-268 (1985)
26. Safra S: On the complexity of ω-automata. Proc 29th IEEE FOCS, pp 319-327, 1988
27. Thiagarajan PS: TrPTL: a trace based extension of linear time temporal logic. Proc 9th IEEE LICS, pp 438-447, 1994
28. Thomas W: Automata on infinite objects. In: van Leeuwen J (ed) Handbook of theoretical computer science, vol B. North-Holland, Amsterdam 1990, pp 133-191
29. Vardi M, Wolper P: An automata theoretic approach to automatic program verification. Proc 1st IEEE LICS, pp 332-345, 1986
30. Zielonka W: Notes on finite asynchronous automata. R.A.I.R.O. - Inf Théor Appl 21: 99-135 (1987)
31. Zielonka W: Safe executions of recognizable trace languages. Proc Logical Foundations of Computer Science. LNCS 363: 278-289 (1989)