WIT Press


Scheduling Distributed Algorithms On Heterogeneous Computer Networks

Price

Free (open access)

Volume

11

Pages

8

Published

1995

Size

883 kb

Paper DOI

10.2495/ASE950061

Copyright

WIT Press

Author(s)

M. Alfano, A. Genco & G. Lo Re

Abstract

This study deals with a distributed scheduling organization devoted to manage stand-alone and co-operating applications on a workstation network. To this end, it considers different aspects and requirements of the applications, the operating systems, and the distributed environment. In particular, it considers the scheduling activities devoted to the dynamic allocation of processes and proposes a model for differentiating local, global, long-term, medium term, and short-term scheduling. The authors provide a theoretical scheme where the above components are conveniently organized and propose a practical implementation for a network of Unix workstations using the PVM (Parallel Virtual Machine) facilities. In particular, the paper examines the problem of the performance evaluation of co-operating processes and proposes a solution based on delay detec

Keywords