Sciweavers

2127 search results - page 397 / 426
» Computing large matchings fast
Sort
View
SPAA
2004
ACM
15 years 3 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
ICPADS
2002
IEEE
15 years 2 months ago
Sago: A Network Resource Management System for Real-Time Content Distribution
Abstract— Content replication and distribution is an effective technology to reduce the response time for web accesses and has been proven quite popular among large Internet cont...
Tzi-cker Chiueh, Kartik Gopalan, Anindya Neogi, Ch...
EUROPAR
2009
Springer
15 years 2 months ago
SSD-HDD-Hybrid Virtual Disk in Consolidated Environments
Abstract. With the prevalence of multi-core processors and cloud computing, the server consolidation using virtualization has increasingly expanded its territory, and the degree of...
Heeseung Jo, Youngjin Kwon, Hwanju Kim, Euiseong S...
SPAA
1996
ACM
15 years 2 months ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
CLUSTER
2004
IEEE
15 years 1 months ago
FTC-Charm++: an in-memory checkpoint-based fault tolerant runtime for Charm++ and MPI
As high performance clusters continue to grow in size, the mean time between failure shrinks. Thus, the issues of fault tolerance and reliability are becoming one of the challengi...
Gengbin Zheng, Lixia Shi, Laxmikant V. Kalé