{"title":"On the integration of model-based performance optimization and program implementation","authors":"A. Mitschele-Thiel","doi":"10.1109/FTDCS.1993.344157","DOIUrl":null,"url":null,"abstract":"The author describes an approach to integrate system design and implementation of embedded parallel systems into a programming environment. The computation of the design decisions is based on the branch-and-bound-with-underestimate technique, previously applied to compute the optimal schedule for precedence constraint task graphs in the presence of communication cost. The authors have extended this method to compute the optimal system configuration (i.e., the configuration which yields optimal performance) consisting of the network topology, the schedule, and the placement of buffers. In addition, a quasi-static scheduling strategy to handle input-dependent run-time behavior is described. The ideas presented here have been implemented in the Data Stream Processing Language (DSPL) programming environment, which consists of a programming language and an integrated set of tools supporting automated system design as well as implementation.<<ETX>>","PeriodicalId":251095,"journal":{"name":"1993 4th Workshop on Future Trends of Distributed Computing Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 4th Workshop on Future Trends of Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTDCS.1993.344157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
The author describes an approach to integrate system design and implementation of embedded parallel systems into a programming environment. The computation of the design decisions is based on the branch-and-bound-with-underestimate technique, previously applied to compute the optimal schedule for precedence constraint task graphs in the presence of communication cost. The authors have extended this method to compute the optimal system configuration (i.e., the configuration which yields optimal performance) consisting of the network topology, the schedule, and the placement of buffers. In addition, a quasi-static scheduling strategy to handle input-dependent run-time behavior is described. The ideas presented here have been implemented in the Data Stream Processing Language (DSPL) programming environment, which consists of a programming language and an integrated set of tools supporting automated system design as well as implementation.<>