ACM Home Page
Please provide us with feedback. Feedback
Sorting and merging on the DAP
Full text PdfPdf (395 KB)
Source ACM Southeast Regional Conference archive
Proceedings of the 30th annual Southeast regional conference table of contents
Raleigh, North Carolina
SESSION: Session 3C: Algorithms for parallel machines table of contents
Pages: 93 - 99  
Year of Publication: 1992
ISBN:0-89791-506-2
Authors
D. Bhagavathi  Old Dominion University, Norfolk, Va.
W. M. Denny  Old Dominion University, Norfolk, Va.
C. Grosch  Old Dominion University, Norfolk, Va.
P. J. Looges  Old Dominion University, Norfolk, Va.
S. Olariu  Old Dominion University, Norfolk, Va.
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Citation Count: 0
Additional Information:

abstract   references   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/503720.503754
What is a DOI?

ABSTRACT

The sorting problem is of fundamental importance in non-numerical algorithms. Many applications require the ordering of data based the relationship of some set of keys with in the data. Merging is a natural companion of sorting, and is known to yield a very efficient sorting algorithm in sequential processing. Numerous sorting and merging techniques have been developed for many actual and theoretical models, we examine a number of these techniques for implementation on the Distributed Array of Processors, DAP.


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
Active Memory Technology, Irvine CA. DAP Series: FORTRAN-PLUS Language, 1988.
 
2
 
3
 
4
 
5
K.E. Batcher, Sorting Networks and their Applications, Proc. AFIPS 1968, Spring Joint Comp. Conf., 307-314.
 
6
 
7
 
8
 
9
R. Lin, S. Olariu, J.L. Schwing and J. Zhang, Sorting in 0(1) time on an nxn reconfigurable mesh, submitted, 1991.
 
10
B.C. Merifield, J.B.G. Roberts, P. Simpson, and A. Stanley. Real time applications of DAP, Third Int'l Conf Supercomputing, 1988.
 
11
D. Parkinson, DJ. Hunt, and K.S. MacQueen, The AMT DAP 500, Thirty Third IEEE Comp. Soc. Int'l Conf, 196-199, 1988.
 
12
 
13
J. Pecht and I. Ramm, Recognition of handwritten characters using the DAP, IC L Technical Journal, 199-217, Nov. 1982
 
14

Collaborative Colleagues:
D. Bhagavathi: colleagues
W. M. Denny: colleagues
C. Grosch: colleagues
P. J. Looges: colleagues
S. Olariu: colleagues