The Community for Technology Leaders
2013 IEEE 9th International Conference on eScience (eScience) (2013)
Beijing, China
Oct. 22, 2013 to Oct. 25, 2013
ISBN: 978-0-7695-5083-1
pp: 228-237
Per-Olov Ostberg , Dept. of Comput. Sci., Umea Univ., Umea, Sweden
Erik Elmroth , Dept. of Comput. Sci., Umea Univ., Umea, Sweden
ABSTRACT
Fairshare scheduling is an established technique to provide user-level differentiation in management of capacity consumption in high-performance and grid computing scheduler systems. In this paper we extend on a state-of-the-art approach to decentralized grid fairs hare and propose a generalized model for construction of decentralized prioritization-based management systems. The approach is based on (re)formulation of control problems as prioritization problems, and a proposed framework for computationally efficient decentralized priority calculation. The model is presented along with a discussion of application of decentralized management systems in distributed computing environments that outlines selected use cases and illustrates key trade-off behaviors of the proposed model.
INDEX TERMS
Computational modeling, Processor scheduling, Distributed databases, Measurement, Peer-to-peer computing, Resource management
CITATION
Per-Olov Ostberg, Erik Elmroth, "Decentralized Prioritization-Based Management Systems for Distributed Computing", 2013 IEEE 9th International Conference on eScience (eScience), vol. 00, no. , pp. 228-237, 2013, doi:10.1109/eScience.2013.44
179 ms
(Ver 3.3 (11022016))