Pub Date : 2005-11-13DOI: 10.1109/GRID.2005.1542758
M. Muhammad, Adeep S. Cheema, Indranil Gupta
Due to the recent surge in the area of grid computing, there is an urgency to find efficient ways of protecting consistent and concurrent access to shared resources. Traditional peer-to-peer (P2P) applications such as Kazaa and Gnutella have been primarily used for sharing read-only files (such as mpegs and mp3s). This paper introduces two novel protocols, the End-to-End and Non End-to-End, for achieving mutual exclusion efficiently in dynamic P2P systems. The protocols are layered atop a distributed hash table (DHT), making them scalable and fault-tolerant. The burden of controlling access to the critical section is also evenly distributed among all the nodes in the network, making the protocols more distributed and easily adaptable to growing networks. Since the protocols are designed independent of any specific DHT implementation, they can be incorporated with any generic P2P DHT, depending on the application requirements. We present experiments comparing our implementations with existing mutual exclusion algorithms. The significant reduction in overall message overhead and better load-balancing mechanisms makes the proposed protocols very attractive in being used for current and future P2P and grid applications.
{"title":"Efficient mutual exclusion in peer-to-peer systems","authors":"M. Muhammad, Adeep S. Cheema, Indranil Gupta","doi":"10.1109/GRID.2005.1542758","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542758","url":null,"abstract":"Due to the recent surge in the area of grid computing, there is an urgency to find efficient ways of protecting consistent and concurrent access to shared resources. Traditional peer-to-peer (P2P) applications such as Kazaa and Gnutella have been primarily used for sharing read-only files (such as mpegs and mp3s). This paper introduces two novel protocols, the End-to-End and Non End-to-End, for achieving mutual exclusion efficiently in dynamic P2P systems. The protocols are layered atop a distributed hash table (DHT), making them scalable and fault-tolerant. The burden of controlling access to the critical section is also evenly distributed among all the nodes in the network, making the protocols more distributed and easily adaptable to growing networks. Since the protocols are designed independent of any specific DHT implementation, they can be incorporated with any generic P2P DHT, depending on the application requirements. We present experiments comparing our implementations with existing mutual exclusion algorithms. The significant reduction in overall message overhead and better load-balancing mechanisms makes the proposed protocols very attractive in being used for current and future P2P and grid applications.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130088498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-11-13DOI: 10.1109/GRID.2005.1542738
Jun Feng, Lingling Cui, G. Wasson, M. Humphrey
To date, only Linux/UNIX-based hosts have been participants in the Grid vision for seamless data access, because the necessary Grid data access protocols have not been implemented on Windows. As part of our larger effort at the University of Virginia to make the Windows platform a first-class participant in all aspects of grids, this paper describes our experiences and lessons learned while implementing GridFTP on the Microsoft .NET Framework. Our implementation not only supports major extensions of GridFTP v1, it also uniquely implements some features of GridFTP v2 and introduces a new transfer mode specifically designed for transfer of large collection of small files. Our measured performance is comparable to GT4 GridFTP on both single and parallel streams transfer and more efficient than GT4 GridFTP on directory tree transfer. We also identify issues specific to the .NET Framework/Windows platform with regard to security and we identify limitations of current GridFTP protocol. To our knowledge, the work described in this paper is the first comprehensive and evaluated implementation of GridFTP on .NET.
到目前为止，只有基于Linux/ unix的主机参与了无缝数据访问的网格愿景，因为必要的网格数据访问协议还没有在Windows上实现。作为弗吉尼亚大学(University of Virginia)使Windows平台在网格的各个方面成为一流参与者的更大努力的一部分，本文描述了我们在Microsoft . net框架上实现GridFTP的经验和教训。我们的实现不仅支持GridFTP v1的主要扩展，而且还独特地实现了GridFTP v2的一些特性，并引入了专门为传输大量小文件而设计的新传输模式。我们测量的性能在单流和并行流传输方面与GT4 GridFTP相当，在目录树传输方面比GT4 GridFTP更有效。我们还指出了。net框架/Windows平台在安全性方面的问题，并指出了当前GridFTP协议的局限性。据我们所知，本文描述的工作是GridFTP在。net上的第一个全面和评估的实现。
{"title":"Toward seamless grid data access: design and implementation of GridFTP on .NET","authors":"Jun Feng, Lingling Cui, G. Wasson, M. Humphrey","doi":"10.1109/GRID.2005.1542738","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542738","url":null,"abstract":"To date, only Linux/UNIX-based hosts have been participants in the Grid vision for seamless data access, because the necessary Grid data access protocols have not been implemented on Windows. As part of our larger effort at the University of Virginia to make the Windows platform a first-class participant in all aspects of grids, this paper describes our experiences and lessons learned while implementing GridFTP on the Microsoft .NET Framework. Our implementation not only supports major extensions of GridFTP v1, it also uniquely implements some features of GridFTP v2 and introduces a new transfer mode specifically designed for transfer of large collection of small files. Our measured performance is comparable to GT4 GridFTP on both single and parallel streams transfer and more efficient than GT4 GridFTP on directory tree transfer. We also identify issues specific to the .NET Framework/Windows platform with regard to security and we identify limitations of current GridFTP protocol. To our knowledge, the work described in this paper is the first comprehensive and evaluated implementation of GridFTP on .NET.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133604847","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-11-13DOI: 10.1109/GRID.2005.1542766
M. Tryby, Baha Mirghani, S. Ranjithan, G. Mahinthakumar, Derek Baessler, N. Karonis
In this paper, we report our experiences developing a grid-enabled framework for solving environmental inverse problems. The solution approach taken here couples environmental simulation models with global search methods and requires the readily available computational resources of the grid for computational tractability. We present a set of results for a ground water release history reconstruction problem, and report significant performance improvements observed for a deployment of the application on the TeraGrid.
{"title":"LASSO: a grid-enabled simulation optimization framework","authors":"M. Tryby, Baha Mirghani, S. Ranjithan, G. Mahinthakumar, Derek Baessler, N. Karonis","doi":"10.1109/GRID.2005.1542766","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542766","url":null,"abstract":"In this paper, we report our experiences developing a grid-enabled framework for solving environmental inverse problems. The solution approach taken here couples environmental simulation models with global search methods and requires the readily available computational resources of the grid for computational tractability. We present a set of results for a ground water release history reconstruction problem, and report significant performance improvements observed for a deployment of the application on the TeraGrid.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134230896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2005-11-13DOI: 10.1109/GRID.2005.1542765
Jefferson Tan, D. Abramson, C. Enticott
The grid offers significant opportunities for performing wide area distributed computing, allowing multiple organizations to collaborate and build dynamic and flexible virtual organisations. However, existing security firewalls often diminish the level of collaboration that is possible, and current grid middleware often assumes that there are no restrictions on the type of communication that is allowed. Accordingly, a number of collaborations have failed because the member sites have different and conflicting security policies. In this paper we present an architecture that facilitates inter-organization communication using existing grid middleware, without compromising the security policies in place at each of the participating sites. Our solutions are built on a number of standard secure communication protocols such as SSH and SOCKS. We call this architecture Remus, and will demonstrate its effectiveness using the Nimrod/G tools.
{"title":"Bridging organizational network boundaries on the grid","authors":"Jefferson Tan, D. Abramson, C. Enticott","doi":"10.1109/GRID.2005.1542765","DOIUrl":"https://doi.org/10.1109/GRID.2005.1542765","url":null,"abstract":"The grid offers significant opportunities for performing wide area distributed computing, allowing multiple organizations to collaborate and build dynamic and flexible virtual organisations. However, existing security firewalls often diminish the level of collaboration that is possible, and current grid middleware often assumes that there are no restrictions on the type of communication that is allowed. Accordingly, a number of collaborations have failed because the member sites have different and conflicting security policies. In this paper we present an architecture that facilitates inter-organization communication using existing grid middleware, without compromising the security policies in place at each of the participating sites. Our solutions are built on a number of standard secure communication protocols such as SSH and SOCKS. We call this architecture Remus, and will demonstrate its effectiveness using the Nimrod/G tools.","PeriodicalId":347929,"journal":{"name":"The 6th IEEE/ACM International Workshop on Grid Computing, 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132279943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：