To access the full text documents, please follow this link: http://hdl.handle.net/10459.1/57424

Implementing and Analysing an Effective Explicit Coscheduling Algorithm on a NOW
Solsona Tehàs, Francesc; Giné, Francesc; Molina, Fermín; Hernandez, Porfidio; Luque, Emilio
Networks of workstations (NOWs) have become important and cost-effective parallel platforms for scientific computations. In practice, a NOW system is heterogeneous and non-dedicated. These two unique factors make scheduling policies on multiprocessor/multicomputer systems unsuitable for NOWs, but the coscheduling principle is still an important basis for parallel process scheduling in these environments. The main idea of this technique is to schedule the set of tasks composing a parallel application at the same time, to increase their communication performance. In this article we present an explicit coscheduling algorithm implemented in a Linux NOW, of PVM distributed tasks, based on Real Time priority assignment. The main goal of the algorithm is to execute efficiently distributed applications without excessively damaging the response time of local tasks. Extensive performance analysis as well as studies of the parameters and overheads involved in the implementation demonstrated the applicability of the proposed algorithm.
(c) Springer Verlag, 2001
info:eu-repo/semantics/restrictedAccess
article
publishedVersion
Springer Verlag
         

Full text files in this document

Files Size Format View
006688.pdf 229.2 KB application/pdf View/Open

Show full item record

Related documents

Other documents of the same author

 

Coordination

 

Supporters