Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)最新文献

{"title":"Maestro-VC: a paravirtualized execution environment for secure on-demand cluster computing","authors":"Nadir Kiyanclar, G. Koenig, W. Yurcik","doi":"10.1109/CCGRID.2006.152","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.152","url":null,"abstract":"Virtualization, a technology first developed for partitioning the resources of mainframe computers, has seen a resurgence in popularity in the realm of commodity workstation computers. This paper introduces Maestro-VC, a system which explores a novel use of VMs as the building blocks of entire virtual clusters (VCs). Virtualization of entire clusters is beneficial because existing parallel code can run without modification in the virtual environment. At the same time, inserting a layer of software between a virtual cluster and native hardware allows for security enforcement and flexible resource management in a manner transparent to running parallel code. In this paper we describe the design and implementation of Maestro-VC, and give the results of some preliminary performance experiments","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121543779","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}

{"title":"GDSA: A Grid-Based Distributed Simulation Architecture","authors":"Suihui Zhu, Zhihui Du, X. Chai","doi":"10.1109/CCGRID.2006.138","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.138","url":null,"abstract":"This paper focuses on architecture suitable for large-scale simulation system. Based on the scenario of large-scale Internet simulation, the grid technology is introduced and a new architecture, GDSA is proposed. GDSA, a full grid-based architecture mainly focuses on four pending problems in distributed system: scalability, communications, management mechanism and QoS insurance computing environment. The advantages of grid in scalability and uniform communication will be used to improve system's scalability and communication method. Management system will be built according to meta-service mechanism. Contractual computing mechanism (CCM), a special mechanism added in GDSA, will provide QoS insurance for users. Three-layer QoS model, which is the core of CCM, will take charge of QoS problems in different levels. At the end, a prototype is designed and the experiment results based on this platform show that GDSA is a promising system to overcome the pending problems in distributed simulation","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124782104","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}

{"title":"Adaptive policing for token-exchange based management of shared computing resources","authors":"P. Xavier, Wentong Cai, Bu-Sung Lee","doi":"10.1109/CCGRID.2006.13","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.13","url":null,"abstract":"Resource contention on shared resources occurs when workload demands exceed the aggregate capacity of shared resources in the community. The token-exchange incentive scheme is traditionally employed to motivate organizations to contribute sufficiently to the community, as a means to minimize free riding. The same incentive scheme can concurrently be used to serve as a mechanism for performing admission control on jobs submitted by users. However, due to the likelihood of fluctuations in demand for computing resources, the initial assignment of tokens on the basis of each organization's resource contribution may have a significant impact on the performance trade-off between fairness and the system admission ratio. To address this problem, we extend the token-exchange scheme by designing trading policies that are responsive to the instantaneous degree of contention, so that, the trade-off between fairness and the admission ratio is less sensitive to the actual quantity of tokens assigned to each organization.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122065759","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}

{"title":"OGSA-DAI and bioinformatics grids: challenges, experience and strategies","authors":"S. Crompton, B. Matthews, W. A. Gray, Andrew C. Jones, R. White, J. S. Pahwa","doi":"10.1109/CCGRID.2006.75","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.75","url":null,"abstract":"OGSA-DAI is an open-source middleware designed to facilitate the access and integration of distributed heterogeneous data resources. It provides a ready-made framework that promotes locality and product transparency to connect data resources to the grid environment. This paper reports on the evaluation of OGSA-DAI for bioinformatics grid applications by the BioDA project. We based our study on dialogue with OGSA-DAI and grid project developers as well as through practical case studies involving current projects. We also reveal the challenges and strategies in developing an OGSA-DAI exemplar for one of these projects, BiodiversityWorld - a grid-based problem solving environment that specializes in the exploration and analysis of patterns in global biodiversity. Finally, we summarize the key issues for projects considering adopting OGSA-DAI.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128371263","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}

{"title":"Designing Efficient Cooperative Caching Schemes for Multi-Tier Data-Centers over RDMA-enabled Networks","authors":"S. Narravula, Hyun-Wook Jin, K. Vaidyanathan, D. Panda","doi":"10.1109/CCGRID.2006.33","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.33","url":null,"abstract":"Caching has been a very important technique in improving the performance and scalability of web-serving datacenters. The research community has proposed cooperation of caching servers to achieve higher performance benefits. These existing cooperative caching mechanisms often partially duplicate the cached data redundantly on multiple servers for higher performance (by optimizing the datafetch costs for multiple similar requests). With the advent of RDMA enabled interconnects these basic data-fetch cost estimates have changed significantly. Further, the effective utilization of the vast resources available across multiple tiers in today’s data-centers is of obvious interest. Hence, a systematic study of these various issues involved is of paramount importance. In this paper, we present several cooperative caching schemes that are designed to benefit in the light of the above mentioned trends. In particular, we design schemes that take advantage of the RDMA capabilities of networks and the multitude of resources available in modern multi-tier data-centers. Our designs are implemented on InfiniBand based clusters to work in conjunction with Apache based servers. Our experimental results show that our schemes achieve a throughput improvement of up to 35% as compared to the basic cooperative caching schemes and 180% better than the simple single node caching schemes. Our experimental results lead us to a new scheme which can deliver good performance in many Caching has been a very important technique in improving the performance and scalability of web-serving datacenters. The research community has proposed cooperation of caching servers to achieve higher performance benefits. These existing cooperative caching mechanisms often partially duplicate the cached data redundantly on multiple servers for higher performance (by optimizing the datafetch costs for multiple similar requests). With the advent of RDMA enabled interconnects these basic data-fetch cost estimates have changed significantly. Further, the effective utilization of the vast resources available across multiple tiers in today’s data-centers is of obvious interest. Hence, a systematic study of these various issues involved is of paramount importance. In this paper, we present several cooperative caching schemes that are designed to benefit in the light of the above mentioned trends. In particular, we design schemes that take advantage of the RDMA capabilities of networks and the multitude of resources available in modern multi-tier data-centers. Our designs are implemented on InfiniBand based clusters to work in conjunction with Apache based servers. Our experimental results show that our schemes achieve a throughput improvement of up to 35% as compared to the basic cooperative caching schemes and 180% better than the simple single node caching schemes. Our experimental results lead us to a new scheme which can deliver good performance in many scenarios.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128337207","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}

{"title":"The Development of a Computational Grid Portal","authors":"Weicheng Huang, Chien-Lin Huang, Chien-Heng Wu","doi":"10.1109/CCGRID.2006.177","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.177","url":null,"abstract":"It is the goal of this paper to present the motivation for the development and the implementation of a computational portal aiming at processing generic HPC applications. The requirements of such a portal lead to it evolvement to the utilization of Globus, Liferay as the middleware and portal framework. The portal aims to become a generic computing intensive platform, from user management, through job submission, execution and management over grid resources and the visualization of the results in the future. The portals implemented also provide portability across the JSR168 compliant portal containers. These features, along with the implementation details are presented. The potential future directions are also sketched for the project","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130653026","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}

{"title":"Statistical data reduction for efficient application performance monitoring","authors":"Lingyun Yang, J. Schopf, C. Dumitrescu, Ian T Foster","doi":"10.1109/CCGRID.2006.97","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.97","url":null,"abstract":"There is a growing need for systems that can monitor and analyze application performance data automatically in order to deliver reliable and sustained performance to applications. However, the continuously growing complexity of high performance computer systems and applications makes this process difficult. We introduce a statistical data reduction method that can be used to guide the selection of system metrics that are both necessary and sufficient to describe observed application behavior, thus reducing the instrumentation perturbation and data volume to be managed. To evaluate our strategy, we applied it to one CPU-bound grid application using cluster machines and GridFTP data transfer in a wide area testbed. A comparative study shows that our strategy produces better results than other techniques. It can reduce the number of system metrics to be managed by about 80%, while still capturing enough information for performance predictions.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131145009","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}

{"title":"Learning-based negotiation strategies for grid scheduling","authors":"Jiada Li, R. Yahyapour","doi":"10.1109/CCGRID.2006.66","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.66","url":null,"abstract":"One of the key requirements for grid infrastructures is the ability to share resources with nontrivial qualities of service. However, resource management in a decentralized infrastructure is a complex task as it has to cope with different policies and objectives of the different resource providers and the resource users. Recent research indicates that agreement-based resource management will solve many of these problems as it supports the reliable interaction between different providers and users. Here, negotiation is needed to create such bi-lateral agreements between grid parties. Such negotiation processes should be automated with no or minimal human interaction, considering the potential scale of grid systems and the amount of necessary transactions. Therefore, strategic negotiation models play an important role. In this paper, a negotiation model and learning-based negotiation strategies are proposed and examined. Simulations have been conducted to evaluate the presented system. The results demonstrate that the proposed negotiation model and the learning based negotiation strategies are suitable and effective for grid environments.","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132312196","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}

{"title":"Security issues in on-demand grid and cluster computing","authors":"Matthew Smith, M. Engel, T. Friese, Bernd Freisleben, G. Koenig, W. Yurcik","doi":"10.1109/CCGRID.2006.164","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.164","url":null,"abstract":"In this paper, security issues in on-demand grid and cluster computing are analyzed, a corresponding threat model is presented and the challenges with respect to authentication, authorization, delegation and single sign-on, secure communication, auditing, safety, and confidentiality are discussed. Three different levels of on-demand computing are identified, based on the number of resource providers, solution producers and users, and the trust relationships between them. It is argued that the threats associated with the first two levels can be handled by employing operating system virtualization technologies based on Xen, whereas the threats of the third level require the use of hardware security modules proposed in the context of the Trusted Computing Platform Alliance (TCPA). The presented security mechanisms increase the resilience of the service hosting environment against both malicious attacks and erroneous code. Thus, our proposal paves the way for large scale hosting of grid or Web services in commercial scenarios","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132841393","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}

{"title":"Survival of the Internet applications: a cluster recovery model","authors":"Khin Mi Mi Aung, Kiejin Park, Jong Sou Park","doi":"10.1109/CCGRID.2006.176","DOIUrl":"https://doi.org/10.1109/CCGRID.2006.176","url":null,"abstract":"Internet applications become increasingly widely used for millions of people in the world and on the other hand the accidents or disruptions of service are also dramatically increasing. Accidents or disruptions occur either because of disasters or because of malicious attacks. The disasters could not be completely prevented. Prevention is a necessary but not a sufficient component of disaster. In this case, we have to prepare thoroughly for reducing the recovery time and get the users back to work faster. In this paper, we present a cluster recovery model to increase the survivability level of Internet applications. We construct a state transition model to describe the behaviors of cluster systems. By mapping through recovery actions to this transition model with stochastic process, we capture system behaviors as well as we get mathematical steady-state solutions of that chain. We first carry out for steady-state behaviors leading to measures like steady-state availability. By transforming this model with the system states we compute a system measure, the mean time to repair (MTTR) and also compute probabilities of cluster systems failures due in face of disruptions. Our model with the recovery actions have several benefits, which include reducing the time to get the users back to work and making recovery performance insensitive to the selection of a failure treatment parameter","PeriodicalId":419226,"journal":{"name":"Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132903354","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}