On the Near-optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling

On the Near-optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling

4.11 - 1251 ratings - Source

List scheduling is generally regarded as being near-optimal in practice, provided a good choice of heuristic is used. However, previous work comparing a list scheduler against an optimal scheduler either makes the assumption that an idealized architectural model is being used or uses too few test cases to strongly prove or disprove the assumed near-optimality of list scheduling. It remains an open question whether or not list scheduling performs well when scheduling for a realistic architectural model.List scheduling is generally regarded as being near-optimal in practice, provided a good choice of heuristic is used.


Title:On the Near-optimality of List Scheduling Heuristics for Local and Global Instruction Scheduling
Author: John Michael Chase, University of Waterloo. Department of Computer Science
Publisher:ProQuest - 2007
ISBN-13:

You must register with us as either a Registered User before you can Download this Book. You'll be greeted by a simple sign-up page.

Once you have finished the sign-up process, you will be redirected to your download Book page.

How it works:
  • 1. Register a free 1 month Trial Account.
  • 2. Download as many books as you like (Personal use)
  • 3. Cancel the membership at any time if not satisfied.


Click button below to register and download Ebook
Privacy Policy | Contact | DMCA