Scheduling multiprocessor UET tasks of two sizes

DOI10.1016/j.tcs.2009.06.027zbMath1194.68086OpenAlexW2075753538MaRDI QIDQ1034607

Tamás Kis

Publication date: 6 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.06.027

zbMATH Keywords

matching theorynetwork matricesscheduling UET tasks

Mathematics Subject Classification ID

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

Related Items (1)

A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring

Cites Work

• Unnamed Item
• Unnamed Item
• Computational complexity of some scheduling problems with multiprocessor tasks
• Scheduling multiprocessor tasks -- An overview
• On maximizing the throughput of multiprocessor tasks.
• Scheduling UET task systems with concurrency on two parallel identical processors
• A note on scheduling tall/small multiprocessor tasks with unit processing time to minimize maximum tardiness
• Scheduling multiprocessor tasks on two parallel processors
• Maximal Flow Through a Network
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Concurrent Task Systems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: Scheduling multiprocessor UET tasks of two sizes