Sciweavers

5640 search results - page 395 / 1128
» Parallelizing the Data Cube
Sort
View
CLUSTER
2002
IEEE
15 years 11 months ago
Kernel-Level Caching for Optimizing I/O by Exploiting Inter-Application Data Sharing
With applications becoming larger and the increasing load on high performance systems, it is important to tackle the I/O bottleneck problem from several angles. It is not only ess...
Murali Vilayannur, Mahmut T. Kandemir, Anand Sivas...
ICDCS
2002
IEEE
15 years 11 months ago
Bidding for Storage Space in a Peer-to-Peer Data Preservation System
Digital archives protect important data collections from failures by making multiple copies at other archives, so that there are always several good copies of a collection. In a c...
Brian F. Cooper, Hector Garcia-Molina
ICDCS
2000
IEEE
15 years 11 months ago
Static and Adaptive Data Replication Algorithms for Fast Information Access in Large Distributed Systems
Creating replicas of frequently accessed objects across a read-intensive network can result in large bandwidth savings which, in turn, can lead to reduction in user response time....
Thanasis Loukopoulos, Ishfaq Ahmad
CCGRID
2004
IEEE
15 years 10 months ago
Capability matching of data streams with network services
Distributed computing middleware needs to support a wide range of resources, such as diverse software components, various hardware devices, and heterogeneous operating systems and...
Han Gao, Ivan R. Judson, Thomas D. Uram, Terry Dis...
CLUSTER
2004
IEEE
15 years 10 months ago
An evaluation of the close-to-files processor and data co-allocation policy in multiclusters
In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input files in multipl...
Hashim H. Mohamed, Dick H. J. Epema