#### Filter Results:

#### Publication Year

1999

2011

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this paper, a method combining the loop pipelining technique with data prefetching, called Partition Scheduling with Prefetching (PSP), is proposed. In PSP, the iteration space is first divided into regular partitions. Then a two-part schedule, consisting of the ALU and memory parts, is produced and balanced to produce high throughput. These two parts… (More)

For an iterative process to be parallelized, the operations that comprise the process must be organized into a correct schedule that will allow the hardware to compute the task. The focus of our research is rotation scheduling, a list-scheduling-based method for producing compact, static schedules for iterative processes on parallel hardware. We present… (More)

Many iterative or recursive applications commonly found in DSP and image processing applications can be represented by data-flow graphs (DFGs). This graph is then used to perform DFG scheduling , where the starting times for executing the application's individual tasks are determined. The minimum length of time required to execute all tasks once is called… (More)

— Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to equivalent DFGs with smaller clock periods, the use of… (More)

Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). A great deal of research has been done attempting to optimize such applications through retiming. However, despite its proven effectiveness in transforming single-rate data-flow graphs to equivalent DFGs with smaller clock periods, the use of… (More)

This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations done. The main result of this paper is finding an iteration bound equation that is used to find an integral static schedule for the SDFG, where a node is issued at the beginning… (More)

It is known that any selection statement (e.g. if and switch-case statements) in an application is associated with a probability which could either be predetermined by user input or chosen at runtime. Such a statement can be regarded as a computation node whose computation time is represented by a random variable. This paper focuses on iterative… (More)

Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by <i>data-flow graphs</i> (DFGs). In our previous work, we proposed a new technique, <i>extended retiming</i>, which can be combined with minimal unfolding to transform a DFG into one which is rate-optimal.… (More)