2008 |
13 | | Michael Richter,
David Poeschl,
Timothy W. O'Neil:
New Heuristics for Rotation Scheduling.
PDPTA 2008: 10-16 |
2007 |
12 | | Samer F. Khasawneh,
Michael E. Richter,
Timothy W. O'Neil:
Static Scheduling for Synchronous Data Flow Graphs.
Computers and Their Applications 2007: 38-43 |
2006 |
11 | EE | Timothy W. O'Neil,
Edwin Hsing-Mean Sha:
Time-constrained loop scheduling with minimal resources.
J. Embedded Computing 2(1): 103-117 (2006) |
2005 |
10 | | Timothy W. O'Neil,
Edwin Hsing-Mean Sha:
Static Scheduling of Split-Node Data-Flow Graphs.
IASTED PDCS 2005: 125-130 |
9 | EE | Timothy W. O'Neil,
Edwin Hsing-Mean Sha:
Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation.
VLSI Signal Processing 39(3): 273-293 (2005) |
2003 |
8 | | Timothy W. O'Neil:
Optimal Graph Transformation Assuming Alternate Scheduling Models.
ISCA PDCS 2003: 55-60 |
7 | | Edwin Hsing-Mean Sha,
Timothy W. O'Neil,
Nelson L. Passos:
Efficient Polynomial-Time Nested Loop Fusion with Full Parallelism.
I. J. Comput. Appl. 10(1): 9-24 (2003) |
2002 |
6 | EE | 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: 136-141 |
5 | | Timothy W. O'Neil,
Edwin Hsing-Mean Sha:
Unfolding a Split-node Data-flow Graph.
IASTED PDCS 2002: 712-717 |
2001 |
4 | | Timothy W. O'Neil,
Edwin Hsing-Mean Sha:
On Retiming Synchronous Data-Flow Graphs.
ISCA PDCS 2001: 103-108 |
3 | EE | Zhong Wang,
Timothy W. O'Neil,
Edwin Hsing-Mean Sha:
Minimizing Average Schedule Length under Memory Constraints by Optimal Partitioning and Prefetching.
VLSI Signal Processing 27(3): 215-233 (2001) |
2000 |
2 | EE | Fei Chen,
Timothy W. O'Neil,
Edwin Hsing-Mean Sha:
Optimizing Overall Loop Schedules Using Prefetching and Partitioning.
IEEE Trans. Parallel Distrib. Syst. 11(6): 604-614 (2000) |
1 | EE | Sissades Tongsima,
Timothy W. O'Neil,
Chantana Chantrapornchai,
Edwin Hsing-Mean Sha:
Properties and Algorithms for Unfolding of Probabilistic Data-Flow Graphs.
VLSI Signal Processing 25(3): 215-233 (2000) |