کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
5000821 | 1368398 | 2016 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Dynamic scheduling and analysis of real time systems with multiprocessors
ترجمه فارسی عنوان
برنامه ریزی پویا و تجزیه و تحلیل سیستم های زمان واقعی با چند پردازنده
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
کنترل و سیستم های مهندسی
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Digital Communications and Networks - Volume 2, Issue 3, August 2016, Pages 130-138
Journal: Digital Communications and Networks - Volume 2, Issue 3, August 2016, Pages 130-138
نویسندگان
M.D. Nashid Anjum, Honggang Wang,