Preemptive Scheduling of Uniform Processor Systems
From MaRDI portal
Recommendations
Cited in
(90)- Preemptive online scheduling: Optimal algorithms for all speeds
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- Optimal and online preemptive scheduling on uniformly related machines
- Scheduling subject to resource constraints: Classification and complexity
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Scheduling uniform machines on-line requires nondecreasing speed ratios
- Preemptive on-line scheduling for two uniform processors
- An optimal scheduling algorithm for preemptable real-time tasks
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- 1-optimality of static BSP computations: Scheduling independent chains as a case study.
- On-line scheduling with precedence constraints
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Scheduling on power-heterogeneous processors
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- An algorithm for constructing single processor static-dynamic schedules
- Scheduling in multiprocessor systems with additional restrictions
- Scheduling chains on uniform processors with communication delays
- Little-preemptive scheduling on unrelated processors
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- The battery switching station scheduling problem
- A lower bound for on-line scheduling on uniformly related machines
- Algorithms with limited number of preemptions for scheduling on parallel machines
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- The bike sharing problem
- A unified view of parallel machine scheduling with interdependent processing rates
- Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals
- Single parameter analysis of power of preemption on two and three uniform machines
- A survey of scheduling with controllable processing times
- Separating online scheduling algorithms with the relative worst order ratio
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
- Schedules with a single preemption on uniform parallel machines
- The benefit of preemption with respect to the \(\ell_p\) norm
- Heuristics and augmented neural networks for task scheduling with non-identical machines
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
- Optimal preemptive scheduling for general target functions
- Preemptive machine covering on parallel machines
- Planning computations in a multiprocessor system with unfixed parameters
- Power of preemption for minimizing total completion time on uniform parallel machines
- Job Tardiness in Unequal Parallel Processor Systems
- The open shop scheduling problem
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
- Scheduling on semi-identical processors
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS ON TWO UNIFORM MACHINES
- Integrality Property in Preemptive Parallel Machine Scheduling
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
- A Generalized Uniform Processor System
- Optimal Preemptive Scheduling of Two Unrelated Processors
- On the Complexity of Scheduling to Optimize Average Response Time
- Parallel machine covering with limited number of preemptions
- Robust algorithms for preemptive scheduling
- scientific article; zbMATH DE number 2086672 (Why is no real title available?)
- scientific article; zbMATH DE number 6157244 (Why is no real title available?)
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource
- Computation planning in multiprocessor real time automated control systems with an additional resource
- Improved revenue bounds for posted-price and second-price mechanisms
- Approximation schemes for scheduling jobs with chain precedence constraints
- Semi-online preemptive scheduling: one algorithm for all variants
- Preemptive Scheduling on Selfish Machines
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Minimizing mean weighted execution time loss on identical and uniform processors
- From non-preemptive to preemptive scheduling using synchronization synthesis
- New applications of the Muntz and Coffman algorithm
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Preemptive multiprocessor scheduling with rejection
- On the complexity of scheduling unrelated parallel machines with limited preemptions
- Real-time uniprocessor scheduling with fewer preemptions
- The power of proportional fairness for nonclairvoyant polytope scheduling
- Fifty years of research in scheduling -- theory and applications
- Notes on scheduling non-simultaneously released jobs with restricted processing times on uniform machines
- Scheduling electric vehicle regular charging tasks: a review of deterministic models
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
- Scheduling independent two processor tasks on a uniform duo-processor system
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines
- Optimal preemptive semi-online scheduling on two uniform processors
- Some algorithms for resource allocation in multiprocessor systems
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling
This page was built for publication: Preemptive Scheduling of Uniform Processor Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4139680)
