Referenced Items are not available for this document.
An approach to the solution of the mapping problem for time-critical Occam2 programs for transputer networks is described. It is based on the idea of running the algorithm on the real transputer to obtain its temporal diagram and then deducing the near-optimal load distribution and/or network architecture. The method uses the genetic algorithm when looking for a mapping and demonstrates good agreement with experiments
Published in:
Control Applications, 1994., Proceedings of the Third IEEE Conference on
Date of Conference: 24-26 Aug 1994
- Page(s):
- 825 - 829 vol.2
- Meeting Date :
- 24 Aug 1994-26 Aug 1994
- Print ISBN:
- 0-7803-1872-2
- INSPEC Accession Number:
- 4911530
- Conference Location :
- Glasgow
- Digital Object Identifier :
- 10.1109/CCA.1994.381214
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.
