Preemptive Scheduling of Uniform Processor Systems
From MaRDI portal
Publication:4139680
DOI10.1145/322047.322055zbMATH Open0364.68046OpenAlexW2073821436MaRDI QIDQ4139680FDOQ4139680
Authors: Teofilo F. Gonzalez, Sartaj Sahni 
Publication date: 1978
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322047.322055
Recommendations
Cited In (85)
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- On the Complexity of Scheduling to Optimize Average Response Time
- Improved Revenue Bounds for Posted-Price and Second-Price Mechanisms
- New applications of the Muntz and Coffman algorithm
- An algorithm for constructing single processor static-dynamic schedules
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- The battery switching station scheduling problem
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times
- Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals
- The benefit of preemption with respect to the \(\ell_p\) norm
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Job Tardiness in Unequal Parallel Processor Systems
- Scheduling chains on uniform processors with communication delays
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
- Optimal Preemptive Scheduling of Two Unrelated Processors
- Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines
- Real-time uniprocessor scheduling with fewer preemptions
- Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines
- Semi-online preemptive scheduling: one algorithm for all variants
- A unified view of parallel machine scheduling with interdependent processing rates
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
- 1-optimality of static BSP computations: Scheduling independent chains as a case study.
- Optimal preemptive on-line scheduling on uniform processors with non-decreasing speed ratios
- Preemptive online scheduling: Optimal algorithms for all speeds
- Preemptive Scheduling of a Multiprocessor System with Memories to Minimize Maximum Lateness
- Scheduling on semi-identical processors
- Preemptive on-line scheduling for two uniform processors
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines
- Scheduling in multiprocessor systems with additional restrictions
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness
- Title not available (Why is that?)
- Planning computations in a multiprocessor system with unfixed parameters
- Approximation schemes for scheduling jobs with chain precedence constraints
- Little-preemptive scheduling on unrelated processors
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems
- Scheduling uniform machines on-line requires nondecreasing speed ratios
- Preemptive multiprocessor scheduling with rejection
- Minimizing mean weighted execution time loss on identical and uniform processors
- Computation planning in multiprocessor real time automated control systems with an additional resource
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Preemptive and non-preemptive scheduling on two unrelated parallel machines
- Scheduling subject to resource constraints: Classification and complexity
- A lower bound for on-line scheduling on uniformly related machines
- The bike sharing problem
- Some algorithms for resource allocation in multiprocessor systems
- Single parameter analysis of power of preemption on two and three uniform machines
- Optimal preemptive scheduling in multiprocessor systems with incomplete communication graph
- A Truthful Mechanism for Offline Ad Slot Scheduling
- Heuristics and augmented neural networks for task scheduling with non-identical machines
- Parallel machine covering with limited number of preemptions
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
- Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information
- A survey of scheduling with controllable processing times
- Robust algorithms for preemptive scheduling
- Scheduling independent two processor tasks on a uniform duo-processor system
- From non-preemptive to preemptive scheduling using synchronization synthesis
- Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling
- On the complexity of scheduling unrelated parallel machines with limited preemptions
- Scheduling on power-heterogeneous processors
- Schedules with a single preemption on uniform parallel machines
- OPTIMAL PREEMPTIVE SEMI-ONLINE ALGORITHM FOR SCHEDULING TIGHTLY-GROUPED JOBS 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
- Optimal and online preemptive scheduling on uniformly related machines
- Preemptive Scheduling to Minimize Maximum Completion Time on Uniform Processors with Memory Constraints
- Optimal preemptive semi-online scheduling on two uniform processors
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems
- Integrality Property in Preemptive Parallel Machine Scheduling
- Preemptive Scheduling on Selfish Machines
- On-line scheduling with precedence constraints
- A Generalized Uniform Processor System
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- Title not available (Why is that?)
- Algorithms with limited number of preemptions for scheduling on parallel machines
- Optimal preemptive scheduling for general target functions
- Separating online scheduling algorithms with the relative worst order ratio
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- The Open Shop Scheduling Problem
- Preemptive machine covering on parallel machines
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)
