Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 1997: Fundamentals of Computation Theory pp 85–92Cite as

Stochastic analysis of dynamic processes

  • Invited Lectures
  • Conference paper
  • First Online:

  • 89 Accesses

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

Abstract

Research in theoretical computer science has focused in the past mainly on static computation problems. In a static computation the input is known before the start of the computation and the goal is to minimize the number of steps till termination with a correct output. Many important processes in today's computing are dynamic processes, whereby input is continuously injected to the system, and the algorithm (which is not supposed to terminate at all) is measured by its steady state performance. Examples of dynamic processes are communication protocols, memory management tools, and time sharing policies. We review several recent works analyzing dynamic algorithms for balance allocations and packet routing.

Invited paper - FCT 1997.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Y. Azar, A. Z. Broder, and A. R. Karlin. On-line load balancing. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 218–225, 1992.

    Google Scholar 

  2. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 593–602, 1994.

    Google Scholar 

  3. Y. Azar, B. Kalyanasundaram, S. Plotkin, K. Pruhs, and O. Waarts. Online load balancing of temporary tasks. In Workshop on Algorithms and Data Structures (WADS), Montreal, Canada, 1993.

    Google Scholar 

  4. Y. Azar, J. Naor, and R. Rom. The competitiveness of on-line assignments. In Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pages 203–210, 1992.

    Google Scholar 

  5. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan and D. P. Williamson Adversarial queuing theory. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 376–385, 1996.

    Google Scholar 

  6. A. Z. Broder and E. Upfal. Dynamic Deflection Routing in Arrays. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 348–355, 1996.

    Google Scholar 

  7. A. Z. Broder and A. R. Karlin. Multilevel adaptive hashing. In Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pages 43–53, 1990.

    Google Scholar 

  8. A.Z. Broder and E. Upfal. “Dynamic deflection routing on arrays.” Proceedings of the 28th ACM Symp. on Theory of Computing. Philadelphia, 1996, pp. 348–355.

    Google Scholar 

  9. A.Z. Broder, A.M. Frieze, and E. Upfal. “A general approach to dynamic packet routing with bounded buffers.” Proceedings of the 37th IEEE Symp. on Foundations of Computer Science. Burlington, 1996, pp. 390–399.

    Google Scholar 

  10. M. Dietzfelbinger, A. R. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnert, and R. E. Tarjan. Dynamic perfect hashing: Upper and lower bounds. In Proceedings of the 29th IEEE Conference on Foundations of Computer Science, pages 524–531, 1988.

    Google Scholar 

  11. M. L. Fredman, J. Komlós, and E. Szemerédi. Storing a sparse table with O(1) worst case access time. Journal of the ACM, 31:538–544, 1984.

    Article  Google Scholar 

  12. M. Harcol-Balter and P. Black. Queuing analysis of oblivious packet routing networks. Procs. of the 5th Annual ACM-SIAM Symp. on Discrete Algorithms. Pages 583–592, 1994.

    Google Scholar 

  13. M. Harcol-Balter and D. Wolf. Bounding delays in packet-routing networks. Procs. of the 27th Annual ACM Symp. on Theory of Computing, 1995, pp. 248–257.

    Google Scholar 

  14. N. L. Johnson and S. Kotz. Urn Models and Their Application. John Wiley & Sons, 1977.

    Google Scholar 

  15. V. F. Kolchin, B. A. Sevastyanov, and V. P. Chistyakov. Random Allocations. John Wiley & Sons, 1978.

    Google Scholar 

  16. T. G. Kurtz. Strong approximation theorems for density dependent Markov chains. Stochastic Processes and Applications, 6:223–240, 1978.

    Article  Google Scholar 

  17. N. Kahale and T. Leighton. Greedy dynamic routing on arrays. Procs. of the 6th Annual ACM-SIAM Symp. on Discrete Algorithms. Pages 558–566, 1995.

    Google Scholar 

  18. F.P. Kelly. Stochastic models of computer communication systems. J. Royal Statistical Soc. B, Vol. 47, 1985, pp. 379–395.

    Google Scholar 

  19. T. Leighton. Average case analysis of greedy routing algorithms on arrays. Procs. of the Second Annual ACM Symp. on Parallel Algorithms and Architectures. Pages 2–10, 1990.

    Google Scholar 

  20. F. T. Leighton. Introduction to Parallel Algorithms and Architectures. Morgan-Kaufmann, San Mateo, CA 1992.

    Google Scholar 

  21. B. M. Maggs and R. K. Sitaraman. Simple algorithms for routing on butterfly networks with bounded queues. Proc. of the 24th Annual ACM Symp. on Theory of Computing. Pages 150–161, 1992.

    Google Scholar 

  22. R. Metcalfe and D. Boggs. Ethernet: distributed packet switching for local computer networks. Communication of the ACM, Vol. 19, 1976, pp. 395–404.

    Article  Google Scholar 

  23. M. Mitzenmacher. Bounds on the greedy algorithms for array networks.Procs. of the 6th Annual ACM Symp. on Parallel Algorithms and Architectures. Pages 346–353, 1994.

    Google Scholar 

  24. M. Mitzenmacher. Load balancing and density dependent jump Markov processes. Procs. of the 37th IEEE Annual Symp. on Foundations of Computer Science, pages 213–222, October 1996.

    Google Scholar 

  25. A. G. Ranade. How to emulate shared memory. Procs. of the 28th IEEE Annual Symp. on Foundations of Computer Science, pages 185–194, October 1987.

    Google Scholar 

  26. C. Scheideler and B. Voecking Universal continuous routing strategies. Procs. of the 8th Annual ACM Symp. on Parallel Algorithms and Architectures. 1996.

    Google Scholar 

  27. G. D. Stamoulis and J. N. Tsitsiklis. The efficiency of greedy routing in hypercubes and butterflies. Procs. of the 6th Annual ACM Symp. on Parallel Algorithms and Architectures. Pages 346–353, 1994.

    Google Scholar 

  28. E. Upfal. Efficient schemes for parallel communication. Journal of the ACM, 31 (1984):507–517.

    Article  Google Scholar 

  29. P. Wegner. Interactive Foundations of Computing. Theoretical Computer Science. In press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Almaden Research Center, San Jose, California

    Eli Upfal

  2. Department of Applied Mathematics, The Weizmann Institute of Science, Rehovot, Israel

    Eli Upfal

Authors
  1. Eli Upfal
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Upfal, E. (1997). Stochastic analysis of dynamic processes. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036173

Download citation

  • DOI: https://doi.org/10.1007/BFb0036173

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation