{"title":"电网并行实时仿真的启发式映射方法分析","authors":"T. Wong, C. Rosu, J. Houle","doi":"10.1109/CCECE.1995.526579","DOIUrl":null,"url":null,"abstract":"This paper presents an analysis of a heuristic mapping method used in the scheduling of parallel real-time tasks. Tasks arise when an electrical network, targeted for simulation, is broken down into real-time schedulable objects with resource requirements and timing constraints. Also, tasks are characterized by their worst-ease execution times and their hard deadlines. Results from computer simulations show the dynamic behavior of the mapping method.","PeriodicalId":158581,"journal":{"name":"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Analysis of a heuristic mapping method for parallel real-time simulation of electrical networks\",\"authors\":\"T. Wong, C. Rosu, J. Houle\",\"doi\":\"10.1109/CCECE.1995.526579\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents an analysis of a heuristic mapping method used in the scheduling of parallel real-time tasks. Tasks arise when an electrical network, targeted for simulation, is broken down into real-time schedulable objects with resource requirements and timing constraints. Also, tasks are characterized by their worst-ease execution times and their hard deadlines. Results from computer simulations show the dynamic behavior of the mapping method.\",\"PeriodicalId\":158581,\"journal\":{\"name\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.1995.526579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.1995.526579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analysis of a heuristic mapping method for parallel real-time simulation of electrical networks
This paper presents an analysis of a heuristic mapping method used in the scheduling of parallel real-time tasks. Tasks arise when an electrical network, targeted for simulation, is broken down into real-time schedulable objects with resource requirements and timing constraints. Also, tasks are characterized by their worst-ease execution times and their hard deadlines. Results from computer simulations show the dynamic behavior of the mapping method.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
