Sciweavers

6437 search results - page 199 / 1288
» Parallel Algorithms for Arrangements
Sort
View
HCW
2000
IEEE
15 years 7 months ago
A Heuristic Algorithm for Mapping Communicating Tasks on Heterogeneous Resources
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
Kenjiro Taura, Andrew A. Chien
PDPTA
2000
15 years 4 months ago
Using a Hypercube Algorithm for Broadcasting in Internet-Based Clusters
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 ...
Silvia M. Figueira
IPPS
2000
IEEE
15 years 7 months ago
On Identifying Strongly Connected Components in Parallel
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 ...
Lisa Fleischer, Bruce Hendrickson, Ali Pinar
EUROPAR
1999
Springer
15 years 7 months ago
Parallel k/h-Means Clustering for Large Data Sets
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 ...
Kilian Stoffel, Abdelkader Belkoniene
TJS
2008
98views more  TJS 2008»
15 years 2 months ago
Mapping functions and data redistribution for parallel files
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...
Florin Isaila, Walter F. Tichy