{"title":"基于自旋的多处理机优先级上限协议新变体的研究","authors":"Andreu Carminati, R. S. Oliveira","doi":"10.1109/SBESC.2012.34","DOIUrl":null,"url":null,"abstract":"The objective of this paper is to propose spin-based (busy waiting in case of blocking) variations for the Multiprocessor Priority Ceiling Protocol. The variations are compared with existing protocols for the same system model, which is partitioned scheduling and fixed priority, as the Flexible Multiprocessor Locking Protocol. The proposed variations simplify some characteristics, such implementation or reducing the number of processors needed to schedule synthetic sets of tasks, as used in this work.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Study about New Variations for the Spin-Based Multiprocessor Priority Ceiling Protocol\",\"authors\":\"Andreu Carminati, R. S. Oliveira\",\"doi\":\"10.1109/SBESC.2012.34\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The objective of this paper is to propose spin-based (busy waiting in case of blocking) variations for the Multiprocessor Priority Ceiling Protocol. The variations are compared with existing protocols for the same system model, which is partitioned scheduling and fixed priority, as the Flexible Multiprocessor Locking Protocol. The proposed variations simplify some characteristics, such implementation or reducing the number of processors needed to schedule synthetic sets of tasks, as used in this work.\",\"PeriodicalId\":112286,\"journal\":{\"name\":\"2012 Brazilian Symposium on Computing System Engineering\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 Brazilian Symposium on Computing System Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBESC.2012.34\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Brazilian Symposium on Computing System Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBESC.2012.34","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Study about New Variations for the Spin-Based Multiprocessor Priority Ceiling Protocol
The objective of this paper is to propose spin-based (busy waiting in case of blocking) variations for the Multiprocessor Priority Ceiling Protocol. The variations are compared with existing protocols for the same system model, which is partitioned scheduling and fixed priority, as the Flexible Multiprocessor Locking Protocol. The proposed variations simplify some characteristics, such implementation or reducing the number of processors needed to schedule synthetic sets of tasks, as used in this work.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
