Internet-based clusters of workstations have been extensively used to execute parallel applications. Although these internet-based clusters seem to be an easy and inexpensive way ...
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
A parallel file may be physically stored on several independent disks and logically partitioned by several processors. This paper presents general algorithms for mapping between t...
An optimal prefetching and I/O scheduling algorithm L-OPT, for parallel I/O systems, using a read-once model of block references is presented. The algorithm uses knowledge of the n...