Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)最新文献

筛选
英文 中文
An Efficient and Reliable Scientific Workflow System 高效可靠的科学工作流系统
T. Tavares, George Teodoro, T. Kurç, R. Ferreira, Dorgival Olavo Guedes Neto, Wagner Meira Jr, Ümit V. Çatalyürek, S. Hastings, S. Oster, S. Langella, J. Saltz
{"title":"An Efficient and Reliable Scientific Workflow System","authors":"T. Tavares, George Teodoro, T. Kurç, R. Ferreira, Dorgival Olavo Guedes Neto, Wagner Meira Jr, Ümit V. Çatalyürek, S. Hastings, S. Oster, S. Langella, J. Saltz","doi":"10.1109/CCGRID.2007.20","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.20","url":null,"abstract":"This paper presents a fault tolerance framework for applications that process data using a distributed network of user-defined operations in a pipelined fashion. The framework saves intermediate results and messages exchanged among application components in a distributed data management system to facilitate quick recovery from failures. The experimental results show that the framework scales well and our approach introduces very little overhead to application execution.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115865288","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}
引用次数: 10
Cooperative Caching for Grid Based DataWarehouses 基于网格的数据仓库的协同缓存
F. Dehne, Michael Lawrence
{"title":"Cooperative Caching for Grid Based DataWarehouses","authors":"F. Dehne, Michael Lawrence","doi":"10.1109/CCGRID.2007.34","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.34","url":null,"abstract":"In this paper we propose a grid-based OLAP application which distributes query computation across an enterprise grid. Our application follows a two-tiered process for answering queries based on sharing cached OLAP data between the users at the local grid site, and using grid scheduling approaches to execute the remaining parts of a query amongst a distributed set of OLAP servers. A new technique for extraction and aggregation of shared cached OLAP data is proposed, along with an efficient, aggregate-aware cache controller. An experimental evaluation of the proposed query processing and cooperative caching methods shows a significant reduction in query times compared to previously proposed methods.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131566805","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}
引用次数: 5
Design of a Scalable Peer-to-Peer Information System Using the GT4 Index Service 基于GT4索引服务的可扩展点对点信息系统设计
S. Bharathi, A. Chervenak
{"title":"Design of a Scalable Peer-to-Peer Information System Using the GT4 Index Service","authors":"S. Bharathi, A. Chervenak","doi":"10.1109/CCGRID.2007.38","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.38","url":null,"abstract":"Grid applications need efficient access to information about available resources and services. Typically, this access is provided by information services that are often organized as hierarchical systems for better scalability and performance. As the number of types and instances of information services increases, it has become challenging to set up these hierarchies efficiently. We describe the design and implementation of an information system that forwards queries among GT4 index services using an unstructured peer-to-peer overlay network. Our initial measurements show that the performance of the peer-to-peer system scales better than a centralized index service. We also discuss simple optimizations that can significantly improve system performance.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804183","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}
引用次数: 5
Requirements of Peer-to-Peer-based Massively Multiplayer Online Gaming 基于点对点的大型多人在线游戏需求
Gregor Schiele, Richard Süselbeck, Arno Wacker, J. Hähner, C. Becker, Torben Weis
{"title":"Requirements of Peer-to-Peer-based Massively Multiplayer Online Gaming","authors":"Gregor Schiele, Richard Süselbeck, Arno Wacker, J. Hähner, C. Becker, Torben Weis","doi":"10.1109/CCGRID.2007.97","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.97","url":null,"abstract":"Massively multiplayer online games have become increasingly popular. However, their operation is costly, as game servers must be maintained. To reduce these costs, we aim at providing a communication engine to develop massively multiplayer online games based on a peer-to-peer system. In this paper we analyze the requirements of such a system and present an overview of our current work.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114764298","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}
引用次数: 53
Reducing Connection Memory Requirements of MPI for InfiniBand Clusters: A Message Coalescing Approach 降低ib集群MPI连接内存需求:一种消息合并方法
Matthew J. Koop, T. Jones, D. Panda
{"title":"Reducing Connection Memory Requirements of MPI for InfiniBand Clusters: A Message Coalescing Approach","authors":"Matthew J. Koop, T. Jones, D. Panda","doi":"10.1109/CCGRID.2007.92","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.92","url":null,"abstract":"Clusters in the area of high-performance computing have been growing in size at a considerable rate. In these clusters, the dominate programming model is the Message Passing Interface (MPI), so the MPI library has a key role in resource usage and performance. To obtain maximal performance, many clusters deploy a high-speed interconnect between compute nodes. One such interconnect, InfiniBand, has been gaining in popularity due to its various features including Remote Data Memory Access (RDMA), and high-performance. As a result, it is being deployed in a significant number of clusters and has been chosen as the standard interconnect for capacity clusters within the DOE Tri-Labs. As these clusters grow in size, care must be taken to ensure the resource usage does not increase too significantly with scale. In particular, the MPI library resource usage should not grow at a rate which will exhaust the node memory or starve user applications. In this paper we present our findings of current memory usage when all connections are created and design a message coalescing method to decrease memory usage significantly. Our models show that the default configuration of MVAPICH can grow to 1GB per process for 8K processes, while our enhancements reduce usage by an order of magnitude to around 120 MB per process while maintaining near-equal performance. We have validated our design on a 575-node cluster and shown no performance degradation for a variety of applications. We also increase the message rate attainable by over 150%.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123936292","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}
引用次数: 40
Super-resolution Imaging Using Grid Computing 使用网格计算的超分辨率成像
Jing Tian, K. Ma
{"title":"Super-resolution Imaging Using Grid Computing","authors":"Jing Tian, K. Ma","doi":"10.1109/CCGRID.2007.112","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.112","url":null,"abstract":"The super-resolution (SR) imaging is to overcome the inherent limitations of the image acquisition systems to produce high-resolution images from their low-resolution counterparts. In our recent work, the Markov chain Monte Carlo (MCMC) technique has been successfully developed and shown as a promising stochastic approach for addressing the SR problem. However, the MCMC SR approach requires substantial amounts of computational resources, for it not only needs to generate a huge number of samples, but also requires an exhaustive search for obtaining an optimal prior image model. To tackle the above computation challenge, Grid computing is introduced for tackling the SR problem in this paper. The computationally- intensive MCMC SR task is broke down into a set of independent and small sub-tasks, which are further distributed and implemented in the grid computing environment. Their respective results are finally assembled to produce a high-resolution image as the final result of the entire MCMC SR task. Experiments are conducted to show that grid computing can effectively accelerating the execution time of the MCMC SR algorithm.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124267648","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}
引用次数: 5
High Performance Distributed Lock Management Services using Network-based Remote Atomic Operations 使用基于网络的远程原子操作的高性能分布式锁管理服务
S. Narravula, A. Marnidala, Abhinav Vishnu, K. Vaidyanathan, D. Panda
{"title":"High Performance Distributed Lock Management Services using Network-based Remote Atomic Operations","authors":"S. Narravula, A. Marnidala, Abhinav Vishnu, K. Vaidyanathan, D. Panda","doi":"10.1109/CCGRID.2007.58","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.58","url":null,"abstract":"There has been a massive increase in computing requirements for parallel applications. These parallel applications and supporting cluster services often need to share system-wide resources. The coordination of these applications is typically managed by a distributed lock manager. The performance of the lock manager is extremely critical for application performance. Researchers have shown that the use of two sided communication protocols, like TCP/IP (used by current generation lock managers), can have significant impact on the scalability of distributed lock managers. In addition, existing one sided communication based locking designs support locking in exclusive access mode only and can pose significant scalability limitations on applications that need both shared and exclusive access modes like cooperative/file-system caching. Hence the utility of these existing designs in high performance scenarios can be limited. In this paper, we present a novel protocol, for distributed locking services, utilizing the advanced network-level one-sided atomic operations provided by InfiniBand. Our approach augments existing approaches by eliminating the need for two sided communication protocols in the critical locking path. Further, we also demonstrate that our approach provides significantly higher performance in scenarios needing both shared and exclusive mode access to resources. Our experimental results show 39% improvement in basic locking latencies over traditional send/receive based implementations. Further, we also observe a significant (up to 317% for 16 nodes) improvement over existing RDMA based distributed queuing schemes for shared mode locking scenarios.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122170011","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}
引用次数: 32
DICHOTOMY: A Resource Discovery and Scheduling Protocol for Multihop Ad hoc Mobile Grids 一种多跳自组织移动网格资源发现和调度协议
A. A. Gomes, A. Ziviani, Luciana dos S. Lima, M. Endler
{"title":"DICHOTOMY: A Resource Discovery and Scheduling Protocol for Multihop Ad hoc Mobile Grids","authors":"A. A. Gomes, A. Ziviani, Luciana dos S. Lima, M. Endler","doi":"10.1109/CCGRID.2007.41","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.41","url":null,"abstract":"There has been a good amount of research over the past few years on the integration of mobile devices into computational grids. Little of it, however, has addressed the more challenging issue of dynamically establishing spontaneous, multihop ad hoc mobile grids, and then only in preliminary form. In such grids, resource discovery and scheduling have been traditionally approached separately in the literature. In our view, this is an inappropriate dichotomy as regards multihop ad hoc mobile grids. In this paper, we propose a resource discovery and scheduling protocol for mobility (DICHOTOMY), which allows resource provisioning to be scheduled among the most resourceful nodes in the mobile grid, while mitigating the overhead of discovery messages exchanged among them. Our experimental results in a testbed and in a simulation platform show that the protocol provides efficient load balancing between nodes under an increasing number of requests, and scales well with respect to an increasing number of nodes in comparison with traditional broadcast-based solutions for service discovery.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117335415","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}
引用次数: 38
A Semantic Approach to Enhance Service Composition in Workflows that use Mobile Services 在使用移动服务的工作流中增强服务组合的语义方法
Robert B. Piotter, T. Kirkham, Julian Robert Gallop, I. Johnson, D. Randal, B. Ritchie
{"title":"A Semantic Approach to Enhance Service Composition in Workflows that use Mobile Services","authors":"Robert B. Piotter, T. Kirkham, Julian Robert Gallop, I. Johnson, D. Randal, B. Ritchie","doi":"10.1109/CCGRID.2007.10","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.10","url":null,"abstract":"The successful execution of workflows using mobile services is dependant on the services behaving as expected. The management of this behaviour in Akogrimo is achieved by a context management framework bridging both the network and Grid middleware. The quality of the information that passes over this link is essential to the whole Akogrimo application. In order to ensure relevant and specific context information is used in Akogrimo the development of mechanism to aid network to middleware service to service understanding is essential. In creating such a mechanism the concept of self similarity in creating understanding between services is essential. The challenges and issues when applying this process to Akogrimo's unique mix of services are discussed in this paper.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123174833","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}
引用次数: 0
RABC: A Conceptual Design of Pervasive Infrastructure for Browser Computing based on Ajax technologies 基于Ajax技术的浏览器计算普适基础设施的概念设计
Fumikazu Konishi, Manabu Ishii, Shingo Ohki, Ryo Umetsu, A. Konagaya
{"title":"RABC: A Conceptual Design of Pervasive Infrastructure for Browser Computing based on Ajax technologies","authors":"Fumikazu Konishi, Manabu Ishii, Shingo Ohki, Ryo Umetsu, A. Konagaya","doi":"10.1109/CCGRID.2007.91","DOIUrl":"https://doi.org/10.1109/CCGRID.2007.91","url":null,"abstract":"We have developed the RIKEN AJAX browser computing (RABC) system. This system enables the simple realization of large scale Global Computing systems, like the SETI@home project, that take advantage of unused computing resources. Its greatest advantage is that an agent program, which has been traditionally required, does not need to be installed. Volunteers can participate by simply browsing to a Web page provided by the RABC system. This system allows greater CPU cycle resources to be acquired than traditional methods. We have evaluated a performance difference between JavaScript and legacy computer languages.","PeriodicalId":278535,"journal":{"name":"Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid '07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115820654","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}
引用次数: 9
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信