{"title":"A neural network based algorithm for the scheduling problem in high-level synthesis","authors":"M. Nourani, C. Papachristou, Yoshiyasu Takefuji","doi":"10.1109/EURDAC.1992.246221","DOIUrl":null,"url":null,"abstract":"A new scheduling approach for high-level synthesis based on a deterministic modified Hopfield model is presented. The model uses a four-dimensional neural network architecture to schedule the operations of a data flow graph (DFG), and maps them to specific functional units. Neural network-based scheduling (NNS) is achieved by formulating the scheduling problem in terms of an energy function, and by using the motion equation corresponding to the variation of energy. The algorithm searches the scheduling space in parallel and finds the optimal schedule. This yields an efficient parallel scheduling algorithm under time and resource constraints appropriate for implementing on a parallel machine. The algorithm is based on moves in the scheduling space, which correspond to moves towards the equilibrium point (lowest energy state) in the dynamic system space.<<ETX>>","PeriodicalId":218056,"journal":{"name":"Proceedings EURO-DAC '92: European Design Automation Conference","volume":"179 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings EURO-DAC '92: European Design Automation Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURDAC.1992.246221","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
A new scheduling approach for high-level synthesis based on a deterministic modified Hopfield model is presented. The model uses a four-dimensional neural network architecture to schedule the operations of a data flow graph (DFG), and maps them to specific functional units. Neural network-based scheduling (NNS) is achieved by formulating the scheduling problem in terms of an energy function, and by using the motion equation corresponding to the variation of energy. The algorithm searches the scheduling space in parallel and finds the optimal schedule. This yields an efficient parallel scheduling algorithm under time and resource constraints appropriate for implementing on a parallel machine. The algorithm is based on moves in the scheduling space, which correspond to moves towards the equilibrium point (lowest energy state) in the dynamic system space.<>