{"title":"重新考虑Lamport的算法","authors":"H. N. Singleton, R. G. Ward","doi":"10.1145/800174.809793","DOIUrl":null,"url":null,"abstract":"A modification to Lamport's algorithm that eliminates busy waiting is presented. A processor that is waiting to enter its critical section is freed to do other useful work. The algorithm is modified further to recognize and honor priorities.","PeriodicalId":321698,"journal":{"name":"ACM '82","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Lamport's algorithm reconsidered\",\"authors\":\"H. N. Singleton, R. G. Ward\",\"doi\":\"10.1145/800174.809793\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A modification to Lamport's algorithm that eliminates busy waiting is presented. A processor that is waiting to enter its critical section is freed to do other useful work. The algorithm is modified further to recognize and honor priorities.\",\"PeriodicalId\":321698,\"journal\":{\"name\":\"ACM '82\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM '82\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800174.809793\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '82","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800174.809793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A modification to Lamport's algorithm that eliminates busy waiting is presented. A processor that is waiting to enter its critical section is freed to do other useful work. The algorithm is modified further to recognize and honor priorities.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
