On the streaming model augmented with a sorting primitive

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 540-549

  Aggarwal, Gagan ^a   Datar, Mayur ^b   Rajagopalan, Sridhar ^c   Ruhl, Matthias ^b  

^a STANFORD UNIVERSITY   (United States)

^b GOOGLE INC   (United States)

^c IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL POWER; DATA SETS; PRIMITIVE SORTING; STREAMING MODEL;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA ACQUISITION; DATA REDUCTION; MATHEMATICAL MODELS; PROBLEM SOLVING; TREES (MATHEMATICS);

SORTING;

EID: 17744380861     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. J. Abello, A. L. Buchsbaum, and J. R. Westbrook. A Functional Approach to External Graph Algorithms. Algorithmica, 32:437-458, 2002.
2. P. Agarwal, S. Krishnan, N. Mustafa, and S. Venkatasubramanian. Streaming Geometric Optimization Using Graphics Hardware. Technical Report TD-5HL2NX, AT&T, 2003.
3. R. C. Agarwal. A Super Scalar Sort Algorithm for RISC Processors. In Proceedings SIGMOD, pages 240-246, 1996.
4. A. Aggarwal and J. S. Vitter. The input/output complexity of sorting and related problems. Communications of the ACM, 31(8):1116-1127, 1988.
5. N. Alon, Y. Matias, and M. Szegedy. The Space Complexity of Approximating the Frequency Moments. Journal of Computer and System Sciences, 58(1): 137-147, 1999.
6. A. C. Arpaci-Dusseau, R. H. Arpaci-Dusseau, D. E. Culler, J. M. Hellerstein, and D. A. Patterson. High-Performance Sorting on Networks of Workstations. In Proceedings SIGMOD, pages 243-254, 1997.
7. Z. Bar-Yossef, T. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. In Proceedings FOCS, 2002.
8. M. A. Bender, R. Cole, E. D. Demaine, and M. Farach-Colton. Scanning and Traversing: Maintaining Data for Traversals in a Memory Hierarchy. In Proceedings ESA, pages 139-151, Sept. 2002.
9. A. Borodin, M. N. Nielsen, and C. Rackoff. (Incremental) Priority Algorithms. Algorithmica, 37(4):295-326, Sept. 2003.
10. I. Buck and P. Hanrahan. Data Parallel Computation on Graphics Hardware. Manuscript, 2003.
11. L. Chavet. FSORT, 2002. Available online at www.fsort.com.
12. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, and J. S. Vitter. External-Memory Graph Algorithms. In Proceedings SODA, pages 139-149, 1995.
13. M. Farach, P. Ferragina, and S. Muthukrishnan. Overcoming the Memory Bottleneck in Suffix Tree Construction. In Proceedings FOCS, pages 174-183, Nov. 1998.
14. M. Farach-Colton, P. Ferragina, and S. Muthukrishnan. On the Sorting-Complexity of Suffix Tree Construction. Journal of the ACM, 47(6):987-1011, 2000.
15. S. Guha, S. Krishnan, K. Mungala, and S. Venkatasubramanian. Application of the Two-Sided Depth Test to CSG Rendering. In Proceedings of SIGGRAPH Symposium on Interactive 3D Graphics, 2003.
16. M. R. Henzinger, P. Raghavan, and S. Rajagopalan. Computing on data streams. In DIMACS series in Discrete Mathematics and Theoretical Computer Science, volume 50, pages 107-118, 1999.
17. G. Humphreys, M. Eldridge, I. Buck, G. Stoll, M. Everett, and P. Hanrahan. WireGL: A Scalable Graphics System for Clusters. In Proceedings of SIGGRAPH, pages 129-140, 2001.
18. G. Humphreys, M. Houston, Y.-R. Ng, R. Frank, S. Ahern, P. Kirchner, and J. T. Klosowski. Chromium: A Stream Processing Framework for Interactive Graphics on Clusters. In Proceedings of SIGGRAPH, pages 693-702, 2002.
19. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. In Proceedings STOC, pages 1-10, 1985.
20. J. I. Munro and M. S. Paterson. Selection and Sorting with Limited Storage. Theoretical Computer Science, 12:315-323, 1980.
21. S. J. Ponzio, J. Radhakrishnan, and S. Venkatesh. The communication complexity of pointer chasing. Journal of Computer and System Sciences (JCSS), 62(2):323-355, 2001.
22. T. J. Purcell, I. Buck, W. R. Mark, and P. Hanrahan. Ray Tracing on Programmable Graphics Hardware. In Proceedings of SIGGRAPH, pages 703-712, 2002.
23. M. Ruhl. Efficient Algorithms for New Computational Models. PhD thesis, Massachusetts Institute of Technology, Sept. 2003.
24. J. S. Vitter. External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys, 33(2):209-271, 2001.
25. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.
26. J. Wyllie. SPsort: How to Sort a Terabyte Quickly. Technical report, IBM Almaden Research Center, 1999. Available online at www.almaden.ibm.com/cs/gpfs- spsort.html.