Legality and Other Properties of Graph Models of Computations
Journal of the ACM (JACM)
Bounds for Maxium Parallelism in a Bilogic Graph Model of Computations
IEEE Transactions on Computers
Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Optimal Scheduling Strategies in a Multiprocessor System
IEEE Transactions on Computers
Processor Scheduling for Linearly Connected Parallel Processors
IEEE Transactions on Computers
HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
A Register Allocation Technique Using Register Existence Graph
ICPP '97 Proceedings of the international Conference on Parallel Processing
A Spill Code Placement Framework for Code Scheduling
LCPC '98 Proceedings of the 11th International Workshop on Languages and Compilers for Parallel Computing
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Local and global microcode compaction using reduction operators
ACM SIGMICRO Newsletter
Real-time multimedia processing in video sensor networks
Image Communication
A Computation Model of Parallel Solution of Linear Equations
IEEE Transactions on Computers
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
IEEE Transactions on Computers
Scheduling Trees in Parallel/Pipelined Processing Environments
IEEE Transactions on Computers
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems
IEEE Transactions on Computers
Improving the computation of lower bounds for optimal schedules
IBM Journal of Research and Development
Scheduling as a graph transformation
IBM Journal of Research and Development
Computation of lower bounds for multiprocessor schedules
IBM Journal of Research and Development
Hi-index | 15.00 |
Two problems of importance for the scheduling of multiprocessing systems composed of identical units are discussed in this paper. 1) Given a partially ordered set of computations represented by the vertices of an acyclic directed graph with their associated execution times, find the minimum number of processors in order to execute them in a time not exceeding the length of the critical path of this graph. 2) Determine the minimum time to process this set of computations when a fixed number of processors is available. A unified formulation for lower bounds on the minimum number of processors and on time is presented. These lower bounds are sharper than previously known values and provide a general framework that gives insight for deriving simplified expressions. A new upper bound on the minimum number of processors is presented, which is sharper than the known bounds. The computational aspects of these bounds are also discussed.