Lower bounds and semi on-line multiprocessor scheduling

zbMATH Open1086.68516MaRDI QIDQ1884352FDOQ1884352

Authors: Hans Kellerer, V. M. Kotov, T. C. Edwin Cheng 

Publication date: 28 October 2004

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)

Recommendations

• Semi-on-line multiprocessor scheduling with given total processing time
• The on-line multiprocessor scheduling problem with known sum of the tasks
• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
• Semi on-line scheduling on three processors with known sum of the tasks
• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks

Mathematics Subject Classification ID

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

Cited In (8)

• An efficient algorithm for semi-online multiprocessor scheduling with given total processing time
• Semi-online scheduling revisited
• Semi-on-line multiprocessor scheduling with given total processing time
• A lower bound for randomized on-line multiprocessor scheduling
• The on-line multiprocessor scheduling problem with known sum of the tasks
• Semi-online multiprocessor scheduling with bounded jobs
• Lower bound algorithms for multiprocessor task scheduling with ready times
• Title not available (Why is that?)

This page was built for publication: Lower bounds and semi on-line multiprocessor scheduling

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