Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6466
Title: Disambiguation, Correctness and Flow-Analysis Issues for Trace Scheduling Compilers
Authors: Nicolau, Alexandru
Keywords: computer science
technical report
Issue Date: Aug-1984
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR84-627
Abstract: Trace scheduling is a global compaction technique for transforming sequential programs into parallel code. When this investigation began, trace scheduling was unimplemented and many serious questions of appropriateness and effectiveness needed to be solved. This paper addresses questions of its applicability to ordinary programming for Very Long Instruction Word machines. We developed practical methods of exploiting this parallelism (e.g. memory anti-aliasing). To justify and better understand the dynamic interaction between trace scheduling and anti-aliasing, we designed a more formal model in which we proved the correctness of trace scheduling and showed that it terminates. This in turn allowed us to analyze our flow information requirements. Finally we addressed the problem of ambiguous memory references which cannot be resolved at compile time.
URI: http://hdl.handle.net/1813/6466
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
84-627.pdf1.87 MBAdobe PDFView/Open
84-627.ps482.18 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us