Algorithms for dynamic scheduling of unit execution time tasks
From MaRDI portal
Publication:1869578
DOI10.1016/S0377-2217(02)00236-9zbMATH Open1012.90010MaRDI QIDQ1869578FDOQ1869578
Authors: Andrei Tchernykh, Klaus H. Ecker, Antonio Rodriguez-Diaz 
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- A new algorithm for scheduling periodic, real-time tasks
- scientific article; zbMATH DE number 4093160
- Scheduling with time-dependent execution times
- An algorithm for constructing single processor static-dynamic schedules
- Scheduling of coupled tasks with unit processing times
- A heuristic algorithm for dynamic task scheduling in highly parallel computing systems
- Scheduling unit-time jobs on processors with different capabilities
- Models and algorithms of time-dependent scheduling
Complexity and performance of numerical algorithms (65Y20) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling subject to resource constraints: Classification and complexity
- Title not available (Why is that?)
- Optimal scheduling for two-processor systems
- Scheduling Interval-Ordered Tasks
- Two-Processor Scheduling with Start-Times and Deadlines
- Scheduling of resource tasks
- Title not available (Why is that?)
- The MOSIX distributed operating system. Load balancing for UNIX
- Title not available (Why is that?)
- Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
- A New Insight into the Coffman–Graham Algorithm
Cited In (6)
- Min\_c: heterogeneous concentration policy for energy-aware scheduling of jobs with resource contention
- An algorithm for constructing single processor static-dynamic schedules
- An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines
- PHEFT: pessimistic image processing workflow scheduling for DSP clusters
- A dynamic scheduling algorithm for singe-arm two-cluster tools with flexible processing times
- A heuristic algorithm for dynamic task scheduling in highly parallel computing systems
This page was built for publication: Algorithms for dynamic scheduling of unit execution time tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869578)
