A decentralized resource allocation policy in minigrid

  • Authors:

  • Juan Yang;Yun Bai;Yuhui Qiu

  • Affiliations:

  • Semantic Grid Laboratory of Southwest University, Chongqing, China and Faculty of Computer and Information Science, Southwest University, Chongqing, China;Semantic Grid Laboratory of Southwest University, Chongqing, China and Faculty of Electronic and Information Engineering, Southwest University, ChongQing, China;Semantic Grid Laboratory of Southwest University, Chongqing, China and Faculty of Computer and Information Science, Southwest University, Chongqing, China

  • Venue:
  • Future Generation Computer Systems
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Resource allocating is the key to enhance the concurrency ability of the heterogeneous distributed systems. The traditional resource allocating policies statically assign resources to the jobs according to the distribution schema computed by the job scheduling policy. Those policies cannot handle the DAGs with large jobs since the computing cost is intolerably huge. Decentralized resource allocating policy is inevitably generated to solve this problem by sharing the computing burden on several processors. However the existing decentralized policies cannot dynamically compute the dependent relationships of a given DAG or even schedule the data driven jobs. This paper proposes a cluster-based resource allocating policy-CDRAP, by which the large-scale distributed systems can precisely schedule the data driven jobs and the computing cost of jobs' scheduling can be controlled in an acceptable range as well. The Broker + describe/issue message mechanism is used as the underlying structure in CDRAP.