Newsgroups: comp.constraints
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!gatech!newsxfer.itd.umich.edu!nntp.cs.ubc.ca!uw-beaver!cornell!nikos
From: nikos@cs.cornell.edu (Nikos P. Pitsianis)
Subject: Assembly programming as a scheduling problem
Message-ID: <1994Nov22.174914.23384@cs.cornell.edu>
Organization: Dept. of Comp. Sci., Cornell U.
Date: Tue, 22 Nov 1994 17:49:14 GMT
Lines: 29

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.

Thanks,
Nikos

_____________________________________________________________________

  Nikos P Pitsianis                 Internet : nikos@cs.cornell.edu    
  Cornell University                   Phone : (607) 255 3042          
  5151 Upson Hall, Dept of Comp Sc       FAX : (607) 255 4428          
  Ithaca, NY 14853                      Home : (607) 277 7630


-- 
_____________________________________________________________________

  Nikos P Pitsianis                 Internet : nikos@cs.cornell.edu    
  Cornell University                   Phone : (607) 255 3042          
