Sciweavers

5640 search results - page 767 / 1128
» Parallelizing the Data Cube
Sort
View
HPCA
2006
IEEE
15 years 9 months ago
Increasing the cache efficiency by eliminating noise
Caches are very inefficiently utilized because not all the excess data fetched into the cache, to exploit spatial locality, is utilized. We define cache utilization as the percent...
Prateek Pujara, Aneesh Aggarwal
MIDDLEWARE
2004
Springer
15 years 8 months ago
A grid service broker for scheduling distributed data-oriented applications on global grids
: The next generation of scientific experiments and studies, popularly called as e-Science, is carried out by large collaborations of researchers distributed around the world engag...
Srikumar Venugopal, Rajkumar Buyya, Lyle J. Winton
DEBS
2003
ACM
15 years 8 months ago
MJoin: a metadata-aware stream join operator
Join algorithms must be re-designed when processing stream data instead of persistently stored data. Data streams are potentially infinite and the query result is expected to be ...
Luping Ding, Elke A. Rundensteiner, George T. Hein...
ICS
2003
Tsinghua U.
15 years 8 months ago
miNI: reducing network interface memory requirements with dynamic handle lookup
Recent work in low-latency, high-bandwidth communication systems has resulted in building user–level Network InControllers (NICs) and communication abstractions that support dir...
Reza Azimi, Angelos Bilas
126
Voted
USENIX
2008
15 years 5 months ago
Prefetching with Adaptive Cache Culling for Striped Disk Arrays
Conventional prefetching schemes regard prediction accuracy as important because useless data prefetched by a faulty prediction may pollute the cache. If prefetching requires cons...
Sung Hoon Baek, Kyu Ho Park