Todd A. Proebsting
- BJR89.David Bernstein, Jeffrey M, Jaffe, and Michael Rodeh. Scheduling arithmetic a.nd loa, d operations in pa.rallel with no spilling. SIAM Journal on Oomputir~g, 18(6):1098- 1127, December 1989. Google Scholar
Digital Library
- BPR84.David Bernstein, Ron Y. Pinter, and Michael Rodeh. Optima.1 scheduling of arithmetic operations in parallel with memory access. In Proceedzngs of the l~th Annual Symposzum on Principles of Programruing Languages, pages 325-333, Ja.nua.ry 1984. Google Scholar
- Cof76.E.G. Coffman, Jr., editor. Computer aud Job-Shop Scheduling Theory. John \Viley and Sons, 1976.Google Scholar
- GJ79.M. P~. Garey and D. S. Johnson. Computers and Intractability: A Guzde to the Theory of NP-Compleieness. W. H. Freeman and Company, 1979. Google ScholarDigital Library
- GM86.Phillip B. Gibbons and Steven S. Muchnick. Efficient instruction scheduling for a pipelined architecture, in ProceedzT, gs of the $IGPLAN '86 Symposium on Compiler Construction, pages 11-16, 1986. Google Scholar
- HG82.John L. Hennessy and Thomas R. Gross. Code generation and reorganization in the presence of pipeline constraints. In Proceedings of the 9th Annual Symposium on Principles of Programming Languages, pages 120-127, 1982. Google ScholarDigital Library
- HG83.John L. Hennessy and Thomas R. Gross. Postpass code optimization of pipeline constraints. A CM Transactions on Programming Languages and Systems, 5(3):422- 448, July 1983. Google ScholarDigital Library
- Hu61.T.C. Hu. Parallel sequencing and assembly line problems. Operations Research, 9(6):841-848, 1961.Google ScholarDigital Library
- LLM+87.Eugene Lawler, Jan Karel Lenstra, Charles Martel, Barbara Simons, and Larry Stockmeyer. Pipeline scheduling' A survey. Computer science research report, IBM Research Division, 1987.Google Scholar
- PH90.David A. Patterson and John L. Hennessy. Computer Architecture: A Quantitative Approach. Morgan Kaufmann Publishers, Palo Alto, California, 1990. Google ScholarDigital Library
- PS90.Krishna Palem and Barbara Simons. Scheduling time-critical instructions on RiSC machines. In Proceedings of the 17ih Annual Symposium on Principles of Pro. gramming Languages, pages 270-280, 1990. Google ScholarDigital Library
- SU70.Ravi Sethi and J. D. Ullman. The generation of optimal code for arkhmetic expressions. Journal of the A CM, 17(4):715-728, October 1970. Google ScholarDigital Library
- War90.H.S. Warren, jr. Instruction scheduling for the IBM RISC system/6000 processor. iBM Journal of Research and Development, 34(1):85-92, 1990. Google ScholarDigital Library
Index Terms
- Linear-time, optimal code scheduling for delayed-load architectures
Recommendations
Sorting in Linear Time?
We show that a unit-cost RAM with a word length ofwbits can sortnintegers in the range 0 2w 1 inO(nloglogn) time for arbitraryw logn, a significant improvement over the bound ofO(nlogn) achieved by the fusion trees of Fredman and Willard. Provided thatw ...
Scheduling jobs under decreasing linear deterioration
This paper considers the scheduling problems under decreasing linear deterioration. Deterioration of a job means that its processing time is a function of its execution start time. Optimal algorithms are presented respectively for single machine ...
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06: Proceedings of the 27th IEEE International Real-Time Systems SymposiumWe present an optimal real-time scheduling algorithm for multiprocessors -- one that satisfies all task deadlines, when the total utilization demand does not exceed the utilization capacity of the processors. The algorithm called LLREF, is designed ...
Comments