Sciweavers

116 search results - page 7 / 24
» A practical access to the theory of parallel algorithms
Sort
View
SPAA
2003
ACM
14 years 19 days ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
INFOSCALE
2006
ACM
14 years 1 months ago
A library of constructive skeletons for sequential style of parallel programming
Abstract— With the increasing popularity of parallel programming environments such as PC clusters, more and more sequential programmers, with little knowledge about parallel arch...
Kiminori Matsuzaki, Hideya Iwasaki, Kento Emoto, Z...
PODC
2005
ACM
14 years 29 days ago
Quorum placement in networks to minimize access delays
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of n...
Anupam Gupta, Bruce M. Maggs, Florian Oprea, Micha...
ISLPED
1998
ACM
84views Hardware» more  ISLPED 1998»
13 years 11 months ago
Low power architecture of the soft-output Viterbi algorithm
CT This paper investigates the low power implementation issues of the soft-output Viterbi algorithm (SOVA), a building block for turbo codes. By briefly explaining the theory of t...
David Garrett, Mircea R. Stan
CLUSTER
2003
IEEE
14 years 21 days ago
Improving the Performance of MPI Derived Datatypes by Optimizing Memory-Access Cost
The MPI Standard supports derived datatypes, which allow users to describe noncontiguous memory layout and communicate noncontiguous data with a single communication function. Thi...
Surendra Byna, William D. Gropp, Xian-He Sun, Raje...