Skip to main content
SpringerLink
Log in

Randomly Distributed Tasks in Bounded Time

  • Conference paper
Innovative Internet Community Systems (IICS 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2877))

Included in the following conference series:

Abstract

Random walk is the standard modeling for a randomly circulating token in a network, in distributed computing. In particular, this attractive technique can be used to achieve a global computation using a subset of computers over a network. In this paper, we present two original methods to automatically compute the processing time through hitting times. We also propose a solution to determine the number of resources necessary to achieve a global computation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldous, D., Fill, J.A.: Reversible Markov Chains and Random Walks on graphs (book draft)

    Google Scholar 

  2. Aleliunas, R., Karp, R., Lipton, R., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science, pp. 218–223 (1979)

    Google Scholar 

  3. Broder, A.Z., Frieze, A.M., Suen, S., Upfal, E.: Optimal construction of edge-disjoint paths in random graphs. In: SODA: ACM-SIAM Symposium on Discrete Algorithms (1994)

    Google Scholar 

  4. Bui, A., Bui, M., Lavault, C.: On the hierarchy of functioning rules in distributed computing. RAIRO operations research 33(1), 15–27 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bui, M., Das, S.K., Datta, A.K., Nguyen, D.T.: Randomized mobile agent based routing in wireless networks. International Journal of Foundations of Computer Science 12(3), 365–384 (2001)

    Article  Google Scholar 

  6. Chandra, A.K., Raghavan, P., Ruzzo, W.L., Smolensky, R., Tiwari, P.: The electrical resistance of a graph captures its commute and cover times. Computational Complexity 6(4) (1997)

    Google Scholar 

  7. Coppersmith, D., Feige, U., Shearer, J.: Random walks on regular and irregular graphs. SIAM Journal on Discrete Mathematics 9(2), 301–308 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  8. Doyle, P.G., Laurie Snell, J.: Random Walks and Electric Networks (2000); first edition 1984 Mathematical Association of America

    Google Scholar 

  9. Duflot, M., Fribourg, L., Picaronny, C.: Randomized finite-state distributed algorithms as markov chains. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 240–254. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Feige, U.: A tight lower bound for the cover time of random walks on graphs. Random structures and algorithms 6(4), 433–438 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Feige, U.: A tight upper bound for the cover time of random walks on graphs. Random structures and algorithms 6(1), 51–54 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  12. Flauzac, O., Krajecki, M., Fugere, J.: Confiit: a middleware for peer to peer computing. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2669, Springer, Heidelberg (2003)

    Google Scholar 

  13. Foster, I., Kesselman, C.: The GRID: Blueprint for a new Computing Infrastructure. ch. 2. Morgan Kauffman, San Francisco (1998)

    Google Scholar 

  14. Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the Grid: Enabling scalable virtual organizations. In: Sakellariou, R., Keane, J.A., Gurd, J.R., Freeman, L. (eds.) Euro-Par 2001. LNCS, vol. 2150, p. 1. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: 9th ACM symposium on Principles of distributed computing, pp. 119–131 (1990)

    Google Scholar 

  16. Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)

    MATH  Google Scholar 

  17. Lovász, L.: Random walks on graphs: A survey. In: Sz̃onyi, T., Miklós, D., Sós, V.T. (eds.) Combinatorics: Paul Erdos is Eighty, vol. 2, pp. 353–398. János Bolyai Mathematical Society (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département de Mathématiques et Informatique, Université de Reims Champagne Ardennes, BP1039, F-51687, Reims cedex, france

    Alain Bui & Devan Sohier

  2. LRIA – EPHE, rue G. Lussac, F-75005, Paris, France

    Marc Bui & Devan Sohier

Authors
  1. Alain Bui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marc Bui
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Devan Sohier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Mathematik, Technische Universität Ilmenau, PF 100565, 98684, Ilmenau, Germany

    Thomas Böhme

  2. Institute of Computer Science, University of Leipzig,  

    Gerhard Heyer

  3. Computer Science Dept., University of Rostock, 18051, Rostock, Germany

    Herwig Unger

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bui, A., Bui, M., Sohier, D. (2003). Randomly Distributed Tasks in Bounded Time. In: Böhme, T., Heyer, G., Unger, H. (eds) Innovative Internet Community Systems. IICS 2003. Lecture Notes in Computer Science, vol 2877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39884-4_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39884-4_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20436-7

  • Online ISBN: 978-3-540-39884-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation