A polynomial feasibility test for preemptive periodic scheduling of unrelated processors

✍ Scribed by Alan A. Bertossi; Maurizio A. Bonuccelli

• Publisher: Elsevier Science
• Year: 1985
• Tongue: English
• Weight: 346 KB
• Volume: 12
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/0166-218x(85)90024-1