Embedded system synthesis under memory constraints
This paper presents a genetic algorithm to solve the system synthesis problem of mapping a time constrained single-rate system specification onto a given heterogeneous architecture which may contain irregular interconnection structures. The synthesis is performed under memory constraints, that is, t...
        Saved in:
      
    
          | Published in | Hardware/Software Codesign 1999: Proceedings of the IEEE 7th International Conference pp. 188 - 192 | 
|---|---|
| Main Authors | , | 
| Format | Conference Proceeding | 
| Language | English | 
| Published | 
        New York, NY, USA
          ACM
    
        01.03.1999
     IEEE  | 
| Series | ACM Conferences | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9781581131321 1581131321  | 
| ISSN | 1092-6100 | 
| DOI | 10.1145/301177.301526 | 
Cover
| Summary: | This paper presents a genetic algorithm to solve the system synthesis problem of mapping a time constrained single-rate system specification onto a given heterogeneous architecture which may contain irregular interconnection structures. The synthesis is performed under memory constraints, that is, the algorithm takes into account the memory size of processors and the size of interface buffers of communication links, and in particular the complicated interplay of these. The presented algorithm is implemented as part of the LY-COS cosynthesis system. | 
|---|---|
| Bibliography: | SourceType-Conference Papers & Proceedings-1 ObjectType-Conference Paper-1 content type line 25  | 
| ISBN: | 9781581131321 1581131321  | 
| ISSN: | 1092-6100 | 
| DOI: | 10.1145/301177.301526 |