Optimal scheduling of compute-intensive tasks on a network of workstations

Author

Efe, Kemal ; Krishnamoorthy, Venkatesh

Author_Institution

Center for Adv. Comput. Studies, Southwestern Louisiana Univ., Lafayette, LA, USA

Volume

6

Issue

6

fYear

1995

fDate

6/1/1995 12:00:00 AM

Firstpage

668

Lastpage

673

Abstract

In a network of high performance workstations, many workstations are underutilized by their owners. The problem of using these idle cycles for solving computationally intensive tasks by executing a large task on many workstations has been addressed before and algorithms with O(N²) time and O(N) space for choosing the optimal subset of workstations out of N workstations were presented. We improve these algorithms to reduce the running time to O(N log N), while keeping the space requirement the same. The proposed algorithms are particularly useful for SPMD parallelism where computation is the same for all workstations and the data space is partitioned between the workstations

Keywords

computational complexity; processor scheduling; resource allocation; workstations; SPMD parallelism; computationally intensive tasks; compute-intensive tasks; optimal scheduling; space requirement; workstation network; Computer networks; Concurrent computing; Distributed computing; Optimal scheduling; Parallel processing; Partitioning algorithms; Processor scheduling; Scheduling algorithm; Supercomputers; Workstations;

fLanguage

English

Journal_Title

Parallel and Distributed Systems, IEEE Transactions on

Publisher

ieee

ISSN

1045-9219

Type

jour

DOI

10.1109/71.388049

Filename

388049