Experiments with scheduling divisible tasks in clusters of workstations

71Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

We present results of a series of experiments with parallel processing divisible tasks on various cluster of workstations platforms. Divisible task is a new model of scheduling distributed computations. It is assumed that the parallel application can be divided into parts of arbitrary sizes and the parts can be processed independently on distributed computers. Though practical verification of the scheduling model was the primary goal of the experiments also an insight into the behavior and performance of cluster computing platforms has been gained.

Cite

CITATION STYLE

APA

Drozdowski, M., & Wolniewicz, P. (2000). Experiments with scheduling divisible tasks in clusters of workstations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 311–319). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free