Extra processors versus future information in optimal deadline scheduling

DOI10.1007/S00224-004-1116-ZzbMATH Open1093.68551DBLPjournals/mst/KooLNT04OpenAlexW2047217169WikidataQ58063022 ScholiaQ58063022MaRDI QIDQ706313FDOQ706313

Authors: Chiu-Yuen Koo, Tak-Wah Lam, Tsuen-Wan Johnny Ngan, Kar-Keung To 

Publication date: 8 February 2005

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10722/48427

Recommendations

• Competitive deadline scheduling via additional or faster processors
• scientific article; zbMATH DE number 1305455
• Deadline scheduling of multiprocessor tasks
• Scheduling tasks on two processors with deadlines and additional resources
• New bounds on time and number of processors for multiprocessor optimal schedules
• Parallel processor scheduling with delay constraints
• Optimal Preemptive Scheduling of Two Unrelated Processors
• scientific article; zbMATH DE number 3902030
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (1)

• A tighter extra-resource analysis of online deadline scheduling

Uses Software

• MOCA

This page was built for publication: Extra processors versus future information in optimal deadline scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706313)