Sciweavers

46 search results - page 4 / 10
» Misleading performance claims in parallel computations
Sort
View
PPOPP
2006
ACM
14 years 11 days ago
Programming for parallelism and locality with hierarchically tiled arrays
Tiling has proven to be an effective mechanism to develop high performance implementations of algorithms. Tiling can be used to organize computations so that communication costs i...
Ganesh Bikshandi, Jia Guo, Daniel Hoeflinger, Gheo...
CIKM
2004
Springer
13 years 12 months ago
Approximating the top-m passages in a parallel question answering system
We examine the problem of retrieving the top-m ranked items from a large collection, randomly distributed across an n-node system. In order to retrieve the top m overall, we must ...
Charles L. A. Clarke, Egidio L. Terra
IEEEPACT
2007
IEEE
14 years 22 days ago
FAME: FAirly MEasuring Multithreaded Architectures
Nowadays, multithreaded architectures are becoming more and more popular. In order to evaluate their behavior, several methodologies and metrics have been proposed. A methodology ...
Javier Vera, Francisco J. Cazorla, Alex Pajuelo, O...
IPPS
2006
IEEE
14 years 14 days ago
Wire-speed total order
— Many distributed systems may be limited in their performance by the number of transactions they are able to support per unit of time. In order to achieve fault tolerance and to...
Tal Anker, Danny Dolev, G. Greenman, I. Shnaiderma...
ICDCS
2005
IEEE
14 years 1 days ago
Keyword Search in DHT-Based Peer-to-Peer Networks
Existing techniques for keyword/attribute search in structured P2P overlays suffer from several problems: unbalanced load, hot spots, fault tolerance, storage redundancy, and unab...
Yuh-Jzer Joung, Chien-Tse Fang, Li-Wei Yang