References
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rosner, S., Scholles, M., Forchel, D. (1997). Near-optimal scheduling of synchronous data-flow graphs by exact calculation of inter-processor communication costs. In: Hertzberger, B., Sloot, P. (eds) High-Performance Computing and Networking. HPCN-Europe 1997. Lecture Notes in Computer Science, vol 1225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0031677
Download citation
DOI: https://doi.org/10.1007/BFb0031677
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62898-9
Online ISBN: 978-3-540-69041-2
eBook Packages: Springer Book Archive