Non-approximability of the bulk synchronous task scheduling problem

DOI10.1007/3-540-45706-2_29MaRDI QIDQ4813033zbMATH OpenFDO

Authors Noriyuki Fujimoto, Ken'ichi Hagihara

Publication date 12 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2400/24000225.htm

Mathematics Subject Classification ID

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

Recommendations

• Approximation algorithms for general parallel task scheduling
• An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
• Non-approximability results for scheduling problems with minsum criteria
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
• On the approximability of multiprocessor task scheduling problems

Cited in

(1)

• On message packaging in task scheduling for distributed memory parallel machines

This page was built for publication: Non-approximability of the bulk synchronous task scheduling problem

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