UET scheduling with unit interprocessor communication delays
Discrete Applied Mathematics
Two processor scheduling is in NC
SIAM Journal on Computing
The parallel complexity of scheduling with precedence constraints
Journal of Parallel and Distributed Computing
Relations between concurrent-write models of parallel computation
SIAM Journal on Computing
SIAM Journal on Computing
An optimal algorithm for scheduling interval ordered tasks with communication on N processors
Journal of Computer and System Sciences
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
Journal of the ACM (JACM)
An Almost-Linear Algorithm for Two-Processor Scheduling
Journal of the ACM (JACM)
Scheduling Interval Ordered Tasks in Parallel
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Scheduling Trees with Communication Delays (Extended Abstract)
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
| Hi-index | 0.00 |
We investigate the complexity of computing an optimal m-processor schedule for a system of n unit execution time tasks constrained by an interval order, subject to unit delays for interprocessor communication. Our results are twofold. First, we show that the problem can be solved by a sequential algorithm in linear time. Second, we present a fast parallel algorithm that solves the problem on the EREW PRAM in time O(log2 n) using n3/log n processors and on the CRCW PRAM in time O(log n) using n3 processors. This is the first NC algorithm for this problem.