Sciweavers

158 search results - page 2 / 32
» Benefits of Processor Clustering in Designing Large Parallel...
Sort
View
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
13 years 10 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
CCGRID
2003
IEEE
13 years 10 months ago
Large Scale Dissemination Using a Peer-to-Peer Network
The widespread use of broadband networks and the evolution of Peer-to-Peer systems changed dramatically the way Internet is used today. P2P file sharing networks are one of the mo...
Konstantinos G. Zerfiridis, Helen D. Karatza
CCGRID
2003
IEEE
13 years 10 months ago
Improved Read Performance in a Cost-Effective, Fault-Tolerant Parallel Virtual File System (CEFT-PVFS)
Due to the ever-widening performance gap between processors and disks, I/O operations tend to become the major performance bottleneck of data-intensive applications on modern clus...
Yifeng Zhu, Hong Jiang, Xiao Qin, Dan Feng, David ...
CLUSTER
2003
IEEE
13 years 10 months ago
A Robust Scheduling Strategy for Moldable Scheduling of Parallel Jobs
Moldable job scheduling has been proved to be effective compared to traditionaljob scheduling policies. It is based on the observation that most jobs submitted to a spaceshared pa...
Sudha Srinivasan, Sriram Krishnamoorthy, P. Sadaya...
PVLDB
2008
182views more  PVLDB 2008»
13 years 4 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...