Timothy W. O'Neil

Publication Activity (10 Years)

Years Active: 1999-2011
Publications (10 Years): 0

Publications

Timothy W. O'Neil, Samer F. Khasawneh, Michael E. Richter, Rama Krishna Pullaguntla
Transforming Synchronous Data-Flow Graphs to Reduce Execution Time. Int. J. Comput. Their Appl. 18 (2) (2011)
Rama Krishna Pullaguntla, Samer F. Khasawneh, Timothy W. O'Neil
Rotation Scheduling on Synchronous Data Flow Graphs. PDPTA (2009)
Sukumar Reddy Anapalli, Krishna Chaithanya Chakilam, Timothy W. O'Neil
Static Scheduling for Cyclo Static Data Flow Graphs. PDPTA (2009)
Krishna Chaithanya Chakilam, Sukumar Reddy Anapalli, Timothy W. O'Neil
Minimizing Inter-Iteration Dependencies in Multi-Dimensional Loops. PDCCS (2009)
Michael Richter, David Poeschl, Timothy W. O'Neil
New Heuristics for Rotation Scheduling. PDPTA (2008)
Samer F. Khasawneh, Michael E. Richter, Timothy W. O'Neil
Static Scheduling for Synchronous Data Flow Graphs. CATA (2007)
Timothy W. O'Neil, Edwin Hsing-Mean Sha
Time-constrained loop scheduling with minimal resources. J. Embed. Comput. 2 (1) (2006)
Timothy W. O'Neil, Edwin Hsing-Mean Sha
Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation. J. VLSI Signal Process. 39 (3) (2005)
Timothy W. O'Neil, Edwin Hsing-Mean Sha
Static Scheduling of Split-Node Data-Flow Graphs. IASTED PDCS (2005)
Timothy W. O'Neil
Optimal Graph Transformation Assuming Alternate Scheduling Models. PDCS (2003)
Edwin Hsing-Mean Sha, Timothy W. O'Neil, Nelson L. Passos
Efficient Polynomial-Time Nested Loop Fusion with Full Parallelism. Int. J. Comput. Their Appl. 10 (1) (2003)
Timothy W. O'Neil, Edwin Hsing-Mean Sha
Unfolding a Split-node Data-flow Graph. IASTED PDCS (2002)
Timothy W. O'Neil, Edwin Hsing-Mean Sha
Minimizing resources in a repeating schedule for a split-node data-flow graph. ACM Great Lakes Symposium on VLSI (2002)
Timothy W. O'Neil, Edwin Hsing-Mean Sha
Retiming synchronous data-flow graphs to reduce execution time. IEEE Trans. Signal Process. 49 (10) (2001)
Zhong Wang, Timothy W. O'Neil, Edwin Hsing-Mean Sha
Optimal loop scheduling for hiding memory latency based on two-level partitioning and prefetching. IEEE Trans. Signal Process. 49 (11) (2001)
Zhong Wang, Timothy W. O'Neil, Edwin Hsing-Mean Sha
Minimizing Average Schedule Length under Memory Constraints by Optimal Partitioning and Prefetching. J. VLSI Signal Process. 27 (3) (2001)
Timothy W. O'Neil, Edwin Hsing-Mean Sha
On Retiming Synchronous Data-Flow Graphs. PDCS (2001)
Sissades Tongsima, Timothy W. O'Neil, Chantana Chantrapornchai, Edwin Hsing-Mean Sha
Properties and Algorithms for Unfolding of Probabilistic Data-Flow Graphs. J. VLSI Signal Process. 25 (3) (2000)
Fei Chen, Timothy W. O'Neil, Edwin Hsing-Mean Sha
Optimizing Overall Loop Schedules Using Prefetching and Partitioning. IEEE Trans. Parallel Distributed Syst. 11 (6) (2000)
Sissades Tongsima, Timothy W. O'Neil, Edwin Hsing-Mean Sha
Unfolding probabilistic data-flow graphs under different timing models. ICASSP (1999)
Timothy W. O'Neil, Sissades Tongsima, Edwin Hsing-Mean Sha
Extended retiming: optimal scheduling via a graph-theoretical approach. ICASSP (1999)