{"title":"基于平台可靠性的容错异构MPSOC调度长度最小化","authors":"Hassan A. Youness, A. Omar, M. Moness","doi":"10.1109/JEC-ECC.2013.6766391","DOIUrl":null,"url":null,"abstract":"Fault tolerant scheduling has been a subject of great concern recently, considering heterogeneous multiprocessor systems that may contain low reliability processors in their systems. Task replication is an established technique to achieve fault tolerance; however it has a negative influence on schedule length. Moreover increasing system reliability always has a negative impact on schedule length. In this paper we devised a new method for optimizing schedule length and maximizing system reliability simultaneously using simulated annealing. Schedule length is investigated in case of fault free operation and in the presence of a processor fault and then the schedule length is averaged based on the probability of the schedule success and failure, then this average schedule length is optimized to the minimum to give the lowest possible makespan in both cases. Results show that our algorithm is able to maximize the system reliability without degrading schedule length, in fact increasing system reliability decrease the averaged schedule length and hence the system overall performance in all cases.","PeriodicalId":379820,"journal":{"name":"2013 Second International Japan-Egypt Conference on Electronics, Communications and Computers (JEC-ECC)","volume":"113 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Fault tolerant heterogeneous MPSOC schedule length minimization based on platform reliability\",\"authors\":\"Hassan A. Youness, A. Omar, M. Moness\",\"doi\":\"10.1109/JEC-ECC.2013.6766391\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Fault tolerant scheduling has been a subject of great concern recently, considering heterogeneous multiprocessor systems that may contain low reliability processors in their systems. Task replication is an established technique to achieve fault tolerance; however it has a negative influence on schedule length. Moreover increasing system reliability always has a negative impact on schedule length. In this paper we devised a new method for optimizing schedule length and maximizing system reliability simultaneously using simulated annealing. Schedule length is investigated in case of fault free operation and in the presence of a processor fault and then the schedule length is averaged based on the probability of the schedule success and failure, then this average schedule length is optimized to the minimum to give the lowest possible makespan in both cases. Results show that our algorithm is able to maximize the system reliability without degrading schedule length, in fact increasing system reliability decrease the averaged schedule length and hence the system overall performance in all cases.\",\"PeriodicalId\":379820,\"journal\":{\"name\":\"2013 Second International Japan-Egypt Conference on Electronics, Communications and Computers (JEC-ECC)\",\"volume\":\"113 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 Second International Japan-Egypt Conference on Electronics, Communications and Computers (JEC-ECC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JEC-ECC.2013.6766391\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 Second International Japan-Egypt Conference on Electronics, Communications and Computers (JEC-ECC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JEC-ECC.2013.6766391","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Fault tolerant heterogeneous MPSOC schedule length minimization based on platform reliability
Fault tolerant scheduling has been a subject of great concern recently, considering heterogeneous multiprocessor systems that may contain low reliability processors in their systems. Task replication is an established technique to achieve fault tolerance; however it has a negative influence on schedule length. Moreover increasing system reliability always has a negative impact on schedule length. In this paper we devised a new method for optimizing schedule length and maximizing system reliability simultaneously using simulated annealing. Schedule length is investigated in case of fault free operation and in the presence of a processor fault and then the schedule length is averaged based on the probability of the schedule success and failure, then this average schedule length is optimized to the minimum to give the lowest possible makespan in both cases. Results show that our algorithm is able to maximize the system reliability without degrading schedule length, in fact increasing system reliability decrease the averaged schedule length and hence the system overall performance in all cases.