{"title":"通过并行DFS的接收机发起的DLB方案的比较","authors":"M. Hamad, S. Sharif","doi":"10.1109/AICCSA.2011.6126581","DOIUrl":null,"url":null,"abstract":"This research focuses on the comparison of two commonly used receiver initiated Dynamic Load Balancing (DLB) Schemes. The schemes of which are the ARR (Asynchronous Round Robin) and RP (Random Polling) are comprehensively compared theoretically and practically, weighing their pros and cons. To present a case study for their application and thus comparison, an adapted version of the Parallel Depth First Search (Parallel DFS) algorithm makes use of them in solving the famous 8-puzzle problem.","PeriodicalId":375277,"journal":{"name":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A comparson of receiver initiated DLB schemes via Parallel DFS\",\"authors\":\"M. Hamad, S. Sharif\",\"doi\":\"10.1109/AICCSA.2011.6126581\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This research focuses on the comparison of two commonly used receiver initiated Dynamic Load Balancing (DLB) Schemes. The schemes of which are the ARR (Asynchronous Round Robin) and RP (Random Polling) are comprehensively compared theoretically and practically, weighing their pros and cons. To present a case study for their application and thus comparison, an adapted version of the Parallel Depth First Search (Parallel DFS) algorithm makes use of them in solving the famous 8-puzzle problem.\",\"PeriodicalId\":375277,\"journal\":{\"name\":\"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICCSA.2011.6126581\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 9th IEEE/ACS International Conference on Computer Systems and Applications (AICCSA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICCSA.2011.6126581","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A comparson of receiver initiated DLB schemes via Parallel DFS
This research focuses on the comparison of two commonly used receiver initiated Dynamic Load Balancing (DLB) Schemes. The schemes of which are the ARR (Asynchronous Round Robin) and RP (Random Polling) are comprehensively compared theoretically and practically, weighing their pros and cons. To present a case study for their application and thus comparison, an adapted version of the Parallel Depth First Search (Parallel DFS) algorithm makes use of them in solving the famous 8-puzzle problem.