Khaled Alsabti, Sanjay Ranka  Home/Search
Context Related
| usc.edu/~hipc97/papers/125.ps syr.edu/projects/pcrc/doc/flo...sort.ps usc.edu/~hipc/hipc97/papers/125.ps 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: prism.uvsq.fr/archi/pubs...hipc97 (more) From: hipc.org/hipc97/total (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Integer sorting is a subclass of the sorting problem where the elements have integer values and the largest element is polynomially bounded in the number of elements to be sorted. It is useful for applications in which the size of the maximum value of element to be sorted is bounded. In this paper, we present a new distributed radix-sort algorithm for integer sorting. The structure of our algorithm is similar to radix sort except that it typically requires less number of communication phases.... (Update)
Context of citations to this paper: More
...results due to space limitations. For a detailed description and discussion of the experimental results the reader is referred to [2]. For each algorithm, we have assumed 16K, 32K, 64K, 128K and 256K elements per processor using 32, 64, 128 and 256 processors. Two sets of...
...the size of the maximum value of element to be sorted is bounded. We developed a new algorithm, distributed radixsort, for integer sorting [4]. The structure of our algorithm is similar to radix sort except that it requires less number of communication phases. Our experimental...
Cited by: More
Common Runtime Support for High Performance Languages - Fox (1998) (Correct)
Skew-Insensitive Parallel Algorithms for Relational Join - Alsabti, Ranka (Correct)
Integer Sorting Algorithms for Coarse-Grained Parallel Machines - Alsabti, Ranka (1997) (Correct)
Similar documents (at the sentence level):
7.5%: Parallel Construction of Multidimensional Binary Search Trees - Ibraheem Al-Furaih (Correct)
6.2%: Concatenated Parallelism: A Technique for Efficient.. - Aluru, Goil, Ranka (1996) (Correct)
5.7%: PHANTOM: Parallelization of Hierarchical Applications usiNg.. - Goil (1996) (Correct)
Active bibliography (related documents): More All
0.6: Parallel Sorting by Overpartitioning - Li, Sevcik (1994) (Correct)
0.5: Practical Parallel Algorithms for Personalized.. - Bader, Helman, JaJa (1995) (Correct)
0.4: An Evaluation of Sorting as a Supercomputer Benchmark - Thearling (Correct)
Similar documents based on text: More All
0.3: A One-Pass Algorithm for Accurately Estimating Quantiles.. - Alsabti, Ranka, Singh (1997) (Correct)
0.3: An Efficient Parallel Algorithm for High Dimensional.. - Alsabti, Ranka, Singh (1997) (Correct)
0.2: CLOUDS: A Decision Tree Classifier for Large Datasets - Alsabti, Ranka, Singh (1998) (Correct)
Related documents from co-citation: More All
5: Random Data Accesses on a Coarse-Grained Parallel Machine II - Shankar, Ranka - 1997
4: Northeast Parallel Architectures Center (context) - Li, for et al. - 1996
4: Interoperability of data parallel runtime libraries - Edjlali, Sussman et al. - 1997
BibTeX entry: (Update)
K. Alsabti and S. Ranka. Integer Sorting Algorithms for Coarse-Grained Parallel Machines. Technical Report, Department of CISE, University of Florida, 1997. http://citeseer.ist.psu.edu/alsabti97integer.html More
@misc{ alsabti97integer,
author = "K. Alsabti and S. Ranka",
title = "Integer Sorting Algorithms for Coarse-Grained Parallel Machines",
text = "K. Alsabti and S. Ranka. Integer Sorting Algorithms for Coarse-Grained
Parallel Machines. Technical Report, Department of CISE, University of Florida,
1997.",
year = "1997",
url = "citeseer.ist.psu.edu/alsabti97integer.html" }
Citations (may not include all citations):3972 Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
288 Introduction to Parallel Computing: Design and Analysis of A.. (context) - Kumar - 1994
182 A Comparison of Sorting Algorithms for the Connection Machin.. - Blelloch - 1991
159 Tight bounds on the complexity of parallel sorting (context) - Leighton - 1985
59 Parallel Sorting Algorithms (context) - Akl - 1985
48 Parallel Sorting by Overpartitioning - Li, Sevcik - 1994
41 the versatility of parallel sorting by regular sampling - Li - 1993
30 Fast Parallel Sorting under LogP: from theory to practice - Culler - 1993
9 A balanced bin sort for hypercube multicomputers (context) - Won, Sahni - 1988
8 Solving Problems on Concurrent Processors: Vol (context) - Fox - 1988
4 Integer Sorting Algorithms for Coarse-Grained Parallel Machi.. - Alsabti, Ranka - 1997
3 Parallel Integer Sorting with Medium and Fine-Scale Parallel.. - Dagum
2 Optimal and sublogrithmic time randomized parallel sorting a.. (context) - Rajasekaran, Reif - 1989
2 The Transportation Primitives (context) - Alsabti, Ranka et al. - 1995
Documents on the same site (http://www.prism.uvsq.fr/archi/pubs/library/hipc/hipc97.html): More
Parallel Domain Decomposition and Load Balancing Using.. - Aluru, Sevilgen (1997) (Correct)
Parallel Program Design in Visual Environment - Trichina, Oinonen (1997) (Correct)
Global I/O Optimizations for Out-of-Core Computations - Kandemir, Kandaswamy.. (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