{"title":"操作数处理和p -单操作符","authors":"L. Vokorokos, N. Ádám, B. Madoš, E. Dankova","doi":"10.1109/INES.2011.5954746","DOIUrl":null,"url":null,"abstract":"The data flow model of execution offers attractive properties for parallel processing. First, it is asynchronous: Because the readiness of data dictates the instruction execution. Second, it is self-scheduling: The data flow graph representation of a program eliminates the need to explicitly manage parallel execution. The architecture described in this article belongs to a class of dynamic dataflow architectures, in which the operand process control significantly affects the performance parameters as well as the system characteristics of the given architecture.","PeriodicalId":414812,"journal":{"name":"2011 15th IEEE International Conference on Intelligent Engineering Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Operand processing and P-single operators\",\"authors\":\"L. Vokorokos, N. Ádám, B. Madoš, E. Dankova\",\"doi\":\"10.1109/INES.2011.5954746\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The data flow model of execution offers attractive properties for parallel processing. First, it is asynchronous: Because the readiness of data dictates the instruction execution. Second, it is self-scheduling: The data flow graph representation of a program eliminates the need to explicitly manage parallel execution. The architecture described in this article belongs to a class of dynamic dataflow architectures, in which the operand process control significantly affects the performance parameters as well as the system characteristics of the given architecture.\",\"PeriodicalId\":414812,\"journal\":{\"name\":\"2011 15th IEEE International Conference on Intelligent Engineering Systems\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 15th IEEE International Conference on Intelligent Engineering Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INES.2011.5954746\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 15th IEEE International Conference on Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INES.2011.5954746","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The data flow model of execution offers attractive properties for parallel processing. First, it is asynchronous: Because the readiness of data dictates the instruction execution. Second, it is self-scheduling: The data flow graph representation of a program eliminates the need to explicitly manage parallel execution. The architecture described in this article belongs to a class of dynamic dataflow architectures, in which the operand process control significantly affects the performance parameters as well as the system characteristics of the given architecture.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
