The buffer minimization problem for multiprocessor scheduling with conflicts

DOI10.1007/3-540-48224-5_70MaRDI QIDQ4535068zbMATH OpenFDO

Authors J. Noga, Jiří Sgall, Marek Chrobak, János Csirik, Csanád Imreh

Publication date 12 June 2002

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/2076/20760862

Mathematics Subject Classification ID

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

Recommendations

• Buffer minimization with conflicts on a line
• Scheduling with conflicts: Online and offline algorithms
• Online scheduling with a buffer on related machines
• Probabilistic analysis for scheduling with conflicts
• Online minimum makespan scheduling with a buffer

Cited in

(12)

• A buffer minimization problem for the design of embedded systems
• Bamboo garden trimming problem: priority schedulings
• Maximizing throughput in multi-queue switches
• Bamboo garden trimming problem (perpetual maintenance of machines with different attendance urgency factors)
• The Cinderella Game on Holes and Anti-holes
• A general buffer scheme for the windows scheduling problem
• Buffer minimization with conflicts on a line
• Buffer minimization with conflicts on a line
• Perpetual maintenance of machines with different urgency requirements
• Scheduling with machine conflicts
• Scheduling with conflicts: Online and offline algorithms
• The minimum backlog problem

This page was built for publication: The buffer minimization problem for multiprocessor scheduling with conflicts

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