2005 IEEE International Conference on Cluster Computing最新文献_第8页

Scalable Consistency Management in Dynamic Content Distribution Overlays 动态内容分布覆盖中的可扩展一致性管理

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347082

Zhou Su, J. Katto, Yasuhiko Yasuhiko

引用次数: 1

Analysis of Distributed Java Applications Using Dynamic Instrumentation 使用动态检测的分布式Java应用分析

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347065

Clovis Seragiotto, T. Fahringer

引用次数: 2

Head-to-TOE Evaluation of High-Performance Sockets over Protocol Offload Engines 基于协议卸载引擎的高性能套接字从头到脚的评估

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347068

P. Balaji, Wu-chun Feng, Qi Gao, R. Noronha, Weikuan Yu, D. Panda

{"title":"Head-to-TOE Evaluation of High-Performance Sockets over Protocol Offload Engines","authors":"P. Balaji, Wu-chun Feng, Qi Gao, R. Noronha, Weikuan Yu, D. Panda","doi":"10.1109/CLUSTR.2005.347068","DOIUrl":"https://doi.org/10.1109/CLUSTR.2005.347068","url":null,"abstract":"Despite the performance drawbacks of Ethernet, it still possesses a sizable footprint in cluster computing because of its low cost and backward compatibility to existing Ethernet infrastructure. In this paper, we demonstrate that these performance drawbacks can be reduced (and in some cases, arguably eliminated) by coupling TCP offload engines (TOEs) with 10-Gigabit Ethernet (10GigE). Although there exists significant research on individual network technologies such as 10GigE, InfiniBand (IBA), and Myrinet; to the best of our knowledge, there has been no work that compares the capabilities and limitations of these technologies with the recently introduced 10GigE TOEs in a homogeneous experimental testbed. Therefore, we present performance evaluations across 10GigE, IBA, and Myrinet (with identical cluster-compute nodes) in order to enable a coherent comparison with respect to the sockets interface. Specifically, we evaluate the network technologies at two levels: (i) a detailed micro-benchmark evaluation and (ii) an application-level evaluation with sample applications from different domains, including a bio-medical image visualization tool known as the Virtual Microscope, an iso-surface oil reservoir simulator, a cluster file-system known as the parallel virtual file-system (PVFS), and a popular cluster management tool known as Ganglia. In addition to 10GigE's advantage with respect to compatibility to wide-area network infrastructures, e.g., in support of grids, our results show that 10GigE also delivers performance that is comparable to traditional high-speed network technologies such as IBA and Myrinet in a system-area network environment to support clusters and that 10GigE is particularly well-suited for sockets-based applications","PeriodicalId":255312,"journal":{"name":"2005 IEEE International Conference on Cluster Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123005195","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}

引用次数: 23

An Efficient, Nonintrusive, Log-Based I/O Mechanism for Scientific Simulations on Clusters 一种高效、非侵入式、基于日志的集群科学模拟I/O机制

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347041

Soumyadeb Mitra, R. Sinha, M. Winslett, X. Jiao

{"title":"An Efficient, Nonintrusive, Log-Based I/O Mechanism for Scientific Simulations on Clusters","authors":"Soumyadeb Mitra, R. Sinha, M. Winslett, X. Jiao","doi":"10.1109/CLUSTR.2005.347041","DOIUrl":"https://doi.org/10.1109/CLUSTR.2005.347041","url":null,"abstract":"Scientific simulations are often very I/O intensive, requiring high I/O bandwidth to store the data generated by the simulation. Traditional supercomputers have specialized I/O systems with multiple I/O nodes and specialized interconnects to handle such high I/O loads. However, with the increased availability of inexpensive clusters of workstations, more and more simulations are now run on clusters. Unfortunately, cluster supercomputers are usually not very well equipped for I/O, making I/O a serious bottleneck for such applications. To address this problem, we propose log-based I/O (LBIO), an approach that can substantially increase the I/O performance of simulations on clusters by utilizing free space on the cluster's local disks to stage data on its way to remote storage. LBIO uses local disks to create a log of all I/O calls, and uses a background thread to replay the log at the rate that best utilizes the server and network resources. LBIO is implemented as an easy-to-use, non-intrusive library - a user can turn on LBIO by adding a single initialization call to the simulation code. LBIO also works with existing scientific I/O libraries like HDF, as well as collective libraries like ROMIO. Our performance studies on microbenchmarks and a real-world scientific simulation code show that LBIO can provide upto 35% improvement in I/O performance for raw I/O and over 50% for I/O through libraries like ROMIO or HDF","PeriodicalId":255312,"journal":{"name":"2005 IEEE International Conference on Cluster Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123508901","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

Supporting iWARP Compatibility and Features for Regular Network Adapters 支持iWARP的兼容性和功能，为普通的网络适配器

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347032

P. Balaji, Hyun-Wook Jin, K. Vaidyanathan, D. Panda

{"title":"Supporting iWARP Compatibility and Features for Regular Network Adapters","authors":"P. Balaji, Hyun-Wook Jin, K. Vaidyanathan, D. Panda","doi":"10.1109/CLUSTR.2005.347032","DOIUrl":"https://doi.org/10.1109/CLUSTR.2005.347032","url":null,"abstract":"With several recent initiatives in the protocol offloading technology present on network adapters, the user market is now distributed amongst various technology levels including regular Ethernet network adapters, TCP Offload Engines (TOEs) and the recently introduced iWARP-capable networks. While iWARP-capable networks provide all the features provided by their predecessors (TOEs and regular Ethernet network adapters) and a new richer programming interface, they lack with respect to backward compatibility. In this aspect, two important issues need to be considered. First, not all network adapters support iWARP; thus, software compatibility for regular network adapters (which have no offloaded protocol stack) with iWARP capable network adapters needs to be achieved. Second, several applications on top of regular Ethernet as well as TOE based adapters have been written with the sockets interface; rewriting such applications using the new iWARP interface is cumbersome and impractical. Thus, it is desirable to have an interface which provides a two-fold benefit: (i) it allows existing applications to run directly without any modifications and (ii) it exposes the richer feature set of iWARP to the applications to be utilized with minimal modifications. In this paper, we design and implement a software stack to handle these issues. Specifically, (i) the software stack emulates the functionality of the iWARP stack in software to provide compatibility for regular Ethernet adapters with iWARP capable networks and (ii) it provides applications with an extended sockets interface that provides the traditional sockets functionality as well as functionality extended with the rich iWARP features","PeriodicalId":255312,"journal":{"name":"2005 IEEE International Conference on Cluster Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123586245","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

An Efficient Network API for in-Kernel Applications in Clusters 集群中内核应用程序的高效网络API

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347044

Brice Goglin, Olivier Glück, P. Primet

引用次数: 15

TCP Adaptation for MPI on Long-and-Fat Networks 长胖网络中MPI的TCP适配

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347034

Motohiko Matsuda, T. Kudoh, Yuetsu Kodama, Ryousei Takano, Y. Ishikawa

引用次数: 20

Service Level Agreement based Allocation of Cluster Resources: Handling Penalty to Enhance Utility 基于服务水平协议的集群资源分配:处理惩罚以提高效用

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347075

Chee Shin Yeo, R. Buyya

引用次数: 150

TreeP: A Tree Based P2P Network Architecture TreeP:基于树的P2P网络架构

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347022

B. Hudzia, Mohand Tahar Kechadi, A. Ottewill

引用次数: 31

An Efficient Metadata Distribution Policy for Cluster File Systems 一种高效的集群文件系统元数据分发策略

2005 IEEE International Conference on Cluster Computing Pub Date : 2005-09-01 DOI: 10.1109/CLUSTR.2005.347060

Jin Xiong, Rongfeng Tang, S. Wu, Dan Meng, Ninghui Sun

引用次数: 3