Scheduling Independent Multiprocessor Tasks on a Uniform k-Processor System
暂无分享,去创建一个
[1] Jacek Blazewicz,et al. Scheduling Multiprocessor Tasks to Minimize Schedule Length , 1986, IEEE Transactions on Computers.
[2] Krithi Ramamritham,et al. Hard Real-Time Systems , 1988 .
[3] Edward G. Coffman,et al. Computer and job-shop scheduling theory , 1976 .
[4] Ten-Hwang Lai,et al. Preemptive Scheduling of Independent Jobs on a Hypercube , 1988, Inf. Process. Lett..
[5] Günter Schmidt,et al. Scheduling on semi-identical processors , 1984, Z. Oper. Research.
[6] Joseph Y.-T. Leung,et al. Complexity of Scheduling Parallel Task Systems , 1989, SIAM J. Discret. Math..
[7] Daniel P. Siewiorek,et al. Parallel processing: the Cm* experience , 1986 .
[8] E. L. Lawler,et al. Recent Results in the Theory of Machine Scheduling , 1982, ISMP.
[9] Charles L. Seitz,et al. The cosmic cube , 1985, CACM.
[10] M. Dal Cin,et al. On the diagnosability of self-testing multi-microprocessor systems☆ , 1981 .
[11] A. Avizienis,et al. Fault-tolerance: The survival attribute of digital systems , 1978, Proceedings of the IEEE.
[12] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.
[13] Edward M. Reingold,et al. Scheduling on a Hypercube , 1991, Inf. Process. Lett..
[14] Jacek Blazewicz,et al. Scheduling in Computer and Manufacturing Systems , 1990 .