scientific article; zbMATH DE number 1445347

MaRDI QIDQ4952665zbMATH OpenFDO

Authors

Publication date 12 March 2001

zbMATH Keywords

scheduling parallel machines online

Mathematics Subject Classification ID

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

Recommendations

• Average stretch without migration
• Online Scheduling to Minimize Average Stretch
• Approximation algorithms for average stretch scheduling
• scientific article; zbMATH DE number 2119737
• Improved lower bounds for online scheduling to minimize total stretch

Cited in

(12)

• Non-clairvoyant scheduling for weighted flow time
• Online real-time preemptive scheduling of jobs with deadlines on multiple machines
• Improved lower bounds for online scheduling to minimize total stretch
• Average stretch without migration
• Approximation algorithms for average stretch scheduling
• Greedy multiprocessor server scheduling
• New resource augmentation analysis of the total stretch of srpt and SJF in multiprocessor scheduling
• Online non-preemptive scheduling to optimize max stretch on a single machine
• scientific article; zbMATH DE number 1303566 (Why is no real title available?)
• Online Scheduling to Minimize Average Stretch
• O(1/) is the answer in online weighted throughput maximization
• Minimizing the stretch when scheduling flows of divisible requests

Describes a project that uses

Uses Software

• MOCA

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 Q4952665)