论文信息 - Scheduling Multipipeline and Multiprocessor Computers - 字舞流文

Scheduling Multipipeline and Multiprocessor Computers

We develop good heuristics to schedule tasks on computers that have multiple pipelines or multiple asynchronous processors. We also consider the case when different pipes or processors run at different speeds.

[1] John L. Bruno,et al. Deterministic Scheduling with Pipelined Processors , 1980, IEEE Transactions on Computers.

[2] Charles Maretel. Scheduling Multiple Processors with Memory Constraints , 1982, IMACS World Congress.

[3] Robert McNaughton,et al. Scheduling with Deadlines and Loss Functions , 1959 .

[4] D. G. KAFURA,et al. Task Scheduling on a Multiprocessor System with Independent Memories , 1977, SIAM J. Comput..

[5] Kai Hwang,et al. Multiple pipeline scheduling in vector supercomputers , 1982, ICPP.

[6] John L. Bruno,et al. Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..

[7] Peter M. Kogge,et al. The Architecture of Pipelined Computers , 1981 .

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] Teofilo F. Gonzalez,et al. Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[10] Hon Fung Li. Scheduling Trees in Parallel/Pipelined Processing Environments , 1977, IEEE Transactions on Computers.

[11] Sartaj Sahni,et al. Preemptive Scheduling of Uniform Processors with Memory. , 1982 .