Learning basic block scheduling heuristics from optimal data
Abstract
References
Index Terms
- Learning basic block scheduling heuristics from optimal data
Recommendations
Learning heuristics for basic block instruction scheduling
Instruction scheduling is an important step for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction scheduling is to find a minimum length schedule for a basic block--a straight-line sequence ...
Learning Heuristics for the Superblock Instruction Scheduling Problem
Modern processors have multiple pipelined functional units and can issue more than one instruction per clock cycle. This places a burden on the compiler to schedule the instructions to take maximum advantage of the underlying hardware. Superblocks—a ...
Efficient heuristics for the parallel blocking flow shop scheduling problem
New Constructive heuristic for both the PBFSP and the DBFSP.Combination of IGA and ILS methods with two types of VNS.A MILP model solved for small-sized instances.The proposed methods are very effective. We consider the NP-hard problem of scheduling n ...
Comments
Information & Contributors
Information
Published In
- Conference Chairs:
- Martin J. Wildberger,
- Christian Couturier,
- Editors:
- James R. Cordy,
- Anatol W. Kark,
- Darlene A. Stewart,
- Program Chairs:
- Anatol W. Kark,
- James R. Cordy
Sponsors
- IBM Centre for Advanced Studies (CAS)
- IBM Toronto Laboratory
- NRC: National Research Council - Canada
Publisher
IBM Press
Publication History
Qualifiers
- Article
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 280Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in