
- 1 K. Gharachorloo, A. Gupta, and J. Hennessy, "Hiding Memory Latency using Dynamic Scheduling in Shared-Memory Multiprocessors ," Proceedings of the 19ih International Symposium on Computer Architecture, (May 1992), pp.22-33. Google Scholar
Digital Library
- 2 M. Butler, T. Yeh, Y. Putt, M. Alsup, M. Shebanow, and H. Scales, "Single Instruction Stream Parallelism Is Greater than Two," Proceedings of the 18th International Symposium on Computer Architecture, (May 1991), pp.276-286. Google Scholar
Digital Library
- 3 D. Wall, "Limits of Instruction-Level Parallelism," Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, (April 1991), pp. 176-188. Google Scholar
Digital Library
- 4 Y.N. Putt, W. Itwu, and M. Shebanow, "HPS, A New Microarchitecture' Rationale and introduction,'' Proceedings of the 18th Annual Workshop on Microprogramming,(December 1985), pp.103-108. Google Scholar
Digital Library
- 5 Y.N. Putt, W. Hwu, M. Shebanow, and Steve Melvin, "Critical Issues Regarding HPS, A High Performance Microarchitecture," Proceedings of the 18th Annual Workshop on Microprogramming,(December 1985), pp.109-116. Google Scholar
Digital Library
- 6 W. Hwu and Y.N. Putt, "HPSm, a High Performance Restricted Data Flow Architecture Having Minimal Functionality," Proceedings of the 13th Annunal Symposium on Computer Architecture, (June 1986), pp.297-307. Google Scholar
Digital Library
- 7 W.W. tIwu and Y.N. Part, "Checkpoint Repair for Out-of-order Execution Machines," IEEE Transactions on Computers, (December 1987), pp.1496- 1514. Google Scholar
Digital Library
- 8 R.M. Tomasulo, "An Efficient Algorithm for Exploiting Multiple Arithmetic Units," iBM Journal, Vol. 11, (January 1967), pp. 25-33.Google Scholar
- 9 J. Mogul, and A. Borg, "The Effect of Context Switches on Cache Performance," Proceedings of the Fourth International Conference on Architectural Support for Programming Languages and Operating Systems, (April 1991), pp.75-84. Google Scholar
Digital Library
- 10 Tse-Yu Yeh and Y.N. Putt, "Two-Level Adaptive Branch Prediction," Technical Report CSE-TR- 117-91, Electrical Engineering and Computer Science department, University of Michigan, (November 1991).Google Scholar
Digital Library
- 11 S. Leffier, M. McKusick, M. Karels, and J. Quarterman, "The Design and Implementation of the ~.3BSD Unix Operating Systems," Addison- Wesley, 1989. Google Scholar
Digital Library
Index Terms
An investigation of the performance of various dynamic scheduling techniques
Recommendations
Scheduling Multiprocessor Tasks to Minimize Schedule Length
The problem considered in this paper is the deterministic scheduling of tasks on a set of identical processors. However, the model presented differs from the classical one by the requirement that certain tasks need more than one processor at a time for ...
Schedule—constrained job scheduling in a multiprogrammed computer system
WSC '74: Proceedings of the 7th conference on Winter simulation - Volume 2The schedule-constrained job scheduling problem is defined as the problem of deciding what jobs should co-exist in the memory of a multiprogrammed computer to insure satisfactory schedule performance and adequate resource utilization. At the present ...
Task network-based project dynamic scheduling and schedule coordination
The resource-constrained project scheduling problem (RCPSP) is an extensively explored area. The existing RCPSP solutions tend to focus on single project scheduling problems without practical supports to address complex constraints, dynamic environments,...






Comments