D. Milicev and Z. Jovanovic. Predicated Software Pipelining Technique for Loops with Conditions. In Proc. of the 12nd International Parallel Processing Symposium, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....a brief overview of the related work, including a short description of the underlying PSP model. Section 2 presents the approach in an intuitive manner. Section 3 briefly describes our current implementation. The paper ends with conclusions. A more detailed version of this paper can be found at [5]. 1.1 Problem Statement As an example to demonstrate various aspects of the approach throughout the paper, we will consider a simple loop with one conditional statement that finds the vector minimum: for (k=0; k n; k ) if (x[k] x[m] m=k; To set up the environment, we assume the underlying ....

.... k ADD (R2, R2,R0) for ( k n; GE (CC1, R2,R1) BREAK (CC1) 2 The Idea of the PSP Technique We will here describe the idea of the proposed technique in an informal, intuitive way, using the given simple loop. More formal descriptions exist but are beyond the scope of this paper [5]. Basically, each operation in each iteration of the loop is controlled by a combination (or cross product) of none to several outcomes of IFs. Initially, these are IFs from the same iteration. After operation moves across loop boundaries, these can be outcomes from other iterations than the ....

[Article contains additional citation context not shown here]

Milicev D., Jovanovic Z., "Predicated Software Pipelining Technique for Loops with Conditions," a detailed version of this paper, http://ubbg.etf.bg.ac.yu/~emiliced

No context found.

D. Milicev and Z. Jovanovic. Predicated Software Pipelining Technique for Loops with Conditions. In Proc. of the 12nd International Parallel Processing Symposium, 1998.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC