Sciweavers

1127 search results - page 94 / 226
» Improving Data Locality by Chunking
Sort
View
FTTCS
2006
132views more  FTTCS 2006»
15 years 4 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter
PPOPP
2010
ACM
16 years 1 months ago
A distributed placement service for graph-structured and tree-structured data
Effective data placement strategies can enhance the performance of data-intensive applications implemented on high end computing clusters. Such strategies can have a significant i...
Gregory Buehrer, Srinivasan Parthasarathy, Shirish...
PDP
2009
IEEE
15 years 10 months ago
Task-Parallel versus Data-Parallel Library-Based Programming in Multicore Systems
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
Diego Andrade, Basilio B. Fraguela, James C. Brodm...
ANSS
2007
IEEE
15 years 10 months ago
Scalable Data Collection Protocols for Wireless Sensor Networks with Multiple Mobile Sinks
Data propagation in wireless sensor networks is usually performed as a multihop process. To deliver a single message, the resources of many sensor nodes are used and a lot of ener...
Athanasios Kinalis, Sotiris E. Nikoletseas
ISCA
1999
IEEE
87views Hardware» more  ISCA 1999»
15 years 8 months ago
Memory Forwarding: Enabling Aggressive Layout Optimizations by Guaranteeing the Safety of Data Relocation
By optimizing data layout at run-time, we can potentially enhance the performance of caches by actively creating spatial locality, facilitating prefetching, and avoiding cache con...
Chi-Keung Luk, Todd C. Mowry