Dual-issue scheduling with spills for binary trees

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Dual-issue scheduling with spills for binary trees

Full text

Pdf (972 KB)

Source

Symposium on Discrete Algorithms archive
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms table of contents

Baltimore, Maryland, United States

Pages: 678 - 686

Year of Publication: 1999

ISBN:0-89871-434-6

Authors

Waleed M. Meleis	Department of Electrical and Computer Engineering, Northeastern University, Boston, MA
Edward S. Davidson	Department of Electrical Engineering and Computer Science, Ann Arbor, MI

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIAM : Society for Industrial and Applied Mathematics

Publisher

Society for Industrial and Applied Mathematics Philadelphia, PA, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 17, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	A. V. Aho , S. C. Johnson, Optimal Code Generation for Expression Trees, Journal of the ACM (JACM), v.23 n.3, p.488-501, July 1976 [doi>10.1145/321958.321970]
	2	D. Bernstein , J. M. Jaffe , M. Rodeh, Scheduling arithmetic and load operations in parallel with no spilling, SIAM Journal on Computing, v.18 n.6, p.1098-1127, Dec. 1989 [doi>10.1137/0218074]
	3	David Bernstein , Michael Rodeh , Izidor Gertner, On the Complexity of Scheduling Problems for Parallel/Pipelined Machines, IEEE Transactions on Computers, v.38 n.9, p.1308-1313, September 1989 [doi>10.1109/12.29469]
	4	Pradip Bose, Optimal code generation for expressions on super scalar machines, Proceedings of 1986 ACM Fall joint computer conference, p.372-379, November 1986, Dallas, Texas, United States
	5	John Bruno , Ravi Sethi, Code Generation for a One-Register Machine, Journal of the ACM (JACM), v.23 n.3, p.502-510, July 1976 [doi>10.1145/321958.321971]
	6	M. CARLISLE, On local register allocation, Thesis, Computer Science Department, University of Delaware, 1991.
	7	T. H. COB.MEN, C. E. LEISERSON, AND l:#. L. I#XVEST, Introduction to Algorithms, MIT Press, 1991.
	8	Martin Farach , Vincenzo Liberatore, On local register allocation, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.564-573, January 25-27, 1998, San Francisco, California, United States
	9	L. P. Horwitz , R. M. Karp , R. E. Miller , S. Winograd, Index Register Allocation, Journal of the ACM (JACM), v.13 n.1, p.43-61, Jan. 1966 [doi>10.1145/321312.321317]
	10	Wei-Chung Hsu , Charles N. Fisher , James R. Goodman, On the Minimization of Loads/Stores in Local Register Allocation, IEEE Transactions on Software Engineering, v.15 n.10, p.1252-1260, October 1989 [doi>10.1109/TSE.1989.559775]
	11	Ikuo Nakata, On compiling algorithms for arithmetic expressions, Communications of the ACM, v.10 n.8, p.492-494, Aug. 1967 [doi>10.1145/363534.363549]
	12	R. R. Redziejowski, On arithmetic expressions and trees, Communications of the ACM, v.12 n.2, p.81-84, Feb. 1969 [doi>10.1145/362848.362859]
	13	R. SETHI, Complete register allocation problems, SIAM journal on Computing, 4 (1975), pp. 226-248.
	14	Ravi Sethi , J. D. Ullman, The Generation of Optimal Code for Arithmetic Expressions, Journal of the ACM (JACM), v.17 n.4, p.715-728, Oct. 1970 [doi>10.1145/321607.321620]
	15	J. D. ULLMAN, NP-complete scheduling problems, journal of Computing Systems and Sciences, 10 (1975), pp. 384-393.