No label defined (Q3987220)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 30973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 30973 |
Statements
28 June 1992
0 references
acceptability
0 references
deadline
0 references
two cyclic tasks
0 references
single machine
0 references
polynomial time algorithm
0 references
0.8170346617698669
0 references
0.8083173632621765
0 references
Deadline scheduling of two cyclic tasks on a single machine is considered. There are two tasks each of which consists of a periodic sequence of requests such that every request may be executed in \(c_ i\) time units, \(i=1,2\), where the execution of the \(k\)th request may be started at moment \((k-1)p_ i\) and must be completed no later than at moment \((k-1)p_ i+d_ i\) (deadline). Interruptions in request execution are allowed. Here \(p_ i\geq d_ i\geq c_ i>0\), \(i=1,2\). The system of tasks is said to be acceptable if there exists a schedule in which all deadlines for both tasks are respected for any \(k\), \(k=1,2,\dots\). Some sufficient conditions for a system of two tasks to be acceptable are proposed. A polynomial time algorithm for the determination if a system is acceptable or not is suggested.
0 references