Timothy W. O'Neil

According to our database1, Timothy W. O'Neil authored at least 21 papers between 1999 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2011
Transforming Synchronous Data-Flow Graphs to Reduce Execution Time.
I. J. Comput. Appl., 2011

2009
Rotation Scheduling on Synchronous Data Flow Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2009

Static Scheduling for Cyclo Static Data Flow Graphs.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2009

Minimizing Inter-Iteration Dependencies in Multi-Dimensional Loops.
Proceedings of the 22nd International Conference on Parallel and Distributed Computing and Communication Systems, 2009

2008
New Heuristics for Rotation Scheduling.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2008

2007
Static Scheduling for Synchronous Data Flow Graphs.
Proceedings of the 22nd International Conference on Computers and Their Applications, 2007

2006
Time-constrained loop scheduling with minimal resources.
J. Embedded Computing, 2006

2005
Combining Extended Retiming and Unfolding for Rate-Optimal Graph Transformation.
VLSI Signal Processing, 2005

Static Scheduling of Split-Node Data-Flow Graphs.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2005

2003
Efficient Polynomial-Time Nested Loop Fusion with Full Parallelism.
I. J. Comput. Appl., 2003

Optimal Graph Transformation Assuming Alternate Scheduling Models.
Proceedings of the ISCA 16th International Conference on Parallel and Distributed Computing Systems, 2003

2002
Unfolding a Split-node Data-flow Graph.
Proceedings of the International Conference on Parallel and Distributed Computing Systems, 2002

Minimizing resources in a repeating schedule for a split-node data-flow graph.
Proceedings of the 12th ACM Great Lakes Symposium on VLSI 2002, 2002

2001
Minimizing Average Schedule Length under Memory Constraints by Optimal Partitioning and Prefetching.
VLSI Signal Processing, 2001

Optimal loop scheduling for hiding memory latency based on two-level partitioning and prefetching.
IEEE Trans. Signal Processing, 2001

Retiming synchronous data-flow graphs to reduce execution time.
IEEE Trans. Signal Processing, 2001

On Retiming Synchronous Data-Flow Graphs.
Proceedings of the ISCA 14th International Conference on Parallel and Distributed Computing Systems, 2001

2000
Properties and Algorithms for Unfolding of Probabilistic Data-Flow Graphs.
VLSI Signal Processing, 2000

Optimizing Overall Loop Schedules Using Prefetching and Partitioning.
IEEE Trans. Parallel Distrib. Syst., 2000

1999
Unfolding probabilistic data-flow graphs under different timing models.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999

Extended retiming: optimal scheduling via a graph-theoretical approach.
Proceedings of the 1999 IEEE International Conference on Acoustics, 1999


  Loading...