New bounds on time and number of processors for multiprocessor optimal schedules

DOI10.1007/BF02900854zbMATH Open0919.68004OpenAlexW2086009270MaRDI QIDQ4229541FDOQ4229541

Authors: Hao Sun, Pu Liu, Jikai Li, Dechung Peng 

Publication date: 31 August 1999

Published in: Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02900854

Recommendations

• Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems
• scientific article; zbMATH DE number 2080870
• Optimal Scheduling of Tasks on Identical Parallel Processors
• scientific article; zbMATH DE number 3941253
• Scheduling Multiprocessor Tasks to Minimize Schedule Length

zbMATH Keywords

lower bound on the minimum time

Mathematics Subject Classification ID

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

Cites Work

• Optimal Scheduling Strategies in a Multiprocessor System

Cited In (8)

• ILP formulations for scheduling ordered tasks on a bounded number of processors
• Title not available (Why is that?)
• Extra processors versus future information in optimal deadline scheduling
• Improved lower bounds on time and processors for scheduling precedence graphs on multicomputer systems
• Tighter Bounds for the Multifit Processor Scheduling Algorithm
• Lower bound algorithms for multiprocessor task scheduling with ready times
• Title not available (Why is that?)
• Recent sojourn time results for multilevel processor‐sharing scheduling disciplines

This page was built for publication: New bounds on time and number of processors for multiprocessor optimal schedules

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