Sciweavers

5 search results - page 1 / 1
» Distribution-Insensitive Parallel External Sorting on PC Clu...
Sort
View
ISHPC
2003
Springer
13 years 10 months ago
Distribution-Insensitive Parallel External Sorting on PC Clusters
There have been many parallel external sorting algorithms reported such as NOW-Sort, SPsort, and hill sort, etc. They are for sorting large-scale data stored in the disk, but they ...
Minsoo Jeon, Dongseung Kim
ISHPC
2000
Springer
13 years 8 months ago
Partitioned Parallel Radix Sort
Partitioned parallel radix sort is a parallel radix sort that shortens the execution time by modifying the load balanced radix sort which is known one of the fastest internal sort...
Shin-Jae Lee, Minsoo Jeon, Andrew Sohn, Dongseung ...
IPPS
2003
IEEE
13 years 10 months ago
A Divided-Screenwise Hierarchical Compositing for Sort-Last Parallel Volume Rendering
In this work, to render at least 5123 voxel volumes in real-time, we have developed a sort-last parallel volume rendering method for distributed memory multiprocessors. Our sort-l...
Fumihiko Ino, Tomomitsu Sasaki, Akira Takeuchi, Ke...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 9 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
DASFAA
2003
IEEE
151views Database» more  DASFAA 2003»
13 years 10 months ago
Approximate String Matching in DNA Sequences
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
Lok-Lam Cheng, David Wai-Lok Cheung, Siu-Ming Yiu