Scheduling multiprocessor tasks on two parallel processors
From MaRDI portal
Publication:3148375
DOI10.1051/ro:2002004zbMath1024.68007OpenAlexW2171023928WikidataQ57387822 ScholiaQ57387822MaRDI QIDQ3148375
Paolo Dell'Olmo, Jacek Błażewicz, Maciej Drozdowski
Publication date: 30 September 2002
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=RO_2002__36_1_37_0
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items
Cites Work
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- Multiprocessor scheduling with communication delays
- The complexity of scheduling independent two-processor tasks on dedicated processors
- Scheduling multiprocessor tasks -- An overview
- Scheduling multiprocessor tasks with chain constraints
- Corrigendum to: ``Scheduling multiprocessor tasks on three dedicated processors
- Complexity of scheduling multiprocessor tasks with prespecified processors allocations
- 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
- Shop scheduling problems with multiprocessor tasks on dedicated processors
- Optimal scheduling for two-processor systems
- Scheduling with Deadlines and Loss Functions
- Scheduling File Transfers
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Complexity of Scheduling Parallel Task Systems
- Concurrent Task Systems
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
