Skip to main content
SpringerLink
Log in

Improved Deterministic Parallel Padded Sorting

  • Conference paper
  • First Online:
Algorithms — ESA’ 98 (ESA 1998)

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

Included in the following conference series:

  • 966 Accesses

Abstract

Given an input array of n real numbers, sorting with padding λ consists in writing those numbers in order in an array of size (1+λ)n, thus leaving λn entries empty. Only comparisons are allowed between the numbers to be sorted. We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(logk n log*(logk n) + loglogk). This improves a previous algorithm with time bound O(logk n (loglog k)3 · 2C(log* n-log* k)). The best known lower bound is Ω(logk n).

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. P. K. Agarwal. Geometric partitioning and its applications. In J. E. Goodman, R. Pollack, and W. Steiger, Eds., Computational Geometry: Papers from the DIMACS Special Year. Amer. Math. Soc., 1991.

    Google Scholar 

  2. M. Ajtai. Approximate counting with uniform constant depth circuits. In J.-Y. Cai, Ed., Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. 1–20. Amer. Math. Soc., 1993.

    Google Scholar 

  3. N. Alon and Y. Azar. The average complexity of deterministic and randomized parallel comparison sorting algorithms. SIAM. J. Comput., 17 (1988) 1178–1192.

    Article  MATH  MathSciNet  Google Scholar 

  4. N. Alon, L. Babai and A. Itai. A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem. J. Algorithms, 7 (1986) 567–583.

    Article  MATH  MathSciNet  Google Scholar 

  5. N. Alon, O. Goldreich, J. Hastad and R. Peralta. Simple Constructions of Almost k-wise Independent Random Variables. Rand. Struct. and Alg., 3 (1992) 289–304.

    Article  MATH  MathSciNet  Google Scholar 

  6. Y. Azar and U. Vishkin. Tight comparison bounds on the complexity of parallel sorting. SIAM. J. Comput., 16 (1987) 458–464.

    Article  MATH  MathSciNet  Google Scholar 

  7. N.M. Amato, M.T. Goodrich, and E.A. Ramos. Parallel algorithms for higher-dimensional convex hulls. FOCS’94, 683–694.

    Google Scholar 

  8. N. M. Amato, M. T. Goodrich and E. A. Ramos. Computing faces in segment and simplex arrangements. STOC’85, 672–682.

    Google Scholar 

  9. P. Beame and J. Hastad. Optimal bounds for decision problems on the CRCW PRAM. J. ACM, 36 (1989) 643–670.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Bellare and J. Rompel. Randomness-effcient oblivious sampling. FOCS’94, 276–287.

    Google Scholar 

  11. R.B. Boppana. The average-case parallel complexity of sorting. IPL 33 (1989) 145–146.

    Article  MATH  MathSciNet  Google Scholar 

  12. S. Chaudhuri, T. Hagerup and R. Raman. Approximate and exact deterministic parallel selection. Technical Report MPII, MPI-I-93-118, 1993.

    Google Scholar 

  13. B. Chazelle. Cutting hyperplanes for divide-and-conquer. Discrete Comput. Geom., 9 (1993) 145–158.

    Article  MATH  MathSciNet  Google Scholar 

  14. B. Chazelle. An optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom., 10 (1993) 377–409.

    Article  MATH  MathSciNet  Google Scholar 

  15. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica, 10 (1990) 229–249.

    Article  MATH  MathSciNet  Google Scholar 

  16. B. Chazelle and J. Matousek. On linear-time deterministic algorithms for optimization problems in fixed dimension. SODA’93, 281–290.

    Google Scholar 

  17. R. Cole. Parallel merge sort. SIAM J. Comput., 17 (1988) 770–785.

    Article  MATH  MathSciNet  Google Scholar 

  18. R. Cole. An optimally efficient selection algorithm. IPL, 26 (1988) 295–299.

    Article  MATH  MathSciNet  Google Scholar 

  19. M. L. Fredman, J. Komlos and E. Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31 (1984) 538–544.

    Article  MATH  Google Scholar 

  20. T. Goldberg and U. Zwick. Optimal deterministic approximate parallel prefix sums and their applications. In Proc. 4th IEEE Israel Symp. on Theory of Comput. and Sys, 220–228, 1995.

    Google Scholar 

  21. M.T. Goodrich. Geometric partitioning made easier, even in parallel. In Proc. 9th Annu. ACM Sympos. Comput. Geom., 73–82, 1993.

    Google Scholar 

  22. M.T. Goodrich. Fixed-dimensional parallel linear programming via relative ε-approximations. SODA’96, 132–141.

    Google Scholar 

  23. M. T. Goodrich, Y. Matias and U. Vishkin. Approximate parallel prefix computation and its applications. IPPS’93, 318–325.

    Google Scholar 

  24. M. T. Goodrich and E. A. Ramos. Bounded independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming. Discrete Comput. Geom., 18 (1997) 397–420.

    Article  MATH  MathSciNet  Google Scholar 

  25. T. Hagerup and R. Raman. Waste makes haste: tight bounds for loose parallel sorting. FOCS’92, 628–637.

    Google Scholar 

  26. T. Hagerup and R. Raman. Fast deterministic approximate and exact parallel sorting. SPAA’93, 346–355.

    Google Scholar 

  27. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Discrete Comput. Geom., 2 (1987) 127–151.

    Article  MATH  MathSciNet  Google Scholar 

  28. A. Joffe. On a set of almost deterministic k-independent random variables. Annals of Probability, 2 (1974) 161–162.

    Article  MATH  MathSciNet  Google Scholar 

  29. H. Karloff and Y. Mansour. On construction of k-wise independent random variables. STOC’94, 564–573.

    Google Scholar 

  30. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput., 15 (1986) 1036–1053.

    Article  MATH  MathSciNet  Google Scholar 

  31. P. MacKenzie and Q. Stout. Ultrafast expected time parallel algorithms. SODA’91, 414–423.

    Google Scholar 

  32. J. Matousek. Approximations and optimal geometric divide-and-conquer. STOC’91, 505–511.

    Google Scholar 

  33. J. Matousek. Cutting hyperplane arrangements. Discrete Comput. Geom., 6 (1991) 385–406.

    Article  MATH  MathSciNet  Google Scholar 

  34. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.

    MATH  Google Scholar 

  35. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput., 22 (1993) 838–856.

    Article  MATH  MathSciNet  Google Scholar 

  36. S. Rajasekaran and J. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM J. Comput., 18 (1989) 594–607.

    Article  MATH  MathSciNet  Google Scholar 

  37. J. P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SODA’93, 331–340.

    Google Scholar 

  38. V.N. Vapnik and A.Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl., 16 (1971) 264–280.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Max-Planck-Institut für Informatik, Im Stadtwald, 66123, Saarbrücken, Germany

    Ka Wong Chong & Edgar A. Ramos

Authors
  1. Ka Wong Chong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edgar A. Ramos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Elettronica e Informatica, Università di Padova, via Gradenigo 6/A, I-35131, Padova, Italy

    Gianfranco Bilardi  & Geppino Pucci  & 

  2. Department of Electrical Engineering and Computer Science, The University of Illinois at Chicago, 851 South Morgan Street - 1009 SEO, Chicago, IL, 60607-7053, USA

    Gianfranco Bilardi

  3. Dipartimento di Matematica Applicata e Informatica, Università “Cá Foscari” di Venezia, via Torino 155, I-30173, Venezia Mestre, Italy

    Giuseppe F. Italiano

  4. Dipartimento di Matematica Pura e Applicata, Università di Padova, via Belzoni 7, I-35131, Padova, Italy

    Andrea Pietracaprina

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chong, K.W., Ramos, E.A. (1998). Improved Deterministic Parallel Padded Sorting. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds) Algorithms — ESA’ 98. ESA 1998. Lecture Notes in Computer Science, vol 1461. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68530-8_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-68530-8_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64848-2

  • Online ISBN: 978-3-540-68530-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation