Sciweavers

238 search results - page 41 / 48
» Optimistic parallelism benefits from data partitioning
Sort
View
SPAA
2009
ACM
14 years 8 months ago
Classifying peer-to-peer network coding schemes
Modern peer-to-peer file sharing systems distribute large files among peers using block partitioning. Blocks can be redistributed by a peer even before the whole file is available...
Christian Ortolf, Christian Schindelhauer, Arne Va...
DAC
2005
ACM
14 years 8 months ago
Locality-conscious workload assignment for array-based computations in MPSOC architectures
While the past research discussed several advantages of multiprocessor-system-on-a-chip (MPSOC) architectures from both area utilization and design verification perspectives over ...
Feihui Li, Mahmut T. Kandemir
HPCA
2003
IEEE
14 years 8 months ago
Slipstream Execution Mode for CMP-Based Multiprocessors
Scalability of applications on distributed sharedmemory (DSM) multiprocessors is limited by communication overheads. At some point, using more processors to increase parallelism y...
Khaled Z. Ibrahim, Gregory T. Byrd, Eric Rotenberg
ISWC
2003
IEEE
14 years 25 days ago
Coarse, Inexpensive, Infrared Tracking for Wearable Computing
We present a novel, inexpensive, coarse tracking system that determines a person’s approximate 2D location and 1D head orientation in an indoor environment. While this coarse tr...
Drexel Hallaway, Tobias Höllerer, Steven Fein...
EDBT
2010
ACM
155views Database» more  EDBT 2010»
13 years 11 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas