Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] C. V. Ramamoorthy,et al. System Modeling and Testing Procedures for Microdiagnostics , 1972, IEEE Transactions on Computers.
[3] Ellis Horowitz,et al. Combinatorial Problems: Reductibility and Approximation , 1978, Oper. Res..
[4] David S. Johnson,et al. `` Strong '' NP-Completeness Results: Motivation, Examples, and Implications , 1978, JACM.
[5] Hironori Kasahara,et al. Parallel Processing for Real-Time Control and Simulation of DCCS , 1982 .
[6] Ronald L. Graham,et al. Performance Guarantees for Scheduling Algorithms , 1978, Oper. Res..
[7] Kenneth Steiglitz,et al. Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F , 1975, JACM.
[8] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .
[9] Ronald L. Graham,et al. Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.
[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[11] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[12] Hironori Kasahara,et al. Load Distribution Among Real-Time Control Computers Connected Via Communication Media , 1984 .
[13] T. C. Hu. Parallel Sequencing and Assembly Line Problems , 1961 .
[14] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..
[15] Eduardo B. Fernández,et al. Bounds on the Number of Processors and Time for Multiprocessor Optimal Schedules , 1973, IEEE Transactions on Computers.
[16] C. V. Ramamoorthy,et al. Optimal Scheduling Strategies in a Multiprocessor System , 1972, IEEE Transactions on Computers.
[17] Kenneth Steiglitz,et al. Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems , 1974, JACM.
[18] Jan Karel Lenstra,et al. Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..
[19] K. Mani Chandy,et al. A comparison of list schedules for parallel processing systems , 1974, Commun. ACM.