HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.最新文献_第3页

Supporting application-tailored grid file system sessions with WSRF-based services 使用基于wsrf的服务支持应用程序定制的网格文件系统会话

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520930

Ming Zhao, Vineet Chadha, Renato J. O. Figueiredo

{"title":"Supporting application-tailored grid file system sessions with WSRF-based services","authors":"Ming Zhao, Vineet Chadha, Renato J. O. Figueiredo","doi":"10.1109/HPDC.2005.1520930","DOIUrl":"https://doi.org/10.1109/HPDC.2005.1520930","url":null,"abstract":"This paper presents novel service-based grid data management middleware that leverages standards defined by WSRF specifications to create and manage dynamic grid file system sessions. A unique aspect of the service is that the sessions it creates can be customized to address application data transfer needs. Application-tailored configurations enable selection of both performance-related features (block-based partial file transfers and/or whole-file transfers, cache parameters and consistency models) and reliability features (file system copy-on-write checkpointing to aid recovery of client-side failures; replication, autonomous failure detection and data access redirection for server-side failures). These enhancements, in addition to cross-domain user identity mapping and encrypted communication, are implemented via user level proxies managed by the service, requiring no changes to existing kernels. Sessions established using the service is mounted as distributed file systems and can be used transparently by unmodified binary applications. The paper analyzes the use of the service to support virtual machine based grid systems and workflow execution, and also reports on the performance and reliability of service managed wide-area file system sessions with experiments based on scientific applications (NanoMOS/Matlab, CHID, GAUSS and SPECseis).","PeriodicalId":120564,"journal":{"name":"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128205230","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}

引用次数: 17

Collective caching: application-aware client-side file caching 集体缓存:应用程序感知的客户端文件缓存

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520940

W. Liao, Kenin Coloma, A. Choudhary, L. Ward, E. Russell, Sonja Tideman

{"title":"Collective caching: application-aware client-side file caching","authors":"W. Liao, Kenin Coloma, A. Choudhary, L. Ward, E. Russell, Sonja Tideman","doi":"10.1109/HPDC.2005.1520940","DOIUrl":"https://doi.org/10.1109/HPDC.2005.1520940","url":null,"abstract":"Parallel file subsystems in today's high-performance computers adopt many I/O optimization strategies that were designed for distributed systems. These strategies, for instance client-side file caching, treat each I/O request process independently, due to the consideration that clients are unlikely related with each other in a distributed environment. However, it is inadequate to apply such strategies directly in the high-performance computers where most of the I/O requests come from the processes that work on the same parallel applications. We believe that client-side caching could perform more effectively if the caching subsystem is aware of the process scope of an application and regards all the application processes as a single client. In this paper, we propose the idea of \"collective caching\" which coordinates the application processes to manage cache data and achieve cache coherence without involving the I/O servers. To demonstrate this idea, we implemented a collective caching subsystem at user space as a library, which can be incorporated into any message passing interface implementation to increase its portability. The performance evaluation is presented with three I/O benchmarks on an IBM SP using its native parallel file system, GPFS. Our results show significant performance enhancement obtained by collective caching over the traditional approaches.","PeriodicalId":120564,"journal":{"name":"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130370377","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}

引用次数: 68

Towards P2P-routed IF overlay networks for grid virtual machines 面向网格虚拟机的p2p中频覆盖网络研究

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520981

Abhishek Agrawal, Arijit Ganguly, P. Boykin, R. Figueiredo

引用次数: 0

Assessment and enhancement of meta-schedulers for multi-site job sharing 多站点作业共享的元调度器的评估和增强

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520949

Gerald Sabin, Vishvesh Sahasrabudhe, P. Sadayappan

引用次数: 18

State and events for Web services: a comparison of five WS-resource framework and WS-notification implementations Web服务的状态和事件:五个WS-resource框架和WS-notification实现的比较

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520928

M. Humphrey, G. Wasson, K. Jackson, Joshua Boverhof, Matt Rodriguez, Jarek Gawor, J. Bester, S. Lang, Ian T Foster, Sam Meder, S. Pickles, M. McKeown

引用次数: 96

A case study of instant workbench for InterProScan by Knoppix high throughput computing edition 基于Knoppix高通量计算版的InterProScan即时工作台的案例研究

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520985

Fumikazu Konishi, Shingo Ohki, Yusuke Hamano, Manabu Ishii

引用次数: 0

411 on scalable password service 411可扩展的密码服务

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520963

Federico D. Sacerdoti, M. Katz, P. Papadopoulos

引用次数: 2

Interest-aware information dissemination in small-world communities 小世界社区关注利益的信息传播

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520954

Adriana Iamnitchi, Ian T Foster

{"title":"Interest-aware information dissemination in small-world communities","authors":"Adriana Iamnitchi, Ian T Foster","doi":"10.1109/HPDC.2005.1520954","DOIUrl":"https://doi.org/10.1109/HPDC.2005.1520954","url":null,"abstract":"Information dissemination is a fundamental and frequently occurring problem in large, dynamic, distributed systems. We propose a novel approach to this problem, interest-aware information dissemination, that takes advantage of small-world usage patterns in data-sharing communities. These small-world characteristics suggest that users naturally form groups of common interest. We propose algorithms for identifying these groups dynamically, without a need for explicit classification of topics or declaration of user interests. These algorithms use information about the data consumed by users to identify, via online computation, groups with similar interests. As a proof of concept, we apply this methodology to the problem of locating files in large user communities. Using real-world traces from a scientific community and from a peer-to-peer system, we show that proactive information dissemination within groups of common interest can reduce the search load by up to 70%. In addition, this approach naturally supports the efficient discovery of collections of files, a requirement specific to scientific data analysis tasks. We hypothesize that our algorithms can find numerous other uses in distributed systems, such as reputation management.","PeriodicalId":120564,"journal":{"name":"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124197357","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}

引用次数: 45

A framework for efficient inconsistency detection in a grid and Internet-scale distributed environment 在网格和互联网规模的分布式环境中有效检测不一致的框架

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520993

Yijun Lu, Hong Jiang

引用次数: 6

Adaptive data block scheduling for parallel TCP streams 并行TCP流的自适应数据块调度

HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005. Pub Date : 2005-07-24 DOI: 10.1109/HPDC.2005.1520970

T. Hacker, Brian D. Noble, B. Athey

{"title":"Adaptive data block scheduling for parallel TCP streams","authors":"T. Hacker, Brian D. Noble, B. Athey","doi":"10.1109/HPDC.2005.1520970","DOIUrl":"https://doi.org/10.1109/HPDC.2005.1520970","url":null,"abstract":"Applications that use parallel TCP streams to increase throughput must multiplex and demultiplex data blocks over a set of TCP streams transmitting on one or more network paths. When applications use the obvious round robin scheduling algorithm for multiplexing data blocks, differences in transmission rate between individual TCP streams can lead to significant data block reordering. This forces the demultiplexing receiver to buffer out-of-order data blocks, consuming memory and potentially causing the receiving application to stall. This paper describes a new adaptive weighted scheduling approach for multiplexing data blocks over a set of parallel TCP streams. Our new scheduling approach, compared with the scheduling approached used by GridFTP, reduces reordering of data blocks between individual TCP streams, maintains the aggregate throughput gains of parallel TCP, consumes less receiver memory for buffering out-of-order packets, and delivers smoother application goodput. We demonstrate the improved characteristics of our new scheduling approach using data transmission experiments over real and emulated wide-area networks.","PeriodicalId":120564,"journal":{"name":"HPDC-14. Proceedings. 14th IEEE International Symposium on High Performance Distributed Computing, 2005.","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121988283","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}

引用次数: 54