Timothy W. O'Neil

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