دانلود رایگان مقاله لاتین برنامه ریزی پویا و آنالیز سیستم پردازشگر از سایت الزویر
عنوان فارسی مقاله:
برنامه ریزی پویا و تجزیه و تحلیل سیستم های زمان واقعی چند پردازشگر
عنوان انگلیسی مقاله:
Dynamic scheduling and analysis of real time systems with multiprocessors
سال انتشار : 2016
برای دانلود رایگان مقاله برنامه ریزی پویا و آنالیز سیستم پردازشگر اینجا کلیک نمایید.
مقدمه انگلیسی مقاله:
1. Introduction
The rapid growth of realtime services and complex commercial strategies of cloud computing makes the scheduling problem a crucial challenge. In the literature of computer science the problem of scheduling multiple jobs (or tasks) on multiple machines (or processors) has been found very crucial and challenging. In terms of computer science jargon this type of optimization problems is known as job-shop scheduling problems (JSP) [1,2]. A number of variants of JSP are available in the literature focusing on different objectives and constraints. This research work considers a cloud computing scenario of real-time dynamic job-shop scheduling where multiple jobs need to be scheduled on multiple processors (i.e., machines) to maximize the net profit. The problem scenario assumes that each job has a deadline to be met, each job may have different job lengths in terms of bits, and the profit of processing a packet of one job differs from the other jobs. It is also considered that each machine may have a different processing rate (bit/s) and processing cost. The cost of processing a job on a machine per time unit may differ from one machine to another machine. The goal is to distribute the loads of the jobs to multiple machines in such a way that meets all the deadlines and maximizes the net profit, i.e., minimizing the overall processing cost. The problem formulation considers both the hard-realtime deadlines [3] and the soft-realtime deadlines [4]. In the case of the hard-realtime deadline the execution time of a job must not exceed the given deadline. Hence, the scheduling makespan needs to meet the deadlines of each job. If the execution time of a job fails to meet the deadline, no reward or profit is gained for processing this job. On the other hand, a soft-realtime deadline allows the execution time to exceed the deadline. Hence, the scheduling makespan does not necessarily meet all the deadlines. However, the soft-deadline concept introduces a penalty function. If the makespan fails to meet the deadline of a job, a penalty is applied. The penalty is non-negative and a function of execution time. If the execution time is less than the deadline the value of the penalty is zero. But the value of the penalty keeps increasing if the execution time exceeds the deadline. This paper formulates the scheduling optimization problem as a mixed integer programming (MIP) problem [5]. At first, the problem formulation considers only hard-deadlines. Later, the problem is extended considering soft-deadlines. The formulated optimization problem for hard-deadlines is basically a mixed integer linear programming (MILP) problem [6]. This paper considers an exponential function for the penalty and thus the formulated problem that considers the soft-deadlines is basically a mixed integer non-linear programming (MINLP) optimization problem. The MINLP problem is practically very difficult to solve, because it combines the combinatorial nature of mixed integer programming (MIP) and the difficulty in solving nonconvex (and even convex) nonlinear programming (NLP) [6].
برای دانلود رایگان مقاله برنامه ریزی پویا و آنالیز سیستم پردازشگر اینجا کلیک نمایید.
کلمات کلیدی:
Dynamic scheduling of real-time aperiodic tasks on multiprocessor ... ieeexplore.ieee.org/document/495496/ by B Hamidzadeh - 1996 - Cited by 15 - Related articles Dynamic scheduling of real-time aperiodic tasks on multiprocessor architectures. Abstract: ... Each scheduling phase performed by one processor of the system is followed by an ... Schedulability analysis for tasks with static and dynamic offsets. [PDF]Scheduling Algorithms for Real-Time Systems - Queen's School of ... www.cs.queensu.ca/home/akl/techreports/scheduling.pdf by A Mohammadi - 2005 - Cited by 58 - Related articles Jul 15, 2005 - Analysis methods and the concept of optimality criteria, which leads to design ... real-time scheduling algorithms for uniprocessor systems, which can be divided into two ... For dynamic-priority based algorithms, we study the. [PDF]Implementation & Performance Analysis of Real Time Scheduling ... airccse.org/journal/ijitcs/papers/2612ijitcs01.pdf Real time scheduling algorithms are mainly depending on type of task i.e. either ... Soft Real Time System: In which deadline (Timing Constraints) is dynamic ... [PDF]Real-Time Scheduling analysis beru.univ-brest.fr/~singhoff/ENS/USTH/sched.pdf by F Singhoff - Cited by 3 - Related articles 5. Real-time scheduling for multiprocessor and distributed systems. 6. Conclusion. 7. ... or at execution time? Static/dynamic priority scheduler: priorities may. [PDF]ParaScale: Exploiting Parametric Timing Analysis for Real-Time ... www.cs.fsu.edu/~whalley/papers/rtss05.pdf by S Mohan - Cited by 28 - Related articles metric timing analysis to interact with dynamic real-time schedulers. ... dynamic scheduling, significant savings in power can be ob- tained, e.g., in the case of ... cution time (WCET) of each task in a real-time system be known. The process of ... Searches related to Dynamic scheduling and analysis of real time systems real time scheduling algorithms real time scheduling in operating system real time scheduling algorithms in os types of real time scheduling real time scheduling in operating system pdf real time scheduling pdf real time scheduling ppt real time scheduling examples
