{"title":"用于SMT处理器的数据共享协议","authors":"Shi-Wu Lo","doi":"10.1145/1141277.1141485","DOIUrl":null,"url":null,"abstract":"Although there are many real-time task synchronization protocols designed for uniprocessor and multiprocessor systems, most of them do not fit the needs in accommodating simultaneous multithreading (SMT). Real-time synchronization protocols are expected to bound the maximum number of priority inversions and to meet task deadlines. Synchronization protocols for simultaneous processing need to explore the possibility in executing multiple tasks at the same time to increase the system concurrency level to utilize the abundant computing resources, of simultaneous multithreading computer systems. This work proposes the concept of \"LP-Time Inheritance\" to manage the period of blocking time without significantly decreasing the level of task parallelism. The schedulability tests for the proposed protocol are also presented.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Data sharing protocols for SMT processors\",\"authors\":\"Shi-Wu Lo\",\"doi\":\"10.1145/1141277.1141485\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although there are many real-time task synchronization protocols designed for uniprocessor and multiprocessor systems, most of them do not fit the needs in accommodating simultaneous multithreading (SMT). Real-time synchronization protocols are expected to bound the maximum number of priority inversions and to meet task deadlines. Synchronization protocols for simultaneous processing need to explore the possibility in executing multiple tasks at the same time to increase the system concurrency level to utilize the abundant computing resources, of simultaneous multithreading computer systems. This work proposes the concept of \\\"LP-Time Inheritance\\\" to manage the period of blocking time without significantly decreasing the level of task parallelism. The schedulability tests for the proposed protocol are also presented.\",\"PeriodicalId\":269830,\"journal\":{\"name\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1141277.1141485\",\"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 of the 2006 ACM symposium on Applied computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1141277.1141485","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Although there are many real-time task synchronization protocols designed for uniprocessor and multiprocessor systems, most of them do not fit the needs in accommodating simultaneous multithreading (SMT). Real-time synchronization protocols are expected to bound the maximum number of priority inversions and to meet task deadlines. Synchronization protocols for simultaneous processing need to explore the possibility in executing multiple tasks at the same time to increase the system concurrency level to utilize the abundant computing resources, of simultaneous multithreading computer systems. This work proposes the concept of "LP-Time Inheritance" to manage the period of blocking time without significantly decreasing the level of task parallelism. The schedulability tests for the proposed protocol are also presented.