[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

I/O-Space Trade-Offs

Extended Abstract

  • Conference paper
  • First Online:
Algorithm Theory - SWAT 2000 (SWAT 2000)

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

Included in the following conference series:

  • 1067 Accesses

Abstract

We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory model time-space tradeoffs. Using this technique we show strong I/O-space product lower bounds for Sorting and Element Distinctness. We also develop new space efficient external memory Sorting algorithms.

Supported in part by National Science Foundation ESS grant EIA-9870734, RI grant EIA-997287, and CAREER grant EIA-9984099. E-mail: large@cs.duke.edu.

Partially supported by the IST Programme of the EU under contract number IST-1999-14186 (ALCOM-FT). Parts of this work was done while the author was visiting Duke University and while visiting University of Toronto. E-mail: pagter@brics. dk.

Basic Research in Computer Science. Centre of the Danish National Research Foundation.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 71.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 89.99
Price includes VAT (United Kingdom)
  • 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. M. Adler. New coding techniques for improved bandwidth utilization. In Proc. 37th Annual Symposium on Foundations of Computer Science, pages 173–182, 1996.

    Google Scholar 

  2. A. Aggarwal and J. S. Vitter. The Input/Output Complexity of Sorting and Related Problems. Communications of the ACM, 31(9):1116–1127, 1988.

    Article  MathSciNet  Google Scholar 

  3. M. Ajtai. Determinism versus Non-Determinism for Linear Time RAMs with Memory Restrictions. In Proc. Thirty-First ACM Symposium on Theory of Computing, 1999.

    Google Scholar 

  4. L. Arge. The Buffer Tree: A New Technique for Optimal I/O-Algorithms. In Proc. Workshop on Algorithms and Data Structures, LNCS 955, pages 334–345, 1995. A complete version appears as BRICS technical report RS-96-28, University of Aarhus.

    Google Scholar 

  5. L. Arge. Efficient External-Memory Data Structures and Applications. PhD thesis, University of Aarhus, 1996.

    Google Scholar 

  6. L. Arge, M. Knudsen, and K. Larsen. A General Lower Bound on the I/O-Complexity of Comparison-based Algorithms. In Proc. of the Workshop on Algorithms and Datastructures, LNCS 709, pages 83–94, 1993.

    Google Scholar 

  7. L. Arge and P. B. Miltersen. On showing lower bounds for external-memory computational geometry problems. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualization. AMS Press, 1999.

    Google Scholar 

  8. L. Arge and J. Pagter. I/O-Space Trade-Offs. Technical Report BRICS-RS-00-7, BRICS, University of Aarhus, Denmark, April 2000. Available via http://www.brics.dk.

    Google Scholar 

  9. P. Beame. A General Sequential Time-Space Tradeoff for Finding Unique Elements. SIAM Journal on Computing, 20:270–277, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Borodin and S. Cook. A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation. SIAM Journal on Computing, 11(2):287–297, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  11. A. Borodin, F. E. Fich, F. Meyer auf der Heide, E. Upfal, and A. Wigderson. A Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 16:97–99, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  12. A. Borodin, M. J. Fischer, D. G. Kirkpatrick, N. A. Lynch, and M. Tompa. A Time-Space Tradeoff for Sorting on Non-Oblivious Machines. Journal of Computer and System Sciences, 22:351–364, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  13. G. N. Frederickson. Upper Bounds for Time-Space Trade-offs in Sorting and Selection. Journal of Computer and Systems Sciences, 34:19–26, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  14. J. W. Hong and H. T. Kung. I/O complexity: The red-blue pebble game. In Proc. ACM Symp. on Theory of Computation, pages 326–333, 1981.

    Google Scholar 

  15. M. Karchmer. Two Time-Space Tradeoffs for Element Distinctness. Theoretical Computer Science, 47:237–246, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  16. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 2nd edition, 1998.

    Google Scholar 

  17. Y. Mansour, N. Nisan, and P. Tiwari. The Computational Complexity of Universal Hashing. Theoretical Computer Science, (107):121–133, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  18. K. Munagala and A. Ranade. I/O-complexity of graph algorithm. In Proc. Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 687–694, 1999.

    Google Scholar 

  19. J. I. Munro and M. S. Paterson. Selection and Sorting with Limited Storage. Theoretical Computer Science, 12:315–323, 1980.

    Article  MATH  MathSciNet  Google Scholar 

  20. J. Pagter and T. Rauhe. Optimal Time-Space Trade-Offs for Sorting. In proc. 39th Annual Symposium on Foundations of Computer Science, pages 264–268, 1998.

    Google Scholar 

  21. J. E. Savage. Models of Computation. Addison-Wesley, 1998.

    Google Scholar 

  22. M. Tompa. Time-Space Tradeoffs for Straight-Line and Branching Programs. Technical Report 122/78, Department of Computer Science, University of Toronto, July 1978. Ph.D. Thesis.

    Google Scholar 

  23. J. S. Vitter. External memory algorithms and data structures. In J. Abello and J. S. Vitter, editors, External Memory Algorithms and Visualization. AMS Press, 1999.

    Google Scholar 

  24. A. C.-C. Yao. Near-optimal Time-Space Tradeoff for Element Distinctness. SIAM Journal on Computing, 23:966–975, 1994.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Duke University, Durham, NC 27708, USA

    Lars Arge

  2. Basic Research in Computer Science. Centre of the Danish National Research Foundation, University of Aarhus, DK-8000, Aarhus C, Denmark

    Jakob Pagter

Authors
  1. Lars Arge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jakob Pagter
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arge, L., Pagter, J. (2000). I/O-Space Trade-Offs. In: Algorithm Theory - SWAT 2000. SWAT 2000. Lecture Notes in Computer Science, vol 1851. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44985-X_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-44985-X_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67690-4

  • Online ISBN: 978-3-540-44985-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation