The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Complete register allocation problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Proof of the 4/3 conjecture for preemptive vs. nonpreemptive two-processor scheduling
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Analyzing Hard-Real-Time Programs for Guaranteed Schedulability
IEEE Transactions on Software Engineering
Extending microcode compaction for real architectures
MICRO 20 Proceedings of the 20th annual workshop on Microprogramming
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Analysis of Several Task-Scheduling Algorithms for a Model of Multiprogramming Computer Systems
Journal of the ACM (JACM)
Exact and Approximate Algorithms for Scheduling Nonidentical Processors
Journal of the ACM (JACM)
A Study of Schedules as Models of Synchronous Parallel Computation
Journal of the ACM (JACM)
Scheduling Distributed Real-Time Tasks with Minimum Jitter
IEEE Transactions on Computers
ACM Computing Surveys (CSUR)
Deterministic Processor Scheduling
ACM Computing Surveys (CSUR)
Local Microcode Compaction Techniques
ACM Computing Surveys (CSUR)
Efficient Scheduling Algorithms for Real-Time Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Heuristics for the global optimization of microprograms
MICRO 13 Proceedings of the 13th annual workshop on Microprogramming
On isomorphisms and density of NP and other complete sets
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Analysis of a level algorithm for preemptive scheduling
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Scheduling of tasks for distributed processors
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
A survey of resource allocation methods in optimizing microcode compilers
MICRO 17 Proceedings of the 17th annual workshop on Microprogramming
Scheduling independent processors with different storage capacities
ACM '74 Proceedings of the 1974 annual conference - Volume 1
A Method for Real-Time Scheduling Problems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Polynomially Complete Fault Detection Problems
IEEE Transactions on Computers
A Statistical Study of the Performance of a Task Scheduling Algorithm
IEEE Transactions on Computers
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
IEEE Transactions on Computers
Efficient scheduling to minimize calibrations
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.01 |
We show that the problem of finding an optimal schedule for a set of jobs is polynomial complete even in the following two restricted cases. (1) All jobs require one time unit. (2) All jobs require one or two time units, and there are only two processors. As a consequence, the general preemptive scheduling problem is also polynomial complete. These results are tantamount to showing that the scheduling problems mentioned are intractable.