Abstract

In this paper, we address problems of efficient computing in distributed systems with non-dedicated resources including utility grid. There are global job flows from external users along with resource owner's local tasks upon the resource non-dedication condition. Competition for resource reservation between independent users, local and global job flows substantially complicates scheduling and the requirement to provide the necessary quality of service. A metascheduling concept, justified in this work, assumes a complex combination of job flow dispatching and application-level scheduling methods for parallel jobs, as well as resource sharing and consumption policies established in virtual organizations and based on economic principles. We introduce heuristic slot selection and co-allocation strategies for parallel jobs. They are formalized by given criteria and implemented by algorithms of linear complexity on an available slots number.

Keywords

MSC

AB-XYZ TBA

Cite this article

@article{cai-2029,
  author  = {Victor Toporkov and Dmitry Yemelyanov and Petr Potekhin and Anna Toporkova and Alexey Tselishchev},
  title   = {Metascheduling and Heuristic Co-Allocation Strategies in Distributed Computing},
  journal = {Computing and Informatics},
  volume  = {34},
  number  = {1},
  pages   = {45--76},
  year    = {2015},
  issn    = {1335-9150},
  url     = {https://cai.type.sk/content/2015/1/metascheduling-and-heuristic-co-allocation-strategies-in-distributed-computing/}
}
Download .bib