Timothy W. O’Neil


  1. [1] E.A. Lee and D.G. Messerschmitt, Static scheduling of syn-chronous data-flow programs for digital signal processing, IEEETransactions on Computers, 36(1), 1987, 24–35.
  2. [2] T.W. O’Neil, S.F. Khasawneh, M.E. Richter, and R.K. Pulla-guntla, Transforming synchronous data-flow graphs to reduceexecution time, International Journal of Computers and TheirApplications, 18(2), 2011, 111–122.
  3. [3] T.W. O’Neil and E.H.-M. Sha, Retiming synchronous data-flow graphs to reduce execution time, IEEE Transactions onSignal Processing, 49(10), 2001, 2397–2407.
  4. [4] L.-F. Chao, A. LaPaugh, and E.H.-M. Sha, Rotation schedul-ing: A loop pipelining algorithm, Proc. 30th ACM/IEEEDesign Automation Conference, Dallas TX, 1993, 566–572.
  5. [5] G. DeMicheli, Synthesis and optimization of digital circuits,(New York, NY: McGraw-Hill, Inc., 1994).
  6. [6] Y.-C. Ho and J.-C. Tsay, Fully static processor-optimal as-signment of data-flow graphs, IEEE Signal Processing Letters,4(5), 1997, 146–148.
  7. [7] T.W. O’Neil, Resource-constrained static scheduling of syn-chronous data-flow graphs, Proc. IASTED 23rd Int. Conf. onParallel and Distributed Computing and Systems, Dallas, TX,2011, 124–129.
  8. [8] E.A. Lee and D.G. Messerschmitt, Pipeline interleaved pro-grammable DSPs: Synchronous data flow programming, IEEETransactions on Acoustics, Speech and Signal Processing, 35(9),1987, 1334–1345.
  9. [9] R. Lauwereins, M. Engels, and J.A. Peperstraete, GRAPE-II:A tool for the rapid prototyping of multi-rate asynchronousDSP applications on heterogeneous, Proc. 3rd Int. Workshopon Rapid System Prototyping, Research Park Triangle, NC,1992, 24–37.
  10. [10] J.T. Buck, Scheduling dynamic dataflow graphs with boundedmemory using the token flow model, Doctoral Dissertation,The University of California at Berkeley, Berkeley, CA, 1993.
  11. [11] G. Bilsen, M. Engels, R. Lauwereins, and J. Peperstraete,Cyclo-static dataflow, IEEE Transactions on Signal Processing,44(2), 1996, 397–408.
  12. [12] M. Renfors and Y. Neuvo, The maximum sampling rate ofdigital filters under hardware speed constraints, Transactionson Circuits and Sampling, 28(3), 1981, 196–202.
  13. [13] L.-F. Chao, Scheduling and behavioral transformations forparallel systems, Doctoral Dissertation, Princeton University,Princeton, NJ, 1993.
  14. [14] T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein,Introduction to Algorithms, 3rd ed. (Cambridge, MA: The MITPress, 2009).
  15. [15] T.C. Hu, Parallel sequencing and assembly line problems,Operations Research, 9(6), 1961, 841–848.
  16. [16] J. Nestor and D. Thomas, Behavioral synthesis with interfaces,Proc. Int. Conf. on Computer Aided Design, Santa Clara, CA,1986, 112–115.
  17. [17] K. Iwano and S. Yeh, An efficient algorithm for optimal loopparallelization, Proc. SIGAL Int. Symposium on Algorithms,Tokyo, Japan, 1990, 201–210.
  18. [18] R.M. Karp, A characterization of the minimum cycle mean ina digraph, Discrete Mathematics, 23(3), 1978, 309–311.
  19. [19] V. Zivojnovic, S. Ritz, and H. Meyr, Optimizing DSP pro-grams under the multirate retiming transformation, Proc. 7thEuropean Signal Processing Conference, Edinburgh, Scotland,1994, 1597–1600.

Important Links:

Go Back