#### Filter Results:

- Full text PDF available (26)

#### Publication Year

1978

2011

- This year (0)
- Last 5 years (0)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Fei Chen, Timothy W. O'Neil, Edwin Hsing-Mean Sha
- IEEE Trans. Parallel Distrib. Syst.
- 2000

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)

- Michael Richter, David Poeschl, Timothy W. O'Neil
- PDPTA
- 2008

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)

- Timothy W. O'Neil, Samer F. Khasawneh, Michael E. Richter, Rama Krishna Pullaguntla
- I. J. Comput. Appl.
- 2011

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)

- Zhong Wang, Timothy W. O'Neil, Edwin Hsing-Mean Sha
- IEEE Trans. Signal Processing
- 2001

- Timothy W. O'Neil, Sissades Tongsima, Edwin Hsing-Mean Sha
- ICASSP
- 1999

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)

- Timothy W. O'Neil, Edwin Hsing-Mean Sha
- IEEE Trans. Signal Processing
- 2001

— 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)

- Zhong Wang, Timothy W. O'Neil, Edwin Hsing-Mean Sha
- VLSI Signal Processing
- 2001

- Samer F. Khasawneh, Michael E. Richter, Timothy W. O'Neil
- Computers and Their Applications
- 2007

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)

- Timothy W. O'Neil, Edwin Hsing-Mean Sha
- IASTED PDCS
- 2002

- Edwin Hsing-Mean Sha, Timothy W. O'Neil, Nelson L. Passos
- I. J. Comput. Appl.
- 2003

Data locality and synchronization overhead are two important factors that affect the performance of applications on multiprocessors. Loop fusion is an effective way for reducing synchronization and improving data locality. Traditional fusion techniques, however, either can not address the case when fusion-preventing dependencies exist in nested loops, or… (More)