On the optimal blocking factor for blocked, non-overlapped multiprocessor schedules
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1052-1057
- https://doi.org/10.1109/acssc.1994.471620
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the optimal blocking factor for blocked, non-overlapped multiprocessor schedulesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Statically sceduling communication resources in multiprocessor DSP architecturesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Data-flow transformations for critical path time reduction in high-level DSP synthesisIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Static rate-optimal scheduling of iterative data-flow programs via optimum unfoldingIEEE Transactions on Computers, 1991
- Scheduling Precedence Graphs in Systems with Interprocessor Communication TimesSIAM Journal on Computing, 1989
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor SystemsIEEE Transactions on Computers, 1975
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961