Online Multiprocessor Scheduling
نویسنده
چکیده
A scheduling problem is characterized by the properties of the jobs, the properties of the machines, the properties of the processing constraints and the optimality criterion. The properties of the jobs involve the processing time of the jobs, the release dates, deadlines and priorities. The properties of the machines are the number of machines, processing speeds of the machines and machine configuration (parallel or series). There can be a number of constraints for processing the jobs in the machines, e.g. precedence, penalties for lateness, capability of preemption, offline or online arrival of jobs. Finally the optimality criterion is the goal of the scheduling task, which is usually minimizing an objective function e.g. the processing time of the entire batch (makespan), the average completion time of the jobs, total waiting time or the maximum lateness of any job.
منابع مشابه
Pre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملScheduling of a flexible flow shop with multiprocessor task by a hybrid approach based on genetic and imperialist competitive algorithms
This paper presents a new mathematical model for a hybrid flow shop scheduling problem with multiprocessor tasks in which sequence dependent set up times and preemption are considered. The objective is to minimize the weighted sum of makespan and maximum tardiness. Three meta-heuristic methods based on genetic algorithm (GA), imperialist competitive algorithm (ICA) and a hybrid approach of GA a...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کاملOn-Line Scheduling on Uniform Multiprocessors
Each processor in a uniform multiprocessor machine is characterized by a speed or computing capacity, with the interpretation that a job executing on a processor with speed for time units completes units of execution. The on-line scheduling of hard-real-time systems, in which all jobs must complete by specified deadlines, on uniform multiprocessor machines is considered. It is known that online...
متن کاملThe Multiprocessor Real-Time Scheduling of General Task Systems
NATHAN WAYNE FISHER: The Multiprocessor Real-Time Scheduling of General Task Systems. (Under the direction of Sanjoy K. Baruah.) The recent emergence of multicore and related technologies in many commercial systems has increased the prevalence of multiprocessor architectures. Contemporaneously, real-time applications have become more complex and sophisticated in their behavior and interaction. ...
متن کاملParameter Learning Online Algorithm for Multiprocessor Scheduling with Rejection
In multiprocessor scheduling with rejection the jobs are characterized by a processing time and a penalty and it is possible to reject the jobs. The goal is to minimize the makespan of the schedule for the accepted jobs plus the sum of the penalties of the rejected jobs. In this paper we present a new online algorithm for the problem. Our algorithm is a parameter learning extension of the total...
متن کامل