2609 search results - page 339 / 522 » Optimizing for parallelism and data locality |
149
Voted
NIPS
2001
15 years 6 months ago
2001
The popular K-means clustering partitions a data set by minimizing a sum-of-squares cost function. A coordinate descend method is then used to nd local minima. In this paper we sh...
112
click to vote
TNC
2004
15 years 6 months ago
2004
This paper introduces an environment for distributed video transcoding based on Grid computing infrastructure and Internet Backplane Protocol storage infrastructure. A model for s...
173
Voted
ICPP
2009
IEEE
15 years 11 months ago
2009
IEEE
—Clusters and applications continue to grow in size while their mean time between failure (MTBF) is getting smaller. Checkpoint/Restart is becoming increasingly important for lar...
145
Voted
PVM
1998
Springer
15 years 9 months ago
1998
Springer
Abstract. SKaMPI is a benchmark for MPI implementations. Its purpose is the detailed analysis of the runtime of individual MPI operations and comparison of these for di erent imple...
134
click to vote
SIGMETRICS
1992
ACM
15 years 9 months ago
1992
ACM
To cope with the increasing difference between processor and main memory speeds, modern computer systems use deep memory hierarchies. In the presence of such hierarchies, the perf...