Not all fair probabilistic schedulers are equivalent

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5923 LNCS, Issue , 2009, Pages 33-47

  Chatzigiannakis, Ioannis ^a   Dolev, Shlomi ^b   Fekete, Sándor P ^c   Michail, Othon ^a   Spirakis, Paul G ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Communicating automata; Fair scheduler; Fairness; Population protocol; Probabilistic scheduler; Sensor network

Indexed keywords

COMMUNICATING AUTOMATA; INFORMATION CONCERNING; NON-ZERO PROBABILITY; THEORETICAL FRAMEWORK; TRANSITION FUNCTIONS; TRANSITION PROBABILITIES;

NETWORK PROTOCOLS; PROBABILITY; SENSOR NETWORKS; TRANSLATION (LANGUAGES);

SCHEDULING;

EID: 72749095017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10877-8_5     Document Type: Conference Paper

References (17)

1. Angluin, D., Aspnes, J., Chan,M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: Proc. Distributed Computing in Sensor Systems: 1st IEEE International Conference, pp. 63-74 (2005)
2. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 290-299. ACM, New York (2004)
3. Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing 18(4), 235-253 (2006)
4. Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distributed Computing 21(3), 183-199 (2008)
5. Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proc. 25th Annual ACM Symposium on Principles of Distributed Computing, pp. 292-299 (2006)
6. Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 20-32. Springer, Heidelberg (2007)
7. Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the European Association for Theoretical Computer Science 93, 98-117 (2007); Columns: Distributed Computing. Mavronicolas, M. (ed.)
8. Chatzigiannakis, I., Spirakis, P.G.: The dynamics of probabilistic population protocols. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol. 5218, pp. 498-499. Springer, Heidelberg (2008)
9. Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Decidable Graph Languages by Mediated Population Protocols. In: 23nd International Symposium on Distributed Computing (DISC), Elche, Spain (September 2009);
10. Also FRONTS Technical Report FRONTS-TR-2009-16, http://fronts.cti.gr/ aigaion/?TR=80
11. Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Experimental verification and performance study of extremely large sized population protocols. FRONTS Technical Report FRONTS-TR-2009-3 (January 2009), http://fronts.cti.gr/aigaion/?TR=61
12. Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Mediated Population Protocols. In: 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece, pp. 363-374 (2009)
13. Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Recent Advances in Population Protocols. In: 34th International Symposium on Mathematical Foundations of Computer Science (MFCS), Novy Smokovec, High Tatras, Slovakia, August 24-28 (2009)
14. Feller, W.: An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1. Wiley, Chichester (1968)
15. Guerraoui, R., Ruppert, E.: Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures. In: 36th International Colloquium on Automata, Languages and Programming (ICALP), Rhodes, Greece, pp. 484-495 (2009)
16. McCrea, W.H., Whipple, F.J.W.: Random Paths in Two and Three Dimensions. Proc. Roy. Soc. Edinburgh 60, 281-298 (1940)
17. Queille, J.P., Sifakis, J.: Fairness and Related Properties in Transition Systems - A temporal Logic to Deal with Fairness. Acta Informatica 19, 195-220 (1983)