Gang scheduling in a two-cluster system implementing migrations and periodic feedback

Author:

Papazachos Zafeirios C1,Karatza Helen D1

Affiliation:

1. Department of Informatics, Aristotle University of Thessaloniki, Greece

Abstract

In order to maximize the efficiency of a complex distributed system such as a grid, a proper scheduling algorithm is necessary. The scheduling algorithm is responsible for allocating the available system resources to the existing jobs. In this paper, we consider scheduling gangs in a multi-cluster system in the presence of critical jobs which arrive in a sporadic manner. We examine an adaptive grid scheduler with periodic feedback which allocates the existing jobs to the available clusters. A migration scheme is implemented in order to alleviate the impact of critical sporadic jobs on the performance of gang scheduling. A simulation model is used to provide results on the performance of the system.

Publisher

SAGE Publications

Subject

Computer Graphics and Computer-Aided Design,Modelling and Simulation,Software

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Scheduling techniques for complex workloads in distributed systems;Proceedings of the 2nd International Conference on Future Networks and Distributed Systems;2018-06-26

2. Algorithms Scheduling with Migration Strategies for Reducing Fragmentation in Distributed Systems;IEEE Latin America Transactions;2015-03

3. QMAEA: A quantum multi-agent evolutionary algorithm for multi-objective combinatorial optimization;SIMULATION;2013-05-16

4. A Fair and Efficient Gang Scheduling Algorithm for Multicore Processors;Wireless Networks and Computational Intelligence;2012

5. Gang scheduling in multi-core clusters implementing migrations;Future Generation Computer Systems;2011-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3