David R. Helman, Joseph JaJa, David A. Bader  Home/Search
Context Related
Links: ACM DBLP | unm.edu/papers/3670.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: unm.edu/papers/3670 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead. Moreover, unlike previous variations, our algorithm efficiently handles the presence of duplicate values without the overhead of tagging each element with a unique identifier. This algorithm was implemented in Split-C and run on a variety ... (Update)
Context of citations to this paper: More
...using these models is tedious and seldom yields algorithms that are efficient on other machine configurations. Our previous work [4, 5, 6, 8, 13, 14] has successfully augmented such models with a rich set of collective communication primitives that can be implemented...
Cited by: More
Practical Parallel Algorithms for Some Tree and - Graph Problems In (1999) (Correct)
The Design and Analysis of Bulk-Synchronous Parallel Algorithms - Tiskin (1998) (Correct)
Algorithm Engineering for Parallel Computation - Bader, Moret, Sanders (2002) (Correct)
Similar documents (at the sentence level): More
71.4%: A New Deterministic Parallel Sorting Algorithm With an.. - Helman, JaJa, Bader (1996) (Correct)
55.5%: A New Deterministic Parallel Sorting Algorithm With an.. - Helman, JaJa, Bader (1997) (Correct)
34.1%: A Randomized Parallel Sorting Algorithm With an.. - Helman, Bader.. (1996) (Correct)
Active bibliography (related documents): More All
0.1: Practical Parallel Algorithms for Dynamic Data Redistribution.. - Bader, JaJa (1995) (Correct)
0.1: BSP Sorting: An experimental Study - Gerbessiotis, Siniolakis (2000) (Correct)
0.1: Non-Blocking Synchronization: Algorithms and Performance Evaluation - Zhang (2003) (Correct)
Related documents from co-citation: More All
9: A bridging model for parallel computation (context) - Valiant - 1990
7: LogP: Towards a realistic model of parallel computation - Culler, Karp et al. - 1993
6: Parallel Sorting by Regular Sampling - Shi, Schaeffer - 1992
BibTeX entry: (Update)
D.R. Helman, J. Ja'Ja', and D.A. Bader. A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation. Tech. Rep. CS-TR-3670 and UMIACS-TR-96-54. Institute for Advanced Computer Studies (UMIACS) and the Department of Electrical Engineering, University of Maryland, College Park, August 1996. http://citeseer.ist.psu.edu/helman96new.html More
@techreport{ david96new,
author = "Helman, David R. and Ja'Ja',Joseph and Bader, David A.",
title = "{A} {N}ew {D}eterministic {P}arallel {S}orting {A}lgorithm {W}ith an {E}xperimental {E}valuation",
number = "CS-TR-3670 and UMIACS-TR-96-54",
month = "August",
address = "College Park, MD",
year = "1996",
url = "citeseer.ist.psu.edu/helman96new.html" }
Citations (may not include all citations):912 MPI: A Message-Passing Interface Standard - Interface - 1995 ACM
735 A Bridging Model for Parallel Computation (context) - Valiant - 1990 ACM DBLP
531 LogP: Towards a Realistic Model of Parallel Computation - Culler, Karp et al. - 1993 ACM DBLP
341 Parallel Programming in Split-C - Culler, Dusseau et al. - 1993 ACM DBLP
130 LogGP: Incorporating Long Messages into the LogP Model - One.. - Alexandrov, Ionescu et al. - 1995 DBLP
77 Parallel Sorting by Regular Sampling - Shi, Schaeffer - 1992 ACM DBLP
69 CCL: A Portable and Tunable Collective Communication Library.. - Bala, Bruck et al. - 1995 DBLP
57 Empirical Evaluation CRAY TD Compiler Perspective - Krishnamurthy, Yelick et al. - 1995
42 Deterministic Sorting and Randomized Median Finding on the B.. - Gerbessiotis, Siniolakis - 1996 ACM DBLP
41 the Versatility of Parallel Sorting by Regular Sampling - Li, Lu et al. - 1993
35 Practical Parallel Algorithms for Personalized Communication.. - Bader, Helman et al. - 1995 ACM DBLP
31 Practical Parallel Algorithms for Dynamic Data Redistributio.. - Bader, J'aJ'a - 1995
26 Parallel Algorithms for Personalized Communication and Sorti.. - Helman, Bader et al. - 1996
21 SHMEM Technical Note for C (context) - Research - 1994
10 A Randomized Parallel Sorting Algorithm With an Experimental.. - Helman, Bader et al. - 1996 ACM DBLP
9 Supercomputing Research Center (context) - Carlson, Draper et al. - 1995
3 Data for Regular Sorting (context) - Gerbessiotis - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://hpc.eece.unm.edu/papers/3670.html):
A New Deterministic Parallel Sorting Algorithm With an.. - Helman, JaJa, Bader (1997) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC