ACM Home Page
Please provide us with feedback. Feedback
High-performance sorting on networks of workstations
Full text PdfPdf (1.53 MB)
Source International Conference on Management of Data archive
Proceedings of the 1997 ACM SIGMOD international conference on Management of data table of contents
Tucson, Arizona, United States
Pages: 243 - 254  
Year of Publication: 1997
ISBN:0-89791-911-4
Also published in ...
Authors
Andrea C. Arpaci-Dusseau  Computer Science Division, University of California, Berkeley
Remzi H. Arpaci-Dusseau
David E. Culler  Computer Science Division, University of California, Berkeley
Joseph M. Hellerstein  Computer Science Division, University of California, Berkeley
David A. Patterson  Computer Science Division, University of California, Berkeley
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 79,   Citation Count: 29
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/253260.253322
What is a DOI?

ABSTRACT

We report the performance of NOW-Sort, a collection of sorting implementations on a Network of Workstations (NOW). We find that parallel sorting on a NOW is competitive to sorting on the large-scale SMPs that have traditionally held the performance records. On a 64-node cluster, we sort 6.0 GB in just under one minute, while a 32-node cluster finishes the Datamation benchmark in 2.41 seconds. Our implementations can be applied to a variety of disk, memory, and processor configurations; we highlight salient issues for tuning each component of the system. We evaluate the use of commodity operating systems and hardware for parallel sorting. We find existing OS primitives for memory management and file access adequate. Due to aggregate communication and disk bandwidth requirements, the bottleneck of our system is the workstation I/O bus.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
3
4
5
 
6
 
7
8
9
 
10
 
11
12
 
13
 
14
 
15
 
16
17
18
 
19
D. P. Ghormley, D. Petrou, A. M. Vahdat, and T. E. Anderson. GLUnix: A Global Layer Unix for NOW. http://now.cs.berkeley.edu/Glunix/glunix.html.
 
20
G. Graefe. Volcano: An Extensible and Parallel Dataflow Query Processing System. Technical report, Oregon Graudate Center, June 1989.
 
21
G. Graefe. Parallel External Sorting in Volcano. Technical Report CU-CS-459, Computer Science, University of Colorado at Boulder, June 1990.
22
 
23
C. A. R. Hoare. Quicksort. Computer Journal, 5( 1): 10-15,1962.
 
24
25
26
27
28
 
29
M. Stonebraker. The Case for Shared Nothing. Database Engineering, 9(1 ), 1986.
 
30
A. Sweeney, D. Doucette, W. Hu, C. Anderson, M. Nishimoto, and G. Peck. Scalability in the XFS File System. in Proceedings of the USENIX 1996 Annual Technical Conference, Jan. 1996.
31
 
32
Teradata Corporation. DBC/IO12 Data Base Computer System Manual, release 2.0 edition, Nov. 1985. Document Number c 10- 0001-02.
33
 
34
35
 
36

CITED BY  29

Collaborative Colleagues:
Andrea C. Arpaci-Dusseau: colleagues
Remzi H. Arpaci-Dusseau: colleagues
David E. Culler: colleagues
Joseph M. Hellerstein: colleagues
David A. Patterson: colleagues