Scheduling of independent tasks

Part 1 book "Scheduling in real-time systems" includes content: Basic concepts, scheduling of independent tasks, scheduling of dependent tasks, scheduling schemes for handling overload, multiprocessor scheduling.

119p oursky03 21-08-2023 7 4   Download

We examine the first phase of a known NP-hard 2-stage assembly problem. It consists of sequencing a set of jobs having multiple components to be processed. Each job has to be worked on independently on a specific machine. We consider these jobs to form a vector of tasks. Our objective is to schedule jobs on the particular machines in order to minimize the completion time before the second stage starts.

15p danhnguyentuongvi27 19-12-2018 42 0   Download

Scheduling of Dependent Tasks In the previous chapter, we assumed that tasks were independent, i.e. with no relationships between them. But in many real-time systems, inter-task dependencies are necessary for realizing some control activities. In fact, this inter-task cooperation can be expressed in different ways: some tasks have to respect a processing order, data exchanges between tasks, or use of various resources, usually in exclusive mode.

28p vaseline 30-08-2010 100 13   Download

Scheduling of Independent Tasks This chapter deals with scheduling algorithms for independent tasks. The first part of this chapter describes four basic algorithms: rate monotonic, inverse deadline, earliest deadline first, and least laxity first. These algorithms deal with homogeneous sets of tasks, where tasks are either periodic or aperiodic. However, real-time applications often require both types of tasks. In this context, periodic tasks usually have hard timing constraints and are scheduled with one of the four basic algorithms. ...

28p vaseline 30-08-2010 83 12   Download