Timothy W. O Neil - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 17 from 17

2011

Transforming Synchronous Data-Flow Graphs to Reduce Execution TimeTimothy W. O Neil, Samer F. Khasawneh, Michael E. Richter, Rama Krishna Pullaguntla. isca, 18(2):111-122, 2011.

2009

Static Scheduling for Cyclo Static Data Flow GraphsSukumar Reddy Anapalli, Krishna Chaithanya Chakilam, Timothy W. O Neil. pdpta 2009: 302-306

Minimizing Inter-Iteration Dependencies in Multi-Dimensional LoopsKrishna Chaithanya Chakilam, Sukumar Reddy Anapalli, Timothy W. O Neil. ISCApdcs 2009: 25-30

Rotation Scheduling on Synchronous Data Flow GraphsRama Krishna Pullaguntla, Samer F. Khasawneh, Timothy W. O Neil. pdpta 2009: 263-269

2008

New Heuristics for Rotation SchedulingMichael Richter, David Poeschl, Timothy W. O Neil. pdpta 2008: 10-16

2007

Static Scheduling for Synchronous Data Flow GraphsSamer F. Khasawneh, Michael E. Richter, Timothy W. O Neil. cata 2007: 38-43

2006

Time-constrained loop scheduling with minimal resourcesTimothy W. O Neil, Edwin Hsing-Mean Sha. jec, 2(1):103-117, 2006. [doi]

2005

Combining Extended Retiming and Unfolding for Rate-Optimal Graph TransformationTimothy W. O Neil, Edwin Hsing-Mean Sha. vlsisp, 39(3):273-293, 2005. [doi]

Static Scheduling of Split-Node Data-Flow GraphsTimothy W. O Neil, Edwin Hsing-Mean Sha. pdcs 2005: 125-130

2003

Optimal Graph Transformation Assuming Alternate Scheduling ModelsTimothy W. O Neil. ISCApdcs 2003: 55-60

Efficient Polynomial-Time Nested Loop Fusion with Full ParallelismEdwin Hsing-Mean Sha, Timothy W. O Neil, Nelson L. Passos. isca, 10(1):9-24, 2003.

2002

Unfolding a Split-node Data-flow GraphTimothy W. O Neil, Edwin Hsing-Mean Sha. pdcs 2002: 712-717

Minimizing resources in a repeating schedule for a split-node data-flow graphTimothy W. O Neil, Edwin Hsing-Mean Sha. glvlsi 2002: 136-141 [doi]

2001

On Retiming Synchronous Data-Flow GraphsTimothy W. O Neil, Edwin Hsing-Mean Sha. ISCApdcs 2001: 103-108

Minimizing Average Schedule Length under Memory Constraints by Optimal Partitioning and PrefetchingZhong Wang, Timothy W. O Neil, Edwin Hsing-Mean Sha. vlsisp, 27(3):215-233, 2001. [doi]

2000

Optimizing Overall Loop Schedules Using Prefetching and PartitioningFei Chen, Timothy W. O Neil, Edwin Hsing-Mean Sha. tpds, 11(6):604-614, 2000. [doi]

Properties and Algorithms for Unfolding of Probabilistic Data-Flow GraphsSissades Tongsima, Timothy W. O Neil, Chantana Chantrapornchai, Edwin Hsing-Mean Sha. vlsisp, 25(3):215-233, 2000. [doi]

Sign in or sign up to see more results.

runs on WebDSL