Software synthesis with evolutionary algorithms

Author

Raithel, Tobias

Author_Institution

Comput. Eng. & Commun. Networks Lab., Swiss Fed. Inst. of Technol., Zurich, Switzerland

Volume

3

fYear

1999

fDate

1999

Firstpage

1490

Abstract

This paper addresses the problem of exploiting simultaneously trade-offs between program memory, data memory and execution time requirements for algorithms specified by synchronous data flow graphs. A code generation model is used, that includes many variable parameters. The search space includes all valid schedules of a graph, different models of buffer organization and different ways of code invocation. An evolutionary algorithm (EA) is applied to this multi-objective optimization problem. This approach is evaluated and compared with existing methods

Keywords

data flow graphs; evolutionary computation; program compilers; software engineering; buffer organization; code generation model; code invocation; data memory; evolutionary algorithms; execution time requirements; multi-objective optimization; program memory; search space; software synthesis; synchronous data flow graphs; Data engineering; Data flow computing; Evolutionary computation; Flow graphs; Memory management; Network synthesis; Random access memory; Scheduling; Space exploration; Space technology;

fLanguage

English

Publisher

ieee

Conference_Titel

Industrial Electronics, 1999. ISIE '99. Proceedings of the IEEE International Symposium on

Conference_Location

Bled

Print_ISBN

0-7803-5662-4

Type

conf

DOI

10.1109/ISIE.1999.797016

Filename

797016