Related articles |
---|
Progress in instruction scheduling? linuxkaffee@gmx.net (Stephan Ceram) (2008-03-17) |
Re: Progress in instruction scheduling? omerbeg@gmail.com (=?UTF-8?B?IO+7i++7pO+6riDvuqnvu6vvu6Dvu67vu68=?=) (2008-03-18) |
Re: Progress in instruction scheduling? boldyrev+nospam@cgitftp.uiggm.nsc.ru (Ivan Boldyrev) (2008-03-19) |
Re: Progress in instruction scheduling? SidTouati@inria.fr (Sid Touati) (2008-04-22) |
From: | "=?UTF-8?B?IO+7i++7pO+6riDvuqnvu6vvu6Dvu67vu68=?=" <omerbeg@gmail.com> |
Newsgroups: | comp.compilers |
Date: | Tue, 18 Mar 2008 10:54:17 -0400 |
Organization: | Compilers Central |
References: | 08-03-068 |
Keywords: | optimize |
Posted-Date: | 18 Mar 2008 23:35:32 EDT |
There is some recent work on optimal scheduling which compares with
the list scheduling heuristic. The problem is that the list scheduler
is very close to optimal and much faster than the optimal one.
Abid M. Malik, Jim McInnes, and Peter van Beek. Optimal basic block
instruction scheduling for multiple-issue processors using constraint
programming. Proceedings of the 18th IEEE International Conference on
Tools with Artificial Intelligence, Washington, DC, 279-287,
November, 2006. A longer version appears in the International J. of AI
Tools, 17:37-54, 2008.
Return to the
comp.compilers page.
Search the
comp.compilers archives again.