Referenced Items are not available for this document.
Most of the existing static scheduling schemes either ignore the communication delay or use a very simple model to estimate it. The result is that when the program is actually executed, its execution timing is unpredictable due to network behavior and load. However, if one knows the timing information and communication requirements for the program tasks as well as the network topology and behavior at compile time, one can compute (not estimate) the communication delays and network routes before execution. This information can then be used at execution-time for predictable network timing requirements. The authors show that optimal network routing is NP-complete. They then propose two heuristic algorithms, with different characteristics and complexity, to compute sub-optimal routing information for static scheduling at compile time
Published in:
System Sciences, 1991. Proceedings of the Twenty-Fourth Annual Hawaii International Conference on
(Volume:i
)
Date of Conference: 8-11 Jan 1991
- Page(s):
- 10 - 16 vol.1
- Meeting Date :
- 08 Jan 1991-11 Jan 1991
- INSPEC Accession Number:
- 4120658
- Conference Location :
- Kauai, HI
- Digital Object Identifier :
- 10.1109/HICSS.1991.183866
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
