Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!news.glorb.com!border3.nntp.dca.giganews.com!border1.nntp.dca.giganews.com!nntp.giganews.com!news.iecc.com!nerds-end From: Raphael Ernani Rodrigues Newsgroups: comp.compilers Subject: Need idea for a compiler project Date: Thu, 19 Apr 2012 08:01:07 -0700 (PDT) Organization: Compilers Central Lines: 20 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <12-04-038@comp.compilers> NNTP-Posting-Host: news.iecc.com X-Trace: leila.iecc.com 1334891736 84074 64.57.183.58 (20 Apr 2012 03:15:36 GMT) X-Complaints-To: abuse@iecc.com NNTP-Posting-Date: Fri, 20 Apr 2012 03:15:36 +0000 (UTC) Keywords: question Posted-Date: 19 Apr 2012 23:15:36 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Xref: csiph.com comp.compilers:581 Dear all, I am a MsC student, and I want to do research in code optimization and generation. I am taking an advanced course on algorithms, and the course project asks to develop a graph-related algorithm that deals with some actual application. There are a lot of compiler back-end algorithms that deal with graphs: register allocation, partial redundancy elimination, instruction scheduling, etc. So, I would like to see if any of you could give me an idea of a good graph-related algorithm that I could implement, and experiment with, in this course project. The idea does not have to be new or visionary. It would be good if there is a nice graph-related algorithm underlying it. One last thing: this idea should be something that an experienced programmer with a good compiler background should be able to implement in nine weeks. Regards to all, Raphael