public inbox for gcc@gcc.gnu.org
 help / color / mirror / Atom feed
From: Ajit Kumar Agarwal <ajit.kumar.agarwal@xilinx.com>
To: "gcc@gcc.gnu.org" <gcc@gcc.gnu.org>
Cc: Vinod Kathail <vinodk@xilinx.com>,
	Shail Aditya Gupta	<shailadi@xilinx.com>,
	Vidhumouli Hunsigida <vidhum@xilinx.com>,
	"Nagaraju Mekala" <nmekala@xilinx.com>
Subject: Unrolling factor heuristics for Loop Unrolling
Date: Thu, 12 Feb 2015 10:10:00 -0000	[thread overview]
Message-ID: <d2ac4412d47a413d9aa4054c4d5d12c1@BL2FFO11FD045.protection.gbl> (raw)

Hello All:

The Loop unrolling without good unrolling factor heuristics becomes the performance bottleneck. The Unrolling factor heuristics based on minimum 
Initiation interval is quite useful with respect to better ILP.  The minimum Initiation interval based on recurrence and resource calculation on Data 
Dependency Graph  along with the register pressure can be used to add the unrolling factor heuristics. To achieve better ILP with the given schedule,
the Loops unrolling and the scheduling are inter dependent and has been widely used in Software Pipelining Literature along with the more granular
List and Trace Scheduling.

The recurrence calculation based on the Loop carried dependencies and the resource allocation based on the simultaneous access of the resources 
Using the reservation table will give good heuristics with respect to calculation of unrolling factor. This has been taken care in the
MII interval Calculation.

Along with MII, the register pressure should also be  considered in the calculation of heuristics for unrolling factor.

This enable better heuristics with respect to unrolling factor. The main advantage of the above heuristics for unrolling factor is that it can be 
Implemented in the Code generation Level. Currently Loop unrolling is done much before the code generation. Let's go by the current implementation
Of doing Loop unrolling optimization at the Loop optimizer level and unrolling happens. After the Current unrolling at the optimizer level the above heuristics
Can be  used to do the unrolling at the Code generation Level with the accurate Register pressure calculation as done in the register allocator and the
Unrolling is done at the code generation level. This looks feasible solution which I am going to propose for the above unrolling heuristics.

This enables the Loop unrolling done at the Optimizer Level  +  at the Code Generation Level. This double level of Loop unrolling is quite useful.
This will overcome the shortcomings of the Loop unrolling at the optimizer level.

The SPEC benchmarks are the better candidates for the above heuristics instead of Mibench and EEMBC.

Thanks & Regards
Ajit

             reply	other threads:[~2015-02-12 10:10 UTC|newest]

Thread overview: 2+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2015-02-12 10:10 Ajit Kumar Agarwal [this message]
2015-02-12 11:02 ` Oleg Endo

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=d2ac4412d47a413d9aa4054c4d5d12c1@BL2FFO11FD045.protection.gbl \
    --to=ajit.kumar.agarwal@xilinx.com \
    --cc=gcc@gcc.gnu.org \
    --cc=nmekala@xilinx.com \
    --cc=shailadi@xilinx.com \
    --cc=vidhum@xilinx.com \
    --cc=vinodk@xilinx.com \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).