Jik-Soo Kim, Beomseok Nam, P. Keleher, Michael A. Marsh, Bobby Bhattacharjee, A. Sussman
{"title":"分布式桌面网格环境中的资源发现技术","authors":"Jik-Soo Kim, Beomseok Nam, P. Keleher, Michael A. Marsh, Bobby Bhattacharjee, A. Sussman","doi":"10.1109/ICGRID.2006.310992","DOIUrl":null,"url":null,"abstract":"Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. Through a comparative analysis on the experimental results obtained via simulation of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between effcient matchmaking and good load balancing in a fully decentralized, heterogeneous computational environment.","PeriodicalId":88963,"journal":{"name":"Proceedings of the ... IEEE/ACM International Conference on Grid Computing. IEEE/ACM International Conference on Grid Computing","volume":"33 4 1","pages":"9-16"},"PeriodicalIF":0.0000,"publicationDate":"2006-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Resource Discovery Techniques in Distributed Desktop Grid Environments\",\"authors\":\"Jik-Soo Kim, Beomseok Nam, P. Keleher, Michael A. Marsh, Bobby Bhattacharjee, A. Sussman\",\"doi\":\"10.1109/ICGRID.2006.310992\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. Through a comparative analysis on the experimental results obtained via simulation of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between effcient matchmaking and good load balancing in a fully decentralized, heterogeneous computational environment.\",\"PeriodicalId\":88963,\"journal\":{\"name\":\"Proceedings of the ... IEEE/ACM International Conference on Grid Computing. IEEE/ACM International Conference on Grid Computing\",\"volume\":\"33 4 1\",\"pages\":\"9-16\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-09-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the ... IEEE/ACM International Conference on Grid Computing. IEEE/ACM International Conference on Grid Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICGRID.2006.310992\",\"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 ... IEEE/ACM International Conference on Grid Computing. IEEE/ACM International Conference on Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICGRID.2006.310992","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Resource Discovery Techniques in Distributed Desktop Grid Environments
Desktop grids use opportunistic sharing to exploit large collections of personal computers and workstations across the Internet, achieving tremendous computing power at low cost. Traditional desktop grid systems are typically based on a client-server architecture, which has inherent shortcomings with respect to robustness, reliability and scalability. In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. Through a comparative analysis on the experimental results obtained via simulation of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between effcient matchmaking and good load balancing in a fully decentralized, heterogeneous computational environment.