Abstract
Given n periodic tasks, each characterized by an execution requirement and a period, and m identical copies of a resource, the periodic scheduling problem is concerned with generating a schedule for the n tasks on the m resources. We present an algorithm that schedules every feasible instance of the periodic scheduling problem, and runs in O(min{m lg n, n}) time per slot scheduled.
| Original language | English |
|---|---|
| Pages (from-to) | 280-288 |
| Number of pages | 9 |
| Journal | IEEE Symposium on Parallel and Distributed Processing - Proceedings |
| State | Published - 1995 |
| Event | Proceedings of the IEEE 9th International Parallel Processing Symposium - Santa Barbara, CA, USA Duration: Apr 25 1995 → Apr 28 1995 |