Method of scheduling successive tasks
US5826080A · kind A · utility
Assignee
Inventor
Key dates
| Filing date | Aug 2, 1995 |
| Grant date | Oct 20, 1998 |
| Priority date | — |
| Expiry date | Aug 2, 2015 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/4887
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method of scheduling tasks subject to timing and succession constraints essentially comprises grouping the tasks in layers according to succession constraints and scheduling the tasks layer by layer in increasing layer order up to the last layer, if possible, and then deciding that the resulting scheduling succeeds. If the scheduling achieved in a layer other than the first layer does not satisfy one or more constraints applying to a task belonging to the current layer, the method reschedules a layer containing a predecessor task corresponding to an unsatisfied constraint, schedules or reschedules all the other layers higher than the layer of the predecessor task, up to the last layer, if possible, and then decides that the resulting scheduling succeeds. Applications include scheduling of transmission of information on an industrial data bus.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.