The Sprite Network Operating System
Computer
Independent Partitioning of Algorithms with Uniform Dependencies
IEEE Transactions on Computers
DAWGS—a distributed compute server utilizing idle workstations
Journal of Parallel and Distributed Computing
Heterogeneous parallel programming in Jade
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Parallel matrix multiplication on networked microcomputers
Computers and Electrical Engineering
An overview of the Amoeba distributed operating system
ACM SIGOPS Operating Systems Review
DERBY: A Memory Management System for Distributed Main Memory Databases
RIDE '96 Proceedings of the 6th International Workshop on Research Issues in Data Engineering (RIDE '96) Interoperability of Nontraditional Database Systems
An effective approximation algorithm for the Malleable Parallel Task Scheduling problem
Journal of Parallel and Distributed Computing
Research: Effective queueing strategies for co-scheduling in a pool of processors
Computer Communications
| Hi-index | 0.00 |
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 [1] and algorithms with $O(N^2)$ 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.Index Terms驴Task scheduling, SPMD computations, resource allocation, distributed operating systems, networks of workstations.