Feasibility problems for recurring tasks on one processor (Q688715): Difference between revisions

For periodic, sporadic and hybrid task systems under deadline constraints for the tasks the authors present in a comprehensive summary their results on feasibility of scheduling the tasks on a single processor. A general criterion for feasibility is given and the complexity of the problem is investigated in detail for the different tasks systems.

0 references

Mathematics Subject Classification ID

68M20

0 references

0 references

0 references

deadline algorithm

0 references

periodic task

0 references

sporadic task

0 references

scheduling

0 references

reviewed by

Hans Daduna

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0304-3975(93)90360-6

0 references

OpenAlex ID

W2009415693

0 references

cites work

The complexity of theorem-proving procedures

0 references

Q4198056

0 references

Q4142699

0 references

Q3935355

0 references

Scheduling periodically occurring tasks on multiple processors

0 references

A new algorithm for scheduling periodic, real-time tasks

0 references

A note on preemptive scheduling of periodic, real-time tasks

0 references

On the complexity of fixed-priority scheduling of periodic, real-time tasks

0 references

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:688715

@@ Property / reviewed by @@
-Hans Daduna
@@ Property / reviewed by: Hans Daduna / rank @@
-Normal rank
@@ Property / reviewed by @@
+Hans Daduna
@@ Property / reviewed by: Hans Daduna / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(93)90360-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2009415693
@@ Property / OpenAlex ID: W2009415693 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4142699
@@ Property / cites work: Q4142699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3935355
@@ Property / cites work: Q3935355 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling periodically occurring tasks on multiple processors
+Normal rank
@@ Property / cites work @@
+A new algorithm for scheduling periodic, real-time tasks
+Normal rank
@@ Property / cites work @@
+A note on preemptive scheduling of periodic, real-time tasks
+Normal rank
@@ Property / cites work @@
+On the complexity of fixed-priority scheduling of periodic, real-time tasks
+Normal rank
@@ Property / cites work @@
+Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
+Normal rank