Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!ix.netcom.com!netcom.com!hbaker
From: hbaker@netcom.com (Henry G. Baker)
Subject: Re: Assembly programming as a scheduling problem
Message-ID: <hbakerCzoLCI.F5J@netcom.com>
Organization: nil
References: <1994Nov22.174914.23384@cs.cornell.edu>
Date: Tue, 22 Nov 1994 18:14:42 GMT
Lines: 20

In article <1994Nov22.174914.23384@cs.cornell.edu> nikos@cs.cornell.edu (Nikos P. Pitsianis) writes:
>Assembly programming as a scheduling problem
>
>I am sure this is already done, so I would like to get some
>pointers to published work and maybe working code that could
>schedule optimally a small probram.
>
>It would be nice if the target processor can be modeled adequately,
>like the number and the depth of the pipelines, use of cache,
>cycles per operation etc
>
>I know we are talking about non-polynomial time algorithms here,
>but what I want to use it for, is small and regular, with no branching.

It's probably not what you want, but you might look at 'Precise
Instruction Scheduling...' in my ftp archive.

Henry Baker
Read (192.100.81.1) ftp.netcom.com:/pub/hbaker/README for ftp-able papers.
WWW archive: ftp://ftp.netcom.com/pub/hbaker/home-page.html
