Approximating Real-Time Scheduling on Identical Machines

DOI10.1007/978-3-642-54423-1_48MaRDI QIDQ5405072zbMATH OpenOpenAlexFDO

Authors N. Bansal, C. Rutten, Suzanne Van der Ster, T. Vredeveld, Ruben van der Zwaan

Publication date 31 March 2014

Published in LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-54423-1_48

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Approximating the throughput of multiple machines in real-time scheduling
• Approximating the throughput of multiple machines under real-time scheduling
• Scheduling to approximate minimization objectives on identical machines
• Approximation schemes for scheduling on uniformly related and identical parallel machines
• Publication:4938775
• Interval scheduling on identical machines
• Scheduling on parallel identical machines to minimize total tardiness
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Approximation schemes for scheduling on parallel machines
• On-line approximation algorithms for scheduling tasks on identical machines with extendable working time

Cited in

(8)

• scientific article; zbMATH DE number 7561425 (Why is no real title available?)
• Interval scheduling on identical machines
• Approximating the throughput of multiple machines under real-time scheduling
• A PTAS for Static Priority Real-Time Scheduling with Resource Augmentation
• Resource augmentation for uniprocessor and multiprocessor partitioned scheduling of sporadic real-time tasks
• Assigning sporadic tasks to unrelated parallel machines
• Approximation algorithm for periodic real-time tasks with workload-dependent running-time functions
• A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks

This page was built for publication: Approximating Real-Time Scheduling on Identical Machines

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