Scheduling expressions on a pipelined processor with a maximal delay of one cycle
ACM Transactions on Programming Languages and Systems (TOPLAS)
Optimization, approximation, and complexity classes
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The complexity of scheduling trees with communication delays
Journal of Algorithms
Scheduling UET-UCT series-parallel graphs on two processors
Theoretical Computer Science
Scheduling In and Out Forests in the Presence of Communication Delays
IEEE Transactions on Parallel and Distributed Systems
Single machine scheduling subject to precedence delays
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling for hardware-software partitioning in embedded system design
Scheduling for hardware-software partitioning in embedded system design
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
Automation and Remote Control
Preemptive scheduling of independent jobs on identical parallel machines subject to migration delays
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay
Operations Research Letters
A general constraint-centric scheduling framework for spatial architectures
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
Hi-index | 0.00 |
We consider the problem of scheduling unit-length jobs on identical parallel machines such that the makespan of the resulting schedule is minimized. Precedence constraints impose a partial order on the jobs, and both communication and precedence delays impose relative timing constraints on dependent jobs. The combination of these two types of timing constraints naturally models the instruction scheduling problem that occurs during software compilation for state-of-the-art VLIW (Very Long Instruction Word) processors and multiprocessor parallel machines.We present the first known polynomial-time algorithm for the case where the precedence constraint graph is a forest of in-trees (or a forest of out-trees), the number of machines m is fixed, and the delays (which are a function of both the job pair and the machines on which they run) are bounded by a constant D.Our algorithm relies on a new structural theorem for scheduling jobs with arbitrary precedence constraints. Given an instance with many independent dags, the theorem shows how to convert, in linear time, a schedule S for only the largest dags into a complete schedule that is either optimal or has the same makespan as S.