Author image not provided
 Maxim Shawabkeh

Authors:
Add personal information
 
Bibliometrics: publication history
Average citations per article7.00
Citation Count7
Publication count1
Publication years2013-2013
Available for download1
Average downloads per article377.00
Downloads (cumulative)377
Downloads (12 Months)21
Downloads (6 Weeks)2
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


1 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 1 of 1
Sort by:

1 published by ACM
September 2013 ACM Transactions on Architecture and Code Optimization (TACO): Volume 10 Issue 3, September 2013
Publisher: ACM
Bibliometrics:
Citation Count: 7
Downloads (6 Weeks): 2,   Downloads (12 Months): 21,   Downloads (Overall): 377

Full text available: PDFPDF
Balancing Instruction-Level Parallelism (ILP) and register pressure during preallocation instruction scheduling is a fundamentally important problem in code generation and optimization. The problem is known to be NP-complete. Many heuristic techniques have been proposed to solve this problem. However, due to the inherently conflicting requirements of maximizing ILP and minimizing ...
Keywords: Compiler optimizations, NP-complete problems, instruction-level parallelism (ILP), register pressure reduction, branch-and-bound enumeration, performance optimization, optimal instruction scheduling



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