Partitioned EDF scheduling on a few types of unrelated multiprocessors

DOI10.1007/s11241-012-9164-yzbMath1291.68098OpenAlexW2074254606MaRDI QIDQ2251370

Andreas Wiese, Vincenzo Bonifaci, Sanjoy K. Baruah

Publication date: 14 July 2014

Published in: Real-Time Systems (Search for Journal in Brave)

Full work available at URL: https://cdr.lib.unc.edu/downloads/3n204696c

zbMATH Keywords

multiprocessor schedulingpolynomial-time approximation schemeunrelated multiprocessors

Mathematics Subject Classification ID

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

Related Items (7)

ONLINE SCHEDULING OF MIXED CPU-GPU JOBS ⋮ A unified framework for designing EPTAS for load balancing on parallel machines ⋮ Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors ⋮ Real-time scheduling with resource sharing on heterogeneous multiprocessors ⋮ ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors ⋮ A PTAS for Scheduling Unrelated Machines of Few Different Types ⋮ An EPTAS for scheduling on unrelated machines of few different types

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Utilization bounds for EDF scheduling on real-time multiprocessor systems
• Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors
• The Design of Approximation Algorithms
• On the Configuration-LP for Scheduling on Unrelated Machines
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• On the complexity of integer programming
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines

This page was built for publication: Partitioned EDF scheduling on a few types of unrelated multiprocessors