Journal of the ACM (JACM)
Parallelism exposure and exploitation in programs
Parallelism exposure and exploitation in programs
The two-processor scheduling problem is in R-NC
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Scheduling Processes with Release Times, Deadlines, Precedence and Exclusion Relations
IEEE Transactions on Software Engineering
On satisfying timing constraints in hard-real-time systems
SIGSOFT '91 Proceedings of the conference on Software for citical systems
An Almost-Linear Algorithm for Two-Processor Scheduling
Journal of the ACM (JACM)
Optimal granularity of parallel evaluation of AND trees
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Scheduling time-constrained instructions on pipelined processors
ACM Transactions on Programming Languages and Systems (TOPLAS)
Two processor scheduling with real release times and deadlines
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Resource Reclaiming in Multiprocessor Real-Time Systems
IEEE Transactions on Parallel and Distributed Systems
On Satisfying Timing Constraints in Hard-Real-Time Systems
IEEE Transactions on Software Engineering
An Efficient Parallel Algorithm for Scheduling Interval Ordered Tasks
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Instruction Scheduling with Timing Constraints on a Single RISC Processor with 0/1 Latencies
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
An efficient parallel algorithm for scheduling interval ordered tasks
Journal of Complexity
Deterministic Scheduling with Pipelined Processors
IEEE Transactions on Computers
Precedence constrained scheduling in (2-73p+1)·optimal
Journal of Computer and System Sciences
Discrete optimization with polynomially detectable boundaries and restricted level sets
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
On the complexity of scheduling unit-time jobs with OR-precedence constraints
Operations Research Letters
Performance of critical path type algorithms for scheduling on parallel processors
Operations Research Letters
Discrete optimization with polynomially detectable boundaries and restricted level sets
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
Given a set @@@@ = {T1,T2,···,Tn} of tasks, with each Ti having execution time 1 and a deadline di 0, and a set of precedence constraints which restrict allowable schedules, the problem of determining whether there exists a schedule using two processors in which each task is completed before its deadline is examined. An efficient algorithm for finding such a schedule, whenever one exists, is given. The algorithm may also be used to find the shortest such schedule. In addition it is shown that the problem of finding a one-processor schedule which minimizes the number of tasks failing to meet their deadlines is NP-complete and, hence, is likely to be computationally intractable.