M. Dahan, Mary P. Thomas, E. Roberts, A. Seth, T. Urban, David Walling, J. Boisseau
GridPort is a toolkit for developing Web-based portals and applications for computational science on top of underlying distributed and grid computing infrastructure. GridPort aggregates grid services from popular grid software packages and provides additional grid capabilities, while presenting a simple, consistent API for portal and applications developers.
{"title":"Grid Portal Toolkit 3.0 (GridPort)","authors":"M. Dahan, Mary P. Thomas, E. Roberts, A. Seth, T. Urban, David Walling, J. Boisseau","doi":"10.1109/HPDC.2004.19","DOIUrl":"https://doi.org/10.1109/HPDC.2004.19","url":null,"abstract":"GridPort is a toolkit for developing Web-based portals and applications for computational science on top of underlying distributed and grid computing infrastructure. GridPort aggregates grid services from popular grid software packages and provides additional grid capabilities, while presenting a simple, consistent API for portal and applications developers.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133003869","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}
Alexandre Denis, Olivier Aumage, Rutger F. H. Hofman, K. Verstoep, T. Kielmann, H. Bal
Grid computing applications are challenged by current wide-area networks: firewalls, private IP addresses and network address translation (MAT) hamper connectivity, the TCP protocol can hardly exploit the available bandwidth, and security features like authentication and encryption are usually difficult to integrate. Existing systems (like GridFTP, JXTA, SOCKS) each address only one of these issues. However, applications need to cope with all of them, at the same time. Unfortunately, existing solutions are often not easy to combine, and a particular solution for one subproblem may reduce the applicability or performance of another. We identify the building blocks that are needed for connection establishment and efficient link utilization. We present an integrated solution, implemented within the Java-based Ibis runtime system. OurNetlbis implementation lets applications span multiple sites of a grid, and copes with firewalls, local IP addresses, secure communication, and TCP bandwidth problems.
{"title":"Wide-area communication for grids: an integrated solution to connectivity, performance and security problems","authors":"Alexandre Denis, Olivier Aumage, Rutger F. H. Hofman, K. Verstoep, T. Kielmann, H. Bal","doi":"10.1109/HPDC.2004.41","DOIUrl":"https://doi.org/10.1109/HPDC.2004.41","url":null,"abstract":"Grid computing applications are challenged by current wide-area networks: firewalls, private IP addresses and network address translation (MAT) hamper connectivity, the TCP protocol can hardly exploit the available bandwidth, and security features like authentication and encryption are usually difficult to integrate. Existing systems (like GridFTP, JXTA, SOCKS) each address only one of these issues. However, applications need to cope with all of them, at the same time. Unfortunately, existing solutions are often not easy to combine, and a particular solution for one subproblem may reduce the applicability or performance of another. We identify the building blocks that are needed for connection establishment and efficient link utilization. We present an integrated solution, implemented within the Java-based Ibis runtime system. OurNetlbis implementation lets applications span multiple sites of a grid, and copes with firewalls, local IP addresses, secure communication, and TCP bandwidth problems.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123953061","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}
Xgrid Technical Preview 2 is a distributed computing software technology from Apple Computer, Inc. Xgrid leverages the UNIX-based capabilities of Mac OS X to enable the rapid aggregation of Macintosh systems into a simple yet powerful computational grid which can run a wide range of standard and custom solutions with minimal code changes. To demonstrate the technology, the software is run on a networked rack of Xserve G5 servers and a PowerBook G4 laptop. The demonstration shows how Xgrid is utilized to distribute long-running batch and parallel jobs to a local grid of Mac OS X-based computers.
Xgrid技术预览2是苹果公司开发的分布式计算软件技术。Xgrid利用Mac OS X基于unix的功能，使Macintosh系统能够快速聚合到一个简单而强大的计算网格中，该网格可以运行范围广泛的标准和自定义解决方案，只需进行最小的代码更改。为了演示这项技术，软件在Xserve G5服务器和PowerBook G4笔记本电脑的网络机架上运行。该演示展示了如何利用Xgrid将长时间运行的批处理和并行作业分发到基于Mac OS x的计算机的本地网格。
{"title":"Utilization of a local grid of Mac OS X-based computers using Xgrid","authors":"D. Kramer, M. MacInnis","doi":"10.1109/HPDC.2004.40","DOIUrl":"https://doi.org/10.1109/HPDC.2004.40","url":null,"abstract":"Xgrid Technical Preview 2 is a distributed computing software technology from Apple Computer, Inc. Xgrid leverages the UNIX-based capabilities of Mac OS X to enable the rapid aggregation of Macintosh systems into a simple yet powerful computational grid which can run a wide range of standard and custom solutions with minimal code changes. To demonstrate the technology, the software is run on a networked rack of Xserve G5 servers and a PowerBook G4 laptop. The demonstration shows how Xgrid is utilized to distribute long-running batch and parallel jobs to a local grid of Mac OS X-based computers.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115997656","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}
Wontaek Hong, Minyeol Lim, Eunsung Kim, Jongsuk Lee, Hyoungwoo Park
In this paper, we propose an information service component of Moredream which we refer to as GAIS, for providing advanced functionalities and more plentiful resource information in order to satisfy the requirements for the various applications in the K/sup */Grid computing environment characterized by both high performance and high throughput computing. In particular, GAIS includes interfaces and functionalities for the dynamic VO management, universal VO discovery, service categorization and efficient information providers. Consequently, we anticipate that our Grid information service be broadly utilized through the improved service qualities.
{"title":"GAIS: grid advanced information service based on P2P mechanism","authors":"Wontaek Hong, Minyeol Lim, Eunsung Kim, Jongsuk Lee, Hyoungwoo Park","doi":"10.1109/HPDC.2004.15","DOIUrl":"https://doi.org/10.1109/HPDC.2004.15","url":null,"abstract":"In this paper, we propose an information service component of Moredream which we refer to as GAIS, for providing advanced functionalities and more plentiful resource information in order to satisfy the requirements for the various applications in the K/sup */Grid computing environment characterized by both high performance and high throughput computing. In particular, GAIS includes interfaces and functionalities for the dynamic VO management, universal VO discovery, service categorization and efficient information providers. Consequently, we anticipate that our Grid information service be broadly utilized through the improved service qualities.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115717695","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}
Oh-Kyoung Kwon, Jaegyoon Hahm, Sangwan Kim, Jongsuk Lee
In this paper, we describe GRASP, a grid resource allocation system based on OGSA. In order to submit job to the grid resources in more efficient and convenient manner, we support some features for user-friendly resource allocation such as resource brokering, scheduling, monitoring, and so forth. GRASP supports any scientific applications with the high performance computing features such as MPI and applications with high throughput computing features such as parameter studies.
{"title":"GRASP: a grid resource allocation system based on OGSA","authors":"Oh-Kyoung Kwon, Jaegyoon Hahm, Sangwan Kim, Jongsuk Lee","doi":"10.1109/HPDC.2004.18","DOIUrl":"https://doi.org/10.1109/HPDC.2004.18","url":null,"abstract":"In this paper, we describe GRASP, a grid resource allocation system based on OGSA. In order to submit job to the grid resources in more efficient and convenient manner, we support some features for user-friendly resource allocation such as resource brokering, scheduling, monitoring, and so forth. GRASP supports any scientific applications with the high performance computing features such as MPI and applications with high throughput computing features such as parameter studies.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122615270","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}
Distributed hash tables (DHTs) provide a scalable mechanism of mapping keys onto values. DHTs are designed for fully decentralized, yet efficient object location in peer-to-peer systems. The ad-hoc and dynamic nature of P2P networks motivated existing DHTs to keep only minimum state per node, resulting in relatively long routing paths. Moreover, since the storage in existing P2P systems is essentially "free", its utilization has not been the primary focus of DHT design, resulting in systems with poor utilization. We present fixed prefix network (FPN), a prefix-based DHT designed for future commercial P2P systems supporting applications like distributed archive repository and distributed DNS. Unlike traditional P2P, the new breed is built on the assumption that the contributed resources are dedicated to the system, and are significantly more stable. Exploiting this characterization, FPN allows trading of state size for routing length, making it possible to maintain short fixed path lengths for a wide range of number of nodes. Moreover, FPN guarantees the minimum storage utilization, and in practice can deliver an 80% utilization during the lifetime of a growing system. Finally, FPN is based on a simple concept, yet delivers scalability and robustness similar to other DHTs.
{"title":"FPN: a distributed hash table for commercial applications","authors":"C. Dubnicki, C. Ungureanu, W. Kilian","doi":"10.1109/HPDC.2004.14","DOIUrl":"https://doi.org/10.1109/HPDC.2004.14","url":null,"abstract":"Distributed hash tables (DHTs) provide a scalable mechanism of mapping keys onto values. DHTs are designed for fully decentralized, yet efficient object location in peer-to-peer systems. The ad-hoc and dynamic nature of P2P networks motivated existing DHTs to keep only minimum state per node, resulting in relatively long routing paths. Moreover, since the storage in existing P2P systems is essentially \"free\", its utilization has not been the primary focus of DHT design, resulting in systems with poor utilization. We present fixed prefix network (FPN), a prefix-based DHT designed for future commercial P2P systems supporting applications like distributed archive repository and distributed DNS. Unlike traditional P2P, the new breed is built on the assumption that the contributed resources are dedicated to the system, and are significantly more stable. Exploiting this characterization, FPN allows trading of state size for routing length, making it possible to maintain short fixed path lengths for a wide range of number of nodes. Moreover, FPN guarantees the minimum storage utilization, and in practice can deliver an 80% utilization during the lifetime of a growing system. Finally, FPN is based on a simple concept, yet delivers scalability and robustness similar to other DHTs.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115068765","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}
Data privacy is a major threat to the widespread deployment of data grids in domains such as health care and finance. We propose a novel technique for obtaining knowledge - by way of a data mining model - from a data grid, while ensuring that the privacy is cryptographically secure. To the best of our knowledge, all previous approaches for solving this problem fail in the presence of malicious participants. In this paper we present an algorithm which, in addition to being secure against malicious members, is asynchronous, involves no global communication patterns, and dynamically adjusts to new data or newly added resources. As far as we know, this is the first privacy-presenting data mining algorithm to possess these features in the presence of malicious participants. Simulations of thousands of resources prove that our algorithm quickly converges to the correct result. The simulations also prove that the effect of the privacy parameter on the convergence time is logarithmic.
{"title":"Privacy-preserving data mining on data grids in the presence of malicious participants","authors":"Bobi Gilburd, A. Schuster, R. Wolff","doi":"10.1109/HPDC.2004.29","DOIUrl":"https://doi.org/10.1109/HPDC.2004.29","url":null,"abstract":"Data privacy is a major threat to the widespread deployment of data grids in domains such as health care and finance. We propose a novel technique for obtaining knowledge - by way of a data mining model - from a data grid, while ensuring that the privacy is cryptographically secure. To the best of our knowledge, all previous approaches for solving this problem fail in the presence of malicious participants. In this paper we present an algorithm which, in addition to being secure against malicious members, is asynchronous, involves no global communication patterns, and dynamically adjusts to new data or newly added resources. As far as we know, this is the first privacy-presenting data mining algorithm to possess these features in the presence of malicious participants. Simulations of thousands of resources prove that our algorithm quickly converges to the correct result. The simulations also prove that the effect of the privacy parameter on the convergence time is logarithmic.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130095676","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}
Lambda-grids are richly interconnected collections of plentiful, geographically-distributed computing and storage resources. This rich connectivity is enabled by dedicated dense wavelength division multiplexing (DWDM) optical paths. With abundant bandwidth in the center of the network (many DWDM links), contention and sharing bottlenecks move from the network core to end systems. In such networks, traditional TCP is insufficient to provide acceptable performance. We identify the key communication characteristics of this radically different network, introducing a new multipoint-to-point communication pattern for data-intensive application. We evaluate several promising rate-based data transport protocols (RBUDP, SABUL/UDT and GTP) for lambda-grids under a range of communication patterns (single stream, multiple parallel streams, converging streams, and rapid transitions). Our experiments use a range of performance metrics, including sustained throughput and loss rate, inter- and intra-protocol fairness, protocol overhead, and rate adaptation speed to flow transitions. The results provide insights into the capabilities of these three protocols and also for improvements in design and implementation of rate-based protocols.
{"title":"Evaluation of rate-based transport protocols for lambda-grids","authors":"Xinran Wu, A. Chien","doi":"10.1109/HPDC.2004.13","DOIUrl":"https://doi.org/10.1109/HPDC.2004.13","url":null,"abstract":"Lambda-grids are richly interconnected collections of plentiful, geographically-distributed computing and storage resources. This rich connectivity is enabled by dedicated dense wavelength division multiplexing (DWDM) optical paths. With abundant bandwidth in the center of the network (many DWDM links), contention and sharing bottlenecks move from the network core to end systems. In such networks, traditional TCP is insufficient to provide acceptable performance. We identify the key communication characteristics of this radically different network, introducing a new multipoint-to-point communication pattern for data-intensive application. We evaluate several promising rate-based data transport protocols (RBUDP, SABUL/UDT and GTP) for lambda-grids under a range of communication patterns (single stream, multiple parallel streams, converging streams, and rapid transitions). Our experiments use a range of performance metrics, including sustained throughput and loss rate, inter- and intra-protocol fairness, protocol overhead, and rate adaptation speed to flow transitions. The results provide insights into the capabilities of these three protocols and also for improvements in design and implementation of rate-based protocols.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134080006","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}
Jonathan Weinberg, A. Jagatheesan, Allen Ding, M. Faerman, Yuanfang Hu
While conventional workflow systems have been around for many years, the deployment of analogous systems onto a grid infrastructure introduces a number of unique questions and challenges. Innovative approaches to grid workflow (gridflow) are needed to leverage the heterogeneity, autonomy, dynamic behavior, and wide-area distribution that characterize grid resources. The Matrix Project carries out research and development to deliver the language descriptions and protocols necessary to build collaborative gridflow management systems for the emerging grid infrastructures. We describe here our activities to date including development of the data grid language (DGL) and the usage of the matrix gridflow management system by the Southern California Earthquake Center (SCEC) to manage its gridflows.
{"title":"Gridflow description, query, and execution at SCEC using the SDSC matrix","authors":"Jonathan Weinberg, A. Jagatheesan, Allen Ding, M. Faerman, Yuanfang Hu","doi":"10.1109/HPDC.2004.20","DOIUrl":"https://doi.org/10.1109/HPDC.2004.20","url":null,"abstract":"While conventional workflow systems have been around for many years, the deployment of analogous systems onto a grid infrastructure introduces a number of unique questions and challenges. Innovative approaches to grid workflow (gridflow) are needed to leverage the heterogeneity, autonomy, dynamic behavior, and wide-area distribution that characterize grid resources. The Matrix Project carries out research and development to deliver the language descriptions and protocols necessary to build collaborative gridflow management systems for the emerging grid infrastructures. We describe here our activities to date including development of the data grid language (DGL) and the usage of the matrix gridflow management system by the Southern California Earthquake Center (SCEC) to manage its gridflows.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132017249","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}
Resource borrowing is a common underlying approach in grid computing and thin-client computing. In both cases, external processes borrow resources that would otherwise be delivered to the interactive processes of end-users, creating contention that slows these processes and decreases the comfort of the end-users. How resource borrowing and user comfort are related is not well understood and thus resource borrowing tends to be extremely conservative. To address this lack of understanding, we have developed a sophisticated distributed application for directly measuring user comfort with the borrowing of CPU time, memory space, and disk bandwidth. Using this tool, we have conducted a controlled user study with qualitative and quantitative results that are of direct interest to the designers of grid and thin-client systems. We have found that resource borrowing can be quite aggressive without creating user discomfort, particularly in the case of memory and disk. We also describe an on-going Internet-wide study using our tool.
{"title":"Measuring and understanding user comfort with resource borrowing","authors":"A. Gupta, Bin Lin, P. Dinda","doi":"10.1109/HPDC.2004.21","DOIUrl":"https://doi.org/10.1109/HPDC.2004.21","url":null,"abstract":"Resource borrowing is a common underlying approach in grid computing and thin-client computing. In both cases, external processes borrow resources that would otherwise be delivered to the interactive processes of end-users, creating contention that slows these processes and decreases the comfort of the end-users. How resource borrowing and user comfort are related is not well understood and thus resource borrowing tends to be extremely conservative. To address this lack of understanding, we have developed a sophisticated distributed application for directly measuring user comfort with the borrowing of CPU time, memory space, and disk bandwidth. Using this tool, we have conducted a controlled user study with qualitative and quantitative results that are of direct interest to the designers of grid and thin-client systems. We have found that resource borrowing can be quite aggressive without creating user discomfort, particularly in the case of memory and disk. We also describe an on-going Internet-wide study using our tool.","PeriodicalId":446429,"journal":{"name":"Proceedings. 13th IEEE International Symposium on High performance Distributed Computing, 2004.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114737451","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
扫码关注我们
求助内容：
应助结果提醒方式：