Fully polynomial time approximation schemes for scheduling divisible loads

DOI10.1007/978-3-642-14403-5_1MaRDI QIDQ3583567zbMATH OpenOpenAlexFDO

Authors Joanna Berlińska

Publication date 17 August 2010

Published in Parallel Processing and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14403-5_1

zbMATH Keywords

divisible loadsFPTASscheduling

Mathematics Subject Classification ID

Distributed systems (68M14) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scheduling multiple divisible loads in homogeneous star systems
• Scheduling divisible loads with time and cost constraints
• Optimum divisible load scheduling on heterogeneous stars with limited memory
• scientific article; zbMATH DE number 5842467
• Executing divisible jobs on a network with a fixed number of processors. (Extended abstract)

Cited in

(1)

• scientific article; zbMATH DE number 5842467 (Why is no real title available?)

This page was built for publication: Fully polynomial time approximation schemes for scheduling divisible loads

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