Pages that link to "Item:Q4139680"
From MaRDI portal
The following pages link to Preemptive Scheduling of Uniform Processor Systems (Q4139680):
Displaying 50 items.
- Planning computations in a multiprocessor system with unfixed parameters (Q290006) (← links)
- Parallel machine covering with limited number of preemptions (Q462268) (← links)
- Robust algorithms for preemptive scheduling (Q472464) (← links)
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource (Q499147) (← links)
- Computation planning in multiprocessor real time automated control systems with an additional resource (Q499572) (← links)
- Semi-online preemptive scheduling: one algorithm for all variants (Q537921) (← links)
- Optimal semi-online preemptive algorithms for machine covering on two uniform machines (Q557905) (← links)
- Minimizing mean weighted execution time loss on identical and uniform processors (Q581214) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Scheduling independent two processor tasks on a uniform duo-processor system (Q751995) (← links)
- Parametric analysis of the quality of single preemption schedules on three uniform parallel machines (Q829195) (← links)
- Optimal preemptive semi-online scheduling on two uniform processors (Q834944) (← links)
- Some algorithms for resource allocation in multiprocessor systems (Q845541) (← links)
- Optimal preemptive online algorithms for scheduling with known largest size on two uniform machines (Q856832) (← links)
- Balanced allocation mechanism: an optimal mechanism for multiple keywords sponsored search auctions (Q903629) (← links)
- Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling (Q940887) (← links)
- Preemptive online scheduling: Optimal algorithms for all speeds (Q1016520) (← links)
- Optimal and online preemptive scheduling on uniformly related machines (Q1041344) (← links)
- Scheduling subject to resource constraints: Classification and complexity (Q1052820) (← links)
- Preemptive scheduling of periodic jobs in uniform multiprocessor systems (Q1172385) (← links)
- Scheduling uniform machines on-line requires nondecreasing speed ratios (Q1290644) (← links)
- Preemptive on-line scheduling for two uniform processors (Q1306385) (← links)
- Scheduling multiprocessor tasks on parallel processors with limited availability. (Q1399581) (← links)
- 1-optimality of static BSP computations: Scheduling independent chains as a case study. (Q1401163) (← links)
- On-line scheduling with precedence constraints (Q1602711) (← links)
- An approximation algorithm for nonpreemptive scheduling on hypercube parallel task systems (Q1607020) (← links)
- Scheduling on power-heterogeneous processors (Q1680505) (← links)
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors (Q1706041) (← links)
- Combinatorial optimization algorithms combining greedy strategies with a limited search procedure (Q1745806) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- An algorithm for constructing single processor static-dynamic schedules (Q1789208) (← links)
- Scheduling in multiprocessor systems with additional restrictions (Q1795622) (← links)
- Scheduling chains on uniform processors with communication delays (Q1860371) (← links)
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times (Q1917233) (← links)
- The battery switching station scheduling problem (Q1939710) (← links)
- A lower bound for on-line scheduling on uniformly related machines (Q1970423) (← links)
- Algorithms with limited number of preemptions for scheduling on parallel machines (Q2015808) (← links)
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems (Q2017764) (← links)
- Robust algorithms for preemptive scheduling on uniform machines of non-increasing job sizes (Q2059895) (← links)
- Preemptive and non-preemptive scheduling on two unrelated parallel machines (Q2093189) (← links)
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost (Q2174270) (← links)
- The bike sharing problem (Q2232233) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals (Q2290480) (← links)
- Single parameter analysis of power of preemption on two and three uniform machines (Q2339808) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Separating online scheduling algorithms with the relative worst order ratio (Q2385472) (← links)
- Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times (Q2398640) (← links)
- Schedules with a single preemption on uniform parallel machines (Q2414478) (← links)
