Talk:Instruction scheduling

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Computing: Software / CompSci Low‑importance

This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing articles

Low

This article has been rated as Low-importance on the project's importance scale.

This article is supported by WikiProject Software (assessed as Low-importance).

This article is supported by WikiProject Computer science (assessed as Low-importance).

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

We have to add techniques here (just a mental note). --euyyn 21:00, 23 June 2006 (UTC)[reply]

algorithm lacking and confusing[edit]

The algorithm presented is a bit on the primitive side and doesn't really discuss the direction of scheduling (which is a serious omission.) In fact, in my experience (I've written three and looked at others) list scheduling isn't really done like this at all though scheduling heuristics are a good thing to talk about.

Sure it's primitive. It says it's the simplest one, intended to introduce the subject. I totally agree it needs to be elaborated. Feel free to expand. Mauritsmaartendejong 10:03, 17 August 2007 (UTC)[reply]

instruction pipeline ?[edit]

The definition says that processors with an instruction pipeline benefit from scheduling. Well, the 6502 had an instruction pipeline, but scheduling didn't really help performance. VLIW processors frequently don't have an instruction pipeline, but scheduling is essential. So what is the distinguishing characteristic ? I think we could leave it at 'that improves performance on processors that employ parallel execution of instructions' or something like that. The instruction pipeline link is important of course, but that may be moved to a further introductory section.

Furthermore, the definition says it tries to avoid illegal or semantically ambiguous operations (typically involving subtle instruction pipeline timing issues or non-interlocked resources.. IMHO it should do better than trying. The first bullet is a goal, the second a requirement already implied by without changing the meaning of the code.

On the other hand, instruction scheduling can also be necessary to obtain a correct schedule after instruction selection for a non-interlocked architecture. In that case it's not an optimization, and it probably does change the meaning of the code.

I propose to limit the definition to the bare essence (reordering instructions as used by a compiler), followed by these two important applications.

Mauritsmaartendejong 18:03, 17 July 2007 (UTC)[reply]