Provably good multiprocessor scheduling with resource sharing

DOI10.1007/S11241-010-9105-6MaRDI QIDQ601053zbMATH OpenOpenAlexFDO

Authors Björn Andersson, Arvind Easwaran

Publication date 3 November 2010

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

Full work available at URL http://hdl.handle.net/10400.22/3850

zbMATH Keywords

competitive ratio for multiprocessor resource sharingmultiprocessor scheduling with resource sharing

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 4072695
• Approximation algorithms for scheduling on multi-core processor with shared speedup resources
• Real-time scheduling with resource sharing on heterogeneous multiprocessors
• Shared multi-processor scheduling
• scientific article; zbMATH DE number 2000819
• Shared processor scheduling of multiprocessor jobs
• scientific article; zbMATH DE number 1979517
• Scheduling shared continuous resources on many-cores
• Multiprocessor scheduling with machine allotment and parallelism constraints

Cites work

• scientific article; zbMATH DE number 1559529 (Why is no real title available?)
• Utilization bounds for EDF scheduling on real-time multiprocessor systems

Cited in

(2)

• Real-time scheduling with resource sharing on heterogeneous multiprocessors
• Proportional scheduling, split-proofness, and merge-proofness

This page was built for publication: Provably good multiprocessor scheduling with resource sharing

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