From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 15265 invoked by alias); 27 Apr 2009 18:39:02 -0000 Received: (qmail 15247 invoked by uid 22791); 27 Apr 2009 18:39:00 -0000 X-SWARE-Spam-Status: No, hits=-1.0 required=5.0 tests=AWL,BAYES_00,SARE_MSGID_LONG40,SPF_PASS X-Spam-Check-By: sourceware.org Received: from mail-gx0-f158.google.com (HELO mail-gx0-f158.google.com) (209.85.217.158) by sourceware.org (qpsmtpd/0.43rc1) with ESMTP; Mon, 27 Apr 2009 18:38:56 +0000 Received: by gxk2 with SMTP id 2so164033gxk.8 for ; Mon, 27 Apr 2009 11:38:53 -0700 (PDT) MIME-Version: 1.0 Received: by 10.151.130.2 with SMTP id h2mr9320233ybn.224.1240857533297; Mon, 27 Apr 2009 11:38:53 -0700 (PDT) From: Cristianno Martins Date: Mon, 27 Apr 2009 21:25:00 -0000 Message-ID: <7bf670d0904271138m15c92d22y6cf3dfb170705c93@mail.gmail.com> Subject: Polyhedral Model To: gcc Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: 7bit X-IsSubscribed: yes Mailing-List: contact gcc-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-owner@gcc.gnu.org X-SW-Source: 2009-04/txt/msg00716.txt.bz2 Hi, I'm a master degree student at University of Campinas (Unicamp/Brazil), and I'd been trying to find a compiler to add to it a loop optimization based on polyhedral model. The polyhedral model (basically) works with nested loops structures, performing some transformations, in order to improve the efficiency of their execution. I'm trying to apply this method to automatic compilation for multicore processors. Well, I didn't find anything about a implementation of this kind of optimization inside of gcc. Also, I need to know if someone is working on something like this using the gcc compiler. Thanks in advance, -- Cristianno Martins