Fixed priority scheduling of age constraint processes
| Document type: | Conference Papers |
|---|---|
| Peer reviewed: | Yes |
| Author(s): | Lars Lundberg |
| Title: | Fixed priority scheduling of age constraint processes |
| Conference name: | 4th International Euro-Par Conference on Parallel Processing |
| Year: | 1998 |
| Pagination: | 288-296 |
| ISBN: | 3-540-64952-2 |
| Publisher: | SPRINGER-VERLAG BERLIN |
| City: | SOUTHAMPTON, ENGLAND |
| ISI number: | 000082482800030 |
| Organization: | Blekinge Institute of Technology |
| Department: | Department of Software Engineering and Computer Science (Institutionen för programvaruteknik och datavetenskap) Dept. of Software Engineering and Computer Science S-372 25 Ronneby +46 455 38 50 00 http://www.bth.se/eng/ipd/ |
| Language: | English |
| Abstract: | Real-time systems often consist of a number of independent processes which operate under an age constraint. In such systems, the maximum time from the start process L-i in cycle k to the end in cycle k+1 must not exceed the age constraint A(i) for that process. The age constraint can be met by using fixed priority scheduling and periods equal to A(i)/2. However, this approach restricts the number of process sets which are schedulable. In this paper, we define a method for obtaining process periods other than A(i)/2. The periods are calculated in such a way that the age constraints are met. Our approach is better in the sense that a larger number of process sets can be scheduled compared to using periods equal to A(i)/2. |
| Subject: | Software Engineering\General |
