{"title":"用DYNAMO系统模拟并行时间临界程序","authors":"A. Biriukov, D. Ulyanov","doi":"10.1109/CCA.1994.381214","DOIUrl":null,"url":null,"abstract":"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.<<ETX>>","PeriodicalId":173370,"journal":{"name":"1994 Proceedings of IEEE International Conference on Control and Applications","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Simulation of parallel time-critical programs with the DYNAMO system\",\"authors\":\"A. Biriukov, D. Ulyanov\",\"doi\":\"10.1109/CCA.1994.381214\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.<<ETX>>\",\"PeriodicalId\":173370,\"journal\":{\"name\":\"1994 Proceedings of IEEE International Conference on Control and Applications\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 Proceedings of IEEE International Conference on Control and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCA.1994.381214\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 Proceedings of IEEE International Conference on Control and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCA.1994.381214","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Simulation of parallel time-critical programs with the DYNAMO system
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.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
