Dynamic scheduling and analysis of real time systems with multiprocessors

详细信息    查看全文

• 作者：M.D. Nashid Anjum ^{manjum@umassd.edu" class="auth_mail" title="E-mail the corresponding author} ; Honggang Wang ; ^{hwang1@umassd.edu" class="auth_mail" title="E-mail the corresponding author}
• 关键词：Job-shop scheduling problems ; JSP ; LPT ; SPT ; LS ; EDD ; Tube-tap ; MINLP
• 刊名：Digital Communications and Networks
• 出版年：2016
• 出版时间：August 2016
• 年：2016
• 卷：2
• 期：3
• 页码：130-138
• 全文大小：1849 K

文摘

This research work considers a scenario of cloud computing job-shop scheduling problems. We consider m realtime jobs with various lengths and n machines with different computational speeds and costs. Each job has a deadline to be met, and the profit of processing a packet of a job differs from other jobs. Moreover, considered deadlines are either hard or soft and a penalty is applied if a deadline is missed where the penalty is considered as an exponential function of time. The scheduling problem has been formulated as a mixed integer non-linear programming problem whose objective is to maximize net-profit. The formulated problem is computationally hard and not solvable in deterministic polynomial time. This research work proposes an algorithm named the Tube-tap algorithm as a solution to this scheduling optimization problem. Extensive simulation shows that the proposed algorithm outperforms existing solutions in terms of maximizing net-profit and preserving deadlines.