Optimal trace scheduling using enumeration

doi:10.1145/1498690.1498694

Optimal trace scheduling using enumeration

Full Text:

Pdf

Buy this Article

Authors:	Ghassan Shobaki	University of California, Davis and Sun Microsystems
	Kent Wilken	University of California, Davis
	Mark Heffernan	University of California, Davis

Published in:

	· Journal
	ACM Transactions on Architecture and Code Optimization (TACO) TACO Homepage archive
	Volume 5 Issue 4, March 2009 ACM New York, NY, USA table of contents doi>10.1145/1498690.1498694

	2009 Article Research Refereed
Bibliometrics
· Downloads (6 Weeks): 3 · Downloads (12 Months): 82 · Citation Count: 0

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Tags: algorithms branch-and-bound enumeration code generation combinatorial algorithms compiler optimizations compilers design experimentation global instruction scheduling instruction scheduling instruction-level parallelism languages optimal instruction scheduling optimization performance sequencing and scheduling trace scheduling

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player