scientific article; zbMATH DE number 2185607

MaRDI QIDQ3024769zbMATH OpenFDO

Authors Lorant Porkolab, Klaus Jansen

Publication date 4 July 2005

Mathematics Subject Classification ID

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

Recommendations

• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
• Scheduling independent multiprocessor tasks
• Scheduling independent multiprocessor tasks
• scientific article; zbMATH DE number 1305441
• Approximation algorithms for general parallel task scheduling

Cited in

(28)

• A relation between multiprocessor scheduling and linear programming
• Optimal multiprocessor task scheduling using dominance and equivalence relations
• Multiprocessor scheduling with machine allotment and parallelism constraints
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• Real-time scheduling of linear speedup parallel tasks
• Approximation algorithms for general parallel task scheduling
• Parallel machine scheduling with speed-up resources
• The optimal control approach to generalized multiprocessor scheduling
• A polynomial time approximation scheme for general multiprocessor job scheduling
• A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
• A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks
• Lower bound algorithms for multiprocessor task scheduling with ready times
• Parallel approximation to high multiplicity scheduling problemsVIAsmooth multi-valued quadratic programming
• scientific article; zbMATH DE number 1271325 (Why is no real title available?)
• scientific article; zbMATH DE number 1979516 (Why is no real title available?)
• scientific article; zbMATH DE number 1979517 (Why is no real title available?)
• scientific article; zbMATH DE number 2080224 (Why is no real title available?)
• scientific article; zbMATH DE number 2080235 (Why is no real title available?)
• scientific article; zbMATH DE number 1759466 (Why is no real title available?)
• scientific article; zbMATH DE number 2174419 (Why is no real title available?)
• scientific article; zbMATH DE number 1929944 (Why is no real title available?)
• Polynomial time approximation schemes for general multiprocessor job shop scheduling
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
• Logic versus Approximation
• Scheduling independent multiprocessor tasks
• Linear algorithms for preemptive scheduling of multiprocessor tasks subject to minimal lateness
• Approximation algorithms for multiprocessor scheduling under uncertainty
• Scheduling independent multiprocessor tasks

This page was built for publication:

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