Skip to main content
SpringerLink
Log in

Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract)

  • Conference paper
  • First Online:
Algorithms and Data Structures (WADS 1993)

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

Included in the following conference series:

Abstract

We explore a family of combinatorial “pebble” games associated with eliminating amortization from data structures in general, continuing a line of research initiated in [10, 21, 8]. These results are used to eliminate amortization from the general schemes of [13] for making linked data structures partially and fully persistent on a pointer machine, the monotonie list labeling problem [5, 28, 10] and the fully persistent disjoint set union-find problem [19].

An important motivation for eliminating amortization is that using amortized data structures in a parallel environment may severely degrade performance [12]. We demonstrate interesting aspects of this issue by introducing the problem of parallel persistence. The best solutions to this problem are obtained by replacing an amortized data structure by one of our new randomized ones and using fast load-balancing schemes.

Paul Dietz acknowledges support from NSF grant CCR-8909667. Rajeev Raman did most of this research at the University of Rochester.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, M. Fredman, and J. Komlós. Hash functions for priority queues. I & C, 63 (1984), pp. 217–225.

    Google Scholar 

  2. H. Baker. List processing in real time on a serial computer. CACM, 21 (1978), pp. 280–294.

    Google Scholar 

  3. N. Blum. On the single-operation worst-case time complexity of the disjoint set union problem. SICOMP, 15 (1986), pp. 1021–1024.

    Google Scholar 

  4. A. Buchsbaum. Personal communication.

    Google Scholar 

  5. P. F. Dietz. Maintaining order in a linked list. In Proc. 14th STOC (1982), pp. 122–127.

    Google Scholar 

  6. P. F. Dietz. Fully persistent arrays. In Proc. WADS 89 (1989), LNCS 382, pp. 67–74.

    Google Scholar 

  7. P. F. Dietz. Monotonie list labeling with good worst case performance. manuscript, February 1991.

    Google Scholar 

  8. P. F. Dietz and R. Raman. Persistence, amortization and randomization. In Proc. 2nd SODA (1991), pp. 77–87. Revised version, Univ. of Rochester CS TR 353, 1991.

    Google Scholar 

  9. P. F. Dietz and R. Raman. On some combinatorial games and their applications. Univ. of Rochester CS TR 392, 1991.

    Google Scholar 

  10. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proc. 19th STOC (1987), pp. 365–372.

    Google Scholar 

  11. M. Dietzfelbinger, A. Karlin, K. Mehlhorn, F. Meyer auf der Heide, H. Rohnhert and R. E. Tarjan. Dynamic perfect hashing: upper and lower bounds. In Proc. 29th FOCS (1988), pp. 524–531.

    Google Scholar 

  12. J. R. Driscoll, H. N. Gabow, R. Shrairman and R. E. Tarjan. Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation. CACM 31 (1988), pp. 1343–1354.

    Google Scholar 

  13. J. R. Driscoll, N. Sarnak, D. D. Sleator and R. E. Tarjan. Making data structures persistent. JCSS, 38 (1989), pp. 86–124.

    Google Scholar 

  14. M. Fischer, A. Meyer and A. Rosenberg. Real-time simulation of multihead tape units. JACM, 19 (1972), pp. 590–607.

    Google Scholar 

  15. Z. Galil. String matching in real time. JACM, 28 (1981), 134–149.

    Google Scholar 

  16. J. Gil, Y. Matias and U. Vishkin. Towards a theory of nearly constant-time parallel algorithms. In Proc. 32nd, FOCS (1991), pp. 698–710.

    Google Scholar 

  17. M. T. Goodrich and S. R. Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. In Proc. 30th FOCS (1989), pp. 190–196.

    Google Scholar 

  18. T. Hagerup. Fast parallel space allocation, estimation and integer sorting. TR MPI-I-91-106, MPI für Informatik, 1991. Preliminary version in Proc. 23rd STOC, 1991.

    Google Scholar 

  19. G. F. Italiano and N. Sarnak. Fully persistent data structures for disjoint set union problems. Proc. WADS '91 (1991), LNCS 519, pp. 449–460.

    Google Scholar 

  20. B. Leong and J. I. Seiferas. New real-time simulations of multihead tape units. JACM, 28 (1981), pp. 166–180.

    Google Scholar 

  21. C. Levcopolous and M. H. Overmars. A balanced search tree with O(1) worst-case update time. Acta Inf., 26, (1988), pp. 269–278.

    Google Scholar 

  22. K. Mehlhorn and S. Näher. Dynamic fractional cascading. Algorithmica, 5 (1990), pp. 215–241.

    Google Scholar 

  23. M. H. Overmars. The design of dynamic data structures, LNCS 156, Springer-Verlag, Berlin, 1983.

    Google Scholar 

  24. P. Raghavan. Lecture notes in randomized algorithms. TR RC 15340, IBM, 1989.

    Google Scholar 

  25. R. Raman. Eliminating amortization: on data structures with guaranteed response time. PhD thesis, U. of Rochester, 1991.

    Google Scholar 

  26. N. Sarnak. Persistent data structures. PhD thesis, New York Univ., 1986.

    Google Scholar 

  27. S. Sen. Fractional cascading revisited. In Proc. SWAT '92 (1992), LNCS 621, pp. 212–220.

    Google Scholar 

  28. A. K. Tsakalidis. Maintaining order in a generalized linked list. Acta Inf., 21 (1984), pp. 101–112.

    Google Scholar 

  29. P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. IPL, 6 (1977), pp. 80–82.

    Google Scholar 

  30. P. Wadler. Analysis of an algorithm for real-time garbage collection. CACM, 19 (1976), pp. 491–500.

    Google Scholar 

  31. D. E. Willard and G. S. Lueker. Adding range restriction capability to dynamic data structures. JACM, 32 (1985), pp. 597–617.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Rochester, 14627, Rochester, NY

    Paul F. Dietz

  2. UMIACS, University of Maryland, 20742, College Park, MD

    Rajeev Raman

Authors
  1. Paul F. Dietz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rajeev Raman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Jörg-Rüdiger Sack Nicola Santoro Sue Whitesides

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dietz, P.F., Raman, R. (1993). Persistence, randomization and parallelization: On some combinatorial games and their applications (abstract). In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_256

Download citation

  • DOI: https://doi.org/10.1007/3-540-57155-8_256

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57155-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation