Optimal scheduling for two-processor systems
From MaRDI portal
Cites work
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Erratum “Optimal Sequencing of Two Equivalent Processors”
- Flow Networks and Combinatorial Operations Research
- Optimal Preemptive Scheduling on Two-Processor Systems
- Optimal Sequencing of Two Equivalent Processors
- Paths, Trees, and Flowers
Cited in
(only showing first 100 items - show all)- On scheduling with the non-idling constraint
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Speeding-up parallel computation of large smooth-degree isogeny using precedence-constrained scheduling
- Scheduling chained multiprocessor tasks onto large multiprocessor system
- Open shop problems with unit time operations
- A standard task graph set for fair evaluation of multiprocessor scheduling algorithms
- A note on optimal scheduling for two-processor systems
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Scheduling trees with large communication delays on two identical processors
- Performance of critical path type algorithms for scheduling on parallel processors
- Scheduling of resource tasks
- Efficient maximum matching algorithms for trapezoid graphs
- Parallel Machine Scheduling with Uncertain Communication Delays
- Optimal scheduling on parallel machines for a new order class
- Precedence constrained scheduling in \((2-\frac{7}{3p+1})\) optimal
- List schedules for cyclic scheduling
- Sublinear time approximation schemes for makespan minimization on parallel machines
- Optimal scheduling of homogeneous job systems
- A graph model for scheduling processes in systems with parallel computations
- A note on optimal preemptive scheduling for two-processor systems
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- Optimal scheduling of unit-time tasks on two uniform processors under tree-like precedence constraints
- A flow formulation for horizontal coordinate assignment with prescribed width
- Planar stage graphs: Characterizations and applications
- Parallel maximum matching algorithms in interval graphs
- Methods for task allocation via agent coalition formation
- Width-restricted layering of acyclic digraphs with consideration of dummy nodes
- Scheduling multiprocessor tasks on two parallel processors
- Scheduling loosely connected task graphs.
- Computing the bump number with techniques from two-processor scheduling
- A simpler QPTAS for scheduling jobs with precedence constraints
- Non-preemptive profile scheduling and quasi-interval orders
- Bounds on list scheduling of UET tasks with restricted resource constraints
- A new polynomial algorithm for a parallel identical scheduling problem
- Benchmark-problem instances for static scheduling of task graphs with communication delays on homogeneous multiprocessor systems
- Scheduling tasks with communication delays on parallel processors
- Online scheduling of equal-processing-time task systems
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- Timing analysis of the flexRay communication protocol
- Controlling the data space of tree structured computations
- Scheduling tree-structured tasks with restricted execution times
- Generating and characterizing the perfect elimination orderings of a chordal graph
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints
- A note on scheduling multiprocessor tasks with precedence constraints on parallel processors
- Drawing Graphs with GLEE
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Scheduling Tree-Structured Tasks on Two Processors to Minimize Schedule Length
- AN EFFECTIVE APPROACH FOR DISTRIBUTED PROGRAM ALLOCATION
- A PARALLEL SCHEDULING ALGORITHM FOR PARALLEL APPLICATIONS
- ON OPTIMAL LOOP UNROLLING IN TWO-PROCESSOR SCHEDULING
- Bounds on the performance of a heuristic to schedule precedence-related jobs on parallel machines
- Performance of Coffman-Graham schedules in the presence of unit communication delays
- A state-of-the-art review of parallel-machine scheduling research
- Scheduling Opposing Forests
- A two-stage hardware scheduler combining greedy and optimal scheduling
- Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan
- Worst-case analysis of heuristics for the local microcode optimization problem
- Compact layered drawings of general directed graphs
- scientific article; zbMATH DE number 3970497 (Why is no real title available?)
- A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders
- Lower bounds on precedence-constrained scheduling for parallel processors.
- Ideal schedules in parallel machine settings
- Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard
- Scheduling two-machine no-wait open shops to minimize makespan
- On the Scalability of Constraint Solving for Static/Off-Line Real-Time Scheduling
- Cooperativead hoccomputing: towards enabling cooperative processing in wireless environments
- Processor bounding for an efficient non-preemptive task scheduling algorithm
- A flow formulation for horizontal coordinate assignment with prescribed width
- Minimizing total completion time for UET tasks with release time and outtree precedence constraints
- Applications of scheduling theory to formal language theory
- Coffman-Graham scheduling of UET task systems with 0-1 resources
- Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
- Scheduling multiprocessor tasks with chain constraints
- Inhomogeneous graph sorting and job distribution between two processors
- New applications of the Muntz and Coffman algorithm
- Optimal multiprocessor task scheduling using dominance and equivalence relations
- Optimal shooting: Characterizations and applications
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Scheduling independent two processor tasks on a uniform duo-processor system
- Single machine scheduling subject to precedence delays
- Static scheduling of directed acyclic data flow graphs onto multiprocessors using particle swarm optimization
- Profile Scheduling of Opposing Forests and Level Orders
- An efficient deterministic parallel algorithm for two processors precedence constraint scheduling
- Algorithms for dynamic scheduling of unit execution time tasks
- An efficient algorithm for finding ideal schedules
- Complexity results for scheduling chains on a single machine
- Graph layering by promotion of nodes
- PARAdeg-processor scheduling for acyclic SWITCH-less program nets
- NP-complete scheduling problems
- Benchmarking the clustering algorithms for multiprocessor environments using dynamic priority of modules
- SCHEDULING INTERVAL ORDERS IN PARALLEL
- Multi-processor scheduling and expanders
- Streaming algorithms for scheduling jobs with priorities
- Task splitting for three machine preemptive scheduling
- Antwortzeitgesteuerte Prozessorzuteilung unter strengen Zeitbedingungen
- UET scheduling with unit interprocessor communication delays
- Polyhedral results for position-based scheduling of chains on a single machine
- The complexity of a cyclic scheduling problem with identical machines and precedence constraints
This page was built for publication: Optimal scheduling for two-processor systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2556224)
