Sciweavers

2104 search results - page 2 / 421
» Sorting with networks of data structures
Sort
View
VLDB
2007
ACM
121views Database» more  VLDB 2007»
13 years 11 months ago
CellSort: High Performance Sorting on the Cell Processor
In this paper we describe the design and implementation of CellSort − a high performance distributed sort algorithm for the Cell processor. We design CellSort as a distributed b...
Bugra Gedik, Rajesh Bordawekar, Philip S. Yu
IPPS
2000
IEEE
13 years 9 months ago
Reconfigurable Parallel Sorting and Load Balancing on a Beowulf Cluster: HeteroSort
HeteroSort load balances and sorts within static or dynamic networks using a conceptual torus mesh. We ported HeteroSort to a 16-node Beowulf cluster with a central switch architec...
Pamela Yang, Timothy M. Kunau, Bonnie Holte Bennet...
ACSC
2003
IEEE
13 years 8 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel
IPPS
1997
IEEE
13 years 9 months ago
Optimizing Parallel Bitonic Sort
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
Mihai F. Ionescu
NCA
2008
IEEE
13 years 11 months ago
Sorting Based Data Centric Storage
— Data-centric storage [6] is a very important concept for sensor networks that supports efficient in-network data query and processing. Previous approaches are mostly using a h...
Fenghui Zhang, Anxiao Jiang, Jianer Chen