Coordinator's names Carole DELPORTE-GALLET Hugues ...

More documents

Recommendations

Info

– As pointed out in Task 1, our budget requests a grant for a 1-week visit per year per permanent member for a total cost of 24000 Euros. – It is expected that most of the results will be communicated to top level international conferences in distributed computing. Moreover, as explained at the beginning, it is also vitally important that the members collaborate on the project topic with the other (international) experts on the domain. The resulting cost is roughly estimated to 84000 Euros. It could be considered as rather high, but it should be taken into account that the permanent members of the Bordeaux partner published 84 papers in the major conferences of the domain in the last four years (the same duration as the project). Even without taking into consideration the collaborations with other colleagues, the participation to major workshops without refereed publications, and the missions of the non permanent staff, this could already almost justify the value of 84000 Euros for missions. • Costs justified by internal invoicies None. • Other expenses The budget concerning small material will mostly be used for providing participants with appropriate computers, and to give adequate resources to the PhDs and Post-doc involved in the project. Various expenditures will be made throughout the project duration for a total cost of 15000 Euros. 7 Annexes 7.1 References References [1] Dana Angluin, James Aspnes, Zoë Diamadi, Michael J. Fischer, and René Peralta. Computation in networks of passively mobile finite-state sensors. Distributed Computing, 18(4):235–253, 2006. [2] Franois Bonnet and Michel Raynal. Anonymous asynchronous systems: The case of failure detectors. In DISC 2010, pages 206–220, 2010. [3] Franois Bonnet and Michel Raynal. Consensus in anonymous distributed systems: Is there a weakest failure detector? In AINA 2010, pages 206–213, 2010. [4] Elizabeth Borowsky and Eli Gafni. A simple algorithmically reasoned characterization of wait-free computations (extended abstract). In PODC, pages 189–198, 1997. [5] Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, and Sergio Rajsbaum. The bg distributed simulation algorithm. Distributed Computing, 14(3):127–146, 2001. [6] Anne Broadbent and Alain Tapp. Can quantum mechanics help distributed computing? ACM SIGACT News - Distributed Computing Column, 39(3):67–76, September 2008. [7] Tushar Deepak Chandra, Vassos Hadzilacos, and Sam Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4):685–722, July 1996. [8] Tushar Deepak Chandra and Sam Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2):225–267, March 1996. [9] Richard Cleve and Harry Buhrman. Substituting quantum entanglement for communication. Physical Review A, 56(2):1201–1204, Aug 1997. 24
[10] Carole Delporte-Gallet, Hugues Fauconnier, and Rachid Guerraoui. Tight failure detection bounds on atomic object implementations. J. ACM, 57(4), 2010. [11] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, and Anne-Marie Kermarrec. Brief announcement: byzantine agreement with homonyms. In Friedhelm Meyer auf der Heide and Cynthia A. Phillips, editors, SPAA, pages 74–75. ACM, 2010. [12] Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, and Andreas Tielmann. The disagreement power of an adversary. Distributed Computing, 2010. Accepted in DISC: Special issue. [13] Vasil S. Denchev and Gopal Pandurangan. Distributed quantum computing: A new frontier in distributed systems or science fiction? ACM SIGACT News - Distributed Computing Column, 39(3):77–95, September 2008. [14] David Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London, A400:97–117, 1985. [15] Shlomi Dolev. Self-Stabilization. MIT Press, 2000. [16] Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374–382, April 1985. [17] Pierre Fraigniaud, Cyril Gavoille, David Ilcinkas, and Andrzej Pelc. Distributed computing with advice: Information sensitivity of graph coloring. In 34 th International Colloquium on Automata, Languages and Programming (ICALP), volume 4596 of Lecture Notes in Computer Science, pages 231–242. Springer, July 2007. [18] Pierre Fraigniaud, Amos Korman, and Emmanuelle Lebhar. Local mst computation with short advice. In Phillip B. Gibbons and Christian Scheideler, editors, SPAA, pages 154–160. ACM, 2007. [19] Pierre Fraigniaud, Amos Korman, and David Peleg. Local distributed decision. CoRR, abs/1011.2152, 2010. [20] Pierre Fraigniaud and Andrzej Pelc. Decidability classes for mobile agents computing. CoRR, abs/1011.2719, 2010. [21] Cyril Gavoille, Adrian Kosowski, and Marcin Markiewicz. What can be observed locally? round-based models for quantum distributed computing. Technical report, arXiv: quant-ph/0903.1133, 2009. [22] Maurice P. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):123–149, January 1991. [23] Amos Korman and Shay Kutten. Distributed verification of minimum spanning trees. Distributed Computing, 20(4):253–266, 2007. [24] Amos Korman, Shay Kutten, and David Peleg. Proof labeling schemes. Distributed Computing, 22(4):215–233, 2010. [25] Nathan Linial. Locality in distributed graphs algorithms. SIAM Journal on Computing, 21(1):193–201, 1992. [26] Moni Naor and Larry J. Stockmeyer. What can be computed locally? SIAM J. Comput., 24(6):1259– 1277, 1995. [27] David Peleg. Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000. [28] Seiichiro Tani, Hirotada Kobayashi, and Keiji Matsumoto. Exact quantum algorithms for the leader election problem. In 22 nd Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 3404 of Lecture Notes in Computer Science, pages 581–592. Springer, February 2005. 25
Page 1 and 2: Coordinator’s names Carole DELPOR
Page 3 and 4: 1 Proposal Abstract Distributed com
Page 5 and 6: Although the examples mentioned abo
Page 7 and 8: of computability and complexity and
Page 9 and 10: Hence, the “yes” answer must be
Page 11 and 12: and simulations between systems to
Page 13 and 14: Objectives of the task: Sub-Task 5.
Page 15 and 16: Figure 1: Interaction graph beween
Page 17 and 18: of LIAFA (academics, researchers, a
Page 19 and 20: Partner 2: Rennes Name First name P
Page 21 and 22: 6 Scientific justification of reque
Page 23: - As pointed out in the Task 1, fou
Page 27 and 28: Partner 1: Paris 27
Page 29 and 30: FAUCONNIER Hugues Coordinator Age:5
Page 31 and 32: KORMAN Amos Age: 38 Position: Charg
Page 33 and 34: Partner 2: Rennes 33
Page 35 and 36: MOSTEFAOUI Achour Age: 41 Position:
Page 37 and 38: Partner 3: Bordeaux 37
Page 39 and 40: ILCINKAS David Age: 30 Position: CN
Page 41 and 42: Age: 47 Position: CNRS senior resea
Page 43 and 44: Age: 30 Position: Associate profess
Page 45: Partner 3: Bordeaux Part. Name PM P

Coordinator's names Carole DELPORTE-GALLET Hugues ...

Create successful ePaper yourself

Delete template?

Save as template?