Scheduling independent 2-processor tasks to minimize schedule length

DOI10.1016/0020-0190(84)90006-1MaRDI QIDQ796987zbMATH OpenOpenAlexDBLPWikidataFDO

Authors M. Drabowski, Jacek Blazewicz, Jan Węglarz

Publication date 1984

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(84)90006-1

zbMATH Keywords

polynomial-time algorithmdeterministic schedulingidentical processorsmultiprocessor tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling independent multiprocessor tasks
• Scheduling independent multiprocessor tasks
• Scheduling independent two processor tasks on a uniform duo-processor system
• Publication:4221077

Cites work

• scientific article; zbMATH DE number 3744543 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Characterization of Connection Assignment of Diagnosable Systems
• Optimization of Reduced Dependencies for Synchronous Sequential Machines

Cited in

(14)

• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Scheduling multiprocessor tasks -- An overview
• Scheduling multiprocessor tasks with chain constraints
• Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
• Two processor scheduling with limited preemption
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• scientific article; zbMATH DE number 3883925 (Why is no real title available?)
• scientific article; zbMATH DE number 4089308 (Why is no real title available?)
• Scheduling independent two processor tasks on a uniform duo-processor system
• Two-way dominant sequence clustering for processor scheduling
• Linear and quadratic algorithms for scheduling chains and opposite chains
• Scheduling of resource tasks
• Scheduling chained multiprocessor tasks onto large multiprocessor system
• The complexity of scheduling independent two-processor tasks on dedicated processors

This page was built for publication: Scheduling independent 2-processor tasks to minimize schedule length

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