2015 IEEE International Conference on Cluster Computing最新文献_第4页

A LogP Extension for Modeling Tree Aggregation Networks 树聚集网络建模的LogP扩展

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.117

Taylor L. Groves, S. Gutierrez, D. Arnold

{"title":"A LogP Extension for Modeling Tree Aggregation Networks","authors":"Taylor L. Groves, S. Gutierrez, D. Arnold","doi":"10.1109/CLUSTER.2015.117","DOIUrl":"https://doi.org/10.1109/CLUSTER.2015.117","url":null,"abstract":"As high-performance systems continue to expand in power and size, scalable communication and data transfer is necessary to facilitate next generation monitoring and analysis. Many popular frameworks such as MapReduce, MPI and MRNet utilize scalable reduction operations to fulfill the performance requirements of a large distributed system. The structures to handle these aggregations may simply consist of a single level with children reporting directly to the parent node, or it may be layered to create a large tree with varying breadth and height. Despite their common-place, the techniques for modeling these Tree Aggregation Networks (TANs) are lacking. This paper addresses this need by introducing a novel extension of the LogP framework for Tree Aggregation Networks. Our TAN model adheres to the simplicity of the LogP model, but utilizes structural insights to provide a simple yet precise performance estimate. Additionally, our model makes no assumptions of the underlying NIC transfer mechanisms or uniformity of tree breadth, making it suitable for a wide range of environments. To evaluate our TAN model, we compare it against the traditional LogP model for predicting the performance of the Multicast Reduction Network (MRNet) framework.","PeriodicalId":187042,"journal":{"name":"2015 IEEE International Conference on Cluster Computing","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126670066","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}

引用次数: 3

Towards Multi-site Metadata Management for Geographically Distributed Cloud Workflows 面向地理分布式云工作流的多站点元数据管理

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.49

Luis Pineda-Morales, Alexandru Costan, Gabriel Antoniu

{"title":"Towards Multi-site Metadata Management for Geographically Distributed Cloud Workflows","authors":"Luis Pineda-Morales, Alexandru Costan, Gabriel Antoniu","doi":"10.1109/CLUSTER.2015.49","DOIUrl":"https://doi.org/10.1109/CLUSTER.2015.49","url":null,"abstract":"With their globally distributed datacenters, clouds now provide an opportunity to run complex large-scale applications on dynamically provisioned, networked and federated infrastructures. However, there is a lack of tools supporting data intensive applications across geographically distributed sites. For instance, scientific workflows which handle many small files can easily saturate state-of-the-art distributed filesystems based on centralized metadata servers (e.g. HDFS, PVFS). In this paper, we explore several alternative design strategies to efficiently support the execution of existing workflow engines across multi-site clouds, by reducing the cost of metadata operations. These strategies leverage workflow semantics in a 2-level metadata partitioning hierarchy that combines distribution and replication. The system was validated on the Microsoft Azure cloud across 4 EU and US datacenters. The experiments were conducted on 128 nodes using synthetic benchmarks and real-life applications. We observe as much as 28% gain in execution time for a parallel, geo-distributed real-world application (Montage) and up to 50% for a metadata-intensive synthetic benchmark, compared to a baseline centralized configuration.","PeriodicalId":187042,"journal":{"name":"2015 IEEE International Conference on Cluster Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126949625","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}

引用次数: 21

Towards the InfiniBand SR-IOV vSwitch Architecture ib SR-IOV vSwitch架构介绍

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.58

Evangelos Tasoulas, Ernst Gunnar Gran, Bjørn Dag Johnsen, Kyrre M. Begnum, T. Skeie

{"title":"Towards the InfiniBand SR-IOV vSwitch Architecture","authors":"Evangelos Tasoulas, Ernst Gunnar Gran, Bjørn Dag Johnsen, Kyrre M. Begnum, T. Skeie","doi":"10.1109/CLUSTER.2015.58","DOIUrl":"https://doi.org/10.1109/CLUSTER.2015.58","url":null,"abstract":"To meet the demands of the Exascale era and facilitate Big Data analytics in the cloud while maintaining flexibility, cloud providers will have to offer efficient virtualized High Performance Computing clusters in a pay-as-you-go model. As a consequence, high performance network interconnect solutions, like InfiniBand (IB), will be beneficial. Currently, the only way to provide IB connectivity on Virtual Machines (VMs) is by utilizing direct device assignment. At the same time to be scalable, Single-Root I/O Virtualization (SR-IOV) is used. However, the current SR-IOV model employed by IB adapters is a Shared Port implementation with limited flexibility, as it does not allow transparent virtualization and live-migration of VMs. In this paper, we explore an alternative SR-IOV model for IB, the virtual switch (vSwitch), and propose and analyze two vSwitch implementations with different scalability characteristics. Furthermore, as network reconfiguration time is critical to make live-migration a practical option, we accompany our proposed architecture with a scalable and topology agnostic dynamic reconfiguration method, implemented and tested using OpenSM. Our results show that we are able to significantly reduce the reconfiguration time as route recalculations are no longer needed, and in large IB subnets, for certain scenarios, the number of reconfiguration subnet management packets (SMPs) sent is reduced from several hundred thousand down to a single one.","PeriodicalId":187042,"journal":{"name":"2015 IEEE International Conference on Cluster Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127969583","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}

引用次数: 8

LU Factorization: Towards Hiding Communication Overheads with a Lookahead-Free Algorithm LU分解:用无查找算法隐藏通信开销

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.61

T. Nguyen, S. Baden

引用次数: 3

A Two-Tiered Approach to I/O Quality of Service in Docker Containers Docker容器中I/O服务质量的两层方法

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.77

Sean McDaniel, Stephen Herbein, M. Taufer

{"title":"A Two-Tiered Approach to I/O Quality of Service in Docker Containers","authors":"Sean McDaniel, Stephen Herbein, M. Taufer","doi":"10.1109/CLUSTER.2015.77","DOIUrl":"https://doi.org/10.1109/CLUSTER.2015.77","url":null,"abstract":"Linux containers allow applications to run in complete isolation from one another without the extra overhead of running entirely separate operating systems. This approach eliminates memory overheads associated with virtualization and virtual machines and helps businesses run their day-today applications. Unfortunately, multiple applications sharing the same resources can result in substantial resource contention among the applications in the containers and substantial performance loss. One way to mitigate this loss in performance is by ensuring quality of service (QoS) guaranteeing that the application of interest meets the performance requirements. Existing work targets ways of managing CPU, network, and memory contention, however, no solutions exist for managing contention associated with I/O. To address the I/O contention challenge in containers, we propose a two-tiered approach (i.e., at both the cluster and node levels) that extends Docker and Docker Swarm, making both capable of monitoring and controlling the I/O of Dockers containers. We demonstrate how our two-tiered approach has the potential for higher resource utilization without the effects of contention.","PeriodicalId":187042,"journal":{"name":"2015 IEEE International Conference on Cluster Computing","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128224447","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}

引用次数: 34

PaRSEC in Practice: Optimizing a Legacy Chemistry Application through Distributed Task-Based Execution PaRSEC在实践中:通过分布式任务执行优化遗留化学应用

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.50

Anthony Danalis, Heike Jagode, G. Bosilca, J. Dongarra

{"title":"PaRSEC in Practice: Optimizing a Legacy Chemistry Application through Distributed Task-Based Execution","authors":"Anthony Danalis, Heike Jagode, G. Bosilca, J. Dongarra","doi":"10.1109/CLUSTER.2015.50","DOIUrl":"https://doi.org/10.1109/CLUSTER.2015.50","url":null,"abstract":"Task-based execution has been growing in popularity as a means to deliver a good balance between performance and portability in the post-petascale era. The Parallel Runtime Scheduling and Execution Control (PARSEC) framework is a task-based runtime system that we designed to achieve high performance computing at scale. PARSEC offers a programming paradigm that is different than what has been traditionally used to develop large scale parallel scientific applications. In this paper, we discuss the use of PARSEC to convert a part of the Coupled Cluster (CC) component of the Quantum Chemistry package NWCHEM into a task-based form. We explain how we organized the computation of the CC methods in individual tasks with explicitly defined data dependencies between them and re-integrated the modified code into NWCHEM. We present a thorough performance evaluation and demonstrate that the modified code outperforms the original by more than a factor of two. We also compare the performance of different variants of the modified code and explain the different behaviors that lead to the differences in performance.","PeriodicalId":187042,"journal":{"name":"2015 IEEE International Conference on Cluster Computing","volume":"882 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132933880","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}

引用次数: 22

Developing MiniApps on Modern Platforms Using Multiple Programming Models 使用多种编程模型在现代平台上开发MiniApps

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.130

O. E. Messer, E. D'Azevedo, Judith C. Hill, W. Joubert, S. Laosooksathit, A. Tharrington

引用次数: 8

Pallas: An Application-Driven Task and Network Simulation Framework 一个应用驱动的任务和网络仿真框架

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.97

Yuming Ye, Ziyang Li, Dongsheng Li, Yiming Zhang, Feng Liu, Yuxing Peng

引用次数: 0

ObsCon: Integrated Monitoring and Control for Parallel, Real-Time Applications 并行、实时应用的集成监测和控制

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.72

A. Nussbaum, Shwetha Mathangi Chandra Choodamani, K. Schwan

{"title":"ObsCon: Integrated Monitoring and Control for Parallel, Real-Time Applications","authors":"A. Nussbaum, Shwetha Mathangi Chandra Choodamani, K. Schwan","doi":"10.1109/CLUSTER.2015.72","DOIUrl":"https://doi.org/10.1109/CLUSTER.2015.72","url":null,"abstract":"A large class of emerging compute-intensive applications demand real-time or near real-time processing guarantees on streaming data. Sensor processing in particular, has stringent latency requirements for carrying out its digital processing for rapidly incoming radar data streams. The consequent demands on the cluster middleware used to run such codes include (i) efficient online observation of current application performance, coupled with (ii) highly responsive controllers able to dynamically adjust the application's input-and data-dependent runtime behavior. We present the Obs(erver)Con(troller) software for online monitoring and control, which based on specifications of acceptable application states and tunable knobs within the execution environment, ensures that application performance falls within acceptable limits. ObsCon topologies are dynamic, making possible the runtime association of ObsCon methods with arbitrary DAG-structured, distributed/parallel stream processing applications running on high end cluster machines. This paper describes the ObsCon software and its 'grey box' use with a high performance cluster code that exports to ObsCon select 'hooks' for online monitoring and control -- Adaptive Digital Beamforming for a phase-array radar system.","PeriodicalId":187042,"journal":{"name":"2015 IEEE International Conference on Cluster Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127803602","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}

引用次数: 7

Efficient Queuing Schemes for HoL-Blocking Reduction in Dragonfly Topologies with Minimal-Path Routing 基于最小路径路由的蜻蜓拓扑中减少hol阻塞的有效排队方案

2015 IEEE International Conference on Cluster Computing Pub Date : 2015-09-08 DOI: 10.1109/CLUSTER.2015.138

P. Yébenes, J. Escudero-Sahuquillo, P. García, F. Quiles

引用次数: 7