Advertisement

Near-optimal scheduling of synchronous data-flow graphs by exact calculation of inter-processor communication costs

  • S. Rosner
  • M. Scholles
  • D. Forchel
Posters
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1225)

References

  1. 1.
    Sih, G. S., Lee, E. A.: A Compile-Time Scheduling Heuristic for Interconnection-Constrained Heterogeneous Processor Architectures. IEEE Trans. Parallel and Distributed Systems, 4(2):175–187, Feb. 1993.Google Scholar
  2. 2.
    Rosner, S., Danz, S., Scholles, M.: Minimal Routing in Reconfigurable Communication Networks. Proc. Intl. Conference on Massively Parallel Computing Systems (MPCS), pp. 156–157, May 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • S. Rosner
    • 1
  • M. Scholles
    • 1
  • D. Forchel
    • 1
  1. 1.Fraunhofer-Institute of Microelectronic Circuits and SystemsDresdenGermany

Personalised recommendations