{"title":"分布式共享内存多处理器系统双链表协议研究","authors":"Author Lau, K. Leung, N. Yung, Y. Cheung","doi":"10.1109/ICAPP.1995.472198","DOIUrl":null,"url":null,"abstract":"This paper introduces the doubly-linked list (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two linked lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed.<<ETX>>","PeriodicalId":448130,"journal":{"name":"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing","volume":"110 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On the doubly-linked list protocol for distributed shared memory multiprocessor systems\",\"authors\":\"Author Lau, K. Leung, N. Yung, Y. Cheung\",\"doi\":\"10.1109/ICAPP.1995.472198\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper introduces the doubly-linked list (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two linked lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed.<<ETX>>\",\"PeriodicalId\":448130,\"journal\":{\"name\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"volume\":\"110 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1st International Conference on Algorithms and Architectures for Parallel Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAPP.1995.472198\",\"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 1st International Conference on Algorithms and Architectures for Parallel Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAPP.1995.472198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the doubly-linked list protocol for distributed shared memory multiprocessor systems
This paper introduces the doubly-linked list (DLL) protocol for distributed shared memory (DSM) multiprocessor systems. The protocol makes use of two linked lists to keep track of valid copies of pages in the system, thus eliminating the use of copysets. Simulation studies show that the DLL protocol achieved considerable speed-up for common mathematical problems including a linear equations solver and a matrix multiplier. Performance improvement of up to 51.9% over the dynamic distributed manager algorithm is obtained. Further improvement and possible modification of the protocol are also discussed.<>