2017 46th International Conference on Parallel Processing Workshops (ICPPW)最新文献

筛选
英文 中文
Efficient Scalable Computing through Flexible Applications and Adaptive Workloads 通过灵活的应用程序和自适应工作负载实现高效的可扩展计算
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-09-07 DOI: 10.1109/ICPPW.2017.36
Sergio Iserte, R. Mayo, E. S. Quintana‐Ortí, Vicencc Beltran, Antonio J. Peña
{"title":"Efficient Scalable Computing through Flexible Applications and Adaptive Workloads","authors":"Sergio Iserte, R. Mayo, E. S. Quintana‐Ortí, Vicencc Beltran, Antonio J. Peña","doi":"10.1109/ICPPW.2017.36","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.36","url":null,"abstract":"In this paper we introduce a methodology for dynamic job reconfiguration driven by the programming model runtime in collaboration with the global resource manager. We improve the system throughput by exploiting malleability techniques (in terms of number of MPI ranks) through the reallocation of resources assigned to a job during its execution. In our proposal, the OmpSs runtime reconfigures the number of MPI ranks during the execution of an application in cooperation with the Slurm workload manager. In addition, we take advantage of OmpSs offload semantics to allow application developers deal with data redistribution. By combining these elements a job is able to expand itself in order to exploit idle nodes or be shrunk if other queued jobs could be initiated. This novel approach adapts the system workload in order to increase the throughput as well as make a smarter use of the underlying resources. Our experiments demonstrate that this approach can reduce the total execution time of a practical workload by more than 40% while reducing the amount of resources by 30%.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116164785","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}
引用次数: 14
A Comparative Performance Analysis of Remote GPU Virtualization over Three Generations of GPUs 三代GPU远程虚拟化性能比较分析
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-09-05 DOI: 10.1109/ICPPW.2017.29
C. Reaño, F. Silla
{"title":"A Comparative Performance Analysis of Remote GPU Virtualization over Three Generations of GPUs","authors":"C. Reaño, F. Silla","doi":"10.1109/ICPPW.2017.29","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.29","url":null,"abstract":"The use of Graphics Processing Units (GPUs) has become a very popular way to accelerate the execution of many applications. However, GPUs are not exempt from side effects. For instance, GPUs are expensive devices which additionally consume a non-negligible amount of energy even when they are not performing any computation. Furthermore, most applications present low GPU utilization. To address these concerns, the use of GPU virtualization has been proposed. In particular, remote GPU virtualization is a promising technology that allows applications to transparently leverage GPUs installed in any node of the cluster. In this paper the remote GPU virtualization mechanism is comparatively analyzed across three different generations of GPUs. The goal of this study is to analyze how the performance of the remote GPU virtualization technique is impacted by the underlying hardware. To that end, the Tesla K20, Tesla K40 and Tesla P100 GPUs along with FDR and EDR InfiniBand fabrics are used in the study. The analysis is performed in the context of the rCUDA middleware. It is clearly shown that the GPU virtualization middleware requires a comprehensive design of its communication layer, which should be perfectly adapted to every hardware generation in order to avoid a reduction in performance.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133457224","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
Towards a Better Expressiveness of the Speedup Metric in MPI Context 在MPI环境下更好地表达加速度量
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.45
Jean-Baptiste Besnard, A. Malony, S. Shende, Marc Pérache, Patrick Carribault, Julien Jaeger
{"title":"Towards a Better Expressiveness of the Speedup Metric in MPI Context","authors":"Jean-Baptiste Besnard, A. Malony, S. Shende, Marc Pérache, Patrick Carribault, Julien Jaeger","doi":"10.1109/ICPPW.2017.45","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.45","url":null,"abstract":"Many-core processors are imposing new constraints to parallel applications. In particular, the MPI+X model or hybridization is becoming a compulsory avenue to extract performance by mitigating both memory and communication overhead. In this context, performance tools also have to evolve in order to represent more complex states combining multiple runtimes and programming models. In this paper, we propose to start from a well-known performance metric, the Speedup, showing that it can be bounded by the acceleration of any program section. From this observation, we propose a compact tool-oriented MPI abstraction providing such time slices (or phases). We demonstrate the benefits of this approach first on a simple benchmark, identifying factors limiting speedup. And second, using an MPI+OpenMP benchmark to measure OpenMP scaling solely from MPI instrumentation.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522043","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
Optimizing Memory Management in Deeply Heterogeneous HPC Accelerators 深度异构HPC加速器中的内存管理优化
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.49
A. Pupykina, G. Agosta
{"title":"Optimizing Memory Management in Deeply Heterogeneous HPC Accelerators","authors":"A. Pupykina, G. Agosta","doi":"10.1109/ICPPW.2017.49","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.49","url":null,"abstract":"We address the problem of optimizing global shared memory usage in deeply heterogeneous accelerators in the context of HPC systems running multiple applications with different quality of service levels. We explore predictive memory allocation algorithms, allowing to serve up to 28% more high priority requests when using a moving average based prediction in a low-workload scenario.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116645951","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
A Parallel Shared-Memory Architecture for OWL Ontology Classification 面向OWL本体分类的并行共享内存体系结构
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.38
Zixi Quan, V. Haarslev
{"title":"A Parallel Shared-Memory Architecture for OWL Ontology Classification","authors":"Zixi Quan, V. Haarslev","doi":"10.1109/ICPPW.2017.38","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.38","url":null,"abstract":"The Web Ontology Language (OWL) plays an important role in the semantic web to represent domain knowledge using classes, properties, and individuals. OWL reasoners analyze ontologies and offer inference services such as class satisfiability and subsumption. Ontology classification is an important and widely used service that computes a taxonomy of all classes occurring in an ontology. It can require significant amounts of runtime but most OWL reasoners do not support any kind of parallel processing. We present a novel thread-level parallel architecture for ontology classification that is ideally suited for shared-memory SMP servers, where each thread can be mapped to a core on a one-to-one basis. We evaluated our prototype implementation with a set of real-world ontologies. Our experiments demonstrate a very good scalability resulting in a speedup that is linear to the number of available cores.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134315710","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}
引用次数: 2
Improving Valiant Routing for Slim Fly Networks 改进Slim Fly网络的Valiant路由
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.33
Deyu Han, Zhaofeng Wang, David P. Bunde
{"title":"Improving Valiant Routing for Slim Fly Networks","authors":"Deyu Han, Zhaofeng Wang, David P. Bunde","doi":"10.1109/ICPPW.2017.33","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.33","url":null,"abstract":"Valiant routing, the use of a random intermediate node to distribute network traffic, has been proposed for a number of recent HPC network topologies. It is also commonly used as a bulding block for adaptive routing algorithms, which use shortest path routes when possible, but revert to Valiant routing when necessary to avoid hot spots. We show that the version of Valiant routing proposed for the Slim fly topology can cause messages to follow loops, using an edge in both directions before returning to edges of the original shortest path. Removing these loops in the UGAL-L adaptive routing algorithm is shown to provide slight improvements in average latency and also allow the network to carry up to 12% more traffic before saturation.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124386376","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
Performance Analysis and Optimization of the FFTXlib on the Intel Knights Landing Architecture 基于Intel Knights Landing架构的FFTXlib性能分析与优化
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.44
M. Wagner, Víctor López, J. Morillo, C. Cavazzoni, F. Affinito, Judit Giménez, Jesús Labarta
{"title":"Performance Analysis and Optimization of the FFTXlib on the Intel Knights Landing Architecture","authors":"M. Wagner, Víctor López, J. Morillo, C. Cavazzoni, F. Affinito, Judit Giménez, Jesús Labarta","doi":"10.1109/ICPPW.2017.44","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.44","url":null,"abstract":"In this paper, we address the decreasing performance of the FFTXlib, the Fast Fourier Transformation (FFT) kernel of Quantum ESPRESSO, when scaling to a full KNL node. An increased performance in the FFTXlib will likewise increase the performance of the entire Quantum ESPRESSO code one of the most used plane-wave DFT codes in the community of material science. Our approach focuses on, first, overlapping computation and communication and, second, decreasing resource contention for higher compute efficiency. In order to achieve this we use the OmpSs programming model based on task dependencies. We allow overlapping of computation and communication by converting all steps of the FFT into tasks following a flow dependency. In the same way, we decrease resource contention by converting each FFT into an individual task that can be scheduled asynchronously. In both cases, multiple FFTs can be computed in parallel. The task-based optimizations are implemented in the FFTXlib and show up to 10% runtime reduction on the already highly optimized version. Since the task scheduling is done dynamically during execution by the parallel runtime, not statically by the user, it also frees the user from finding the ideal parallel configuration himself.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123881069","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
Blockchain-Based Multi-Level Scoring System for P2P Clusters 基于区块链的P2P集群多层次评分系统
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.50
J. Gattermayer, P. Tvrdík
{"title":"Blockchain-Based Multi-Level Scoring System for P2P Clusters","authors":"J. Gattermayer, P. Tvrdík","doi":"10.1109/ICPPW.2017.50","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.50","url":null,"abstract":"Peer-to-peer (P2P) design offers many benefits over a single-master or a multi-master architecture in terms of scalability, reliability and independence. The Clondike project is being converted from a grid computing system into a universal non-dedicated P2P cluster where every participating node can benefit from its membership in the cluster. But different design requires different types of algorithms in order to guarantee the same functionality. One of the challenges in P2P design is a fair scheduling and a general protection of the whole cluster against abusive or malfunctioning nodes. Algorithms used in a single-master or multi-master clusters do not work anymore. We have designed a multi-level system based on one of the main principles of cryptocurrencies to achieve a distributed master-less reputation rating across the cluster. This paper discusses proposed cluster multi-level reputation system and its parameters. The system is evaluated on a Clondike cluster on an experimental measurement with abusive nodes involved.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"155 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129192875","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}
引用次数: 19
SharP: Towards Programming Extreme-Scale Systems with Hierarchical Heterogeneous Memory 用层次异构存储器编程极端规模系统
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.32
Manjunath Gorentla Venkata, Ferrol Aderholdt, Zachary W. Parchman
{"title":"SharP: Towards Programming Extreme-Scale Systems with Hierarchical Heterogeneous Memory","authors":"Manjunath Gorentla Venkata, Ferrol Aderholdt, Zachary W. Parchman","doi":"10.1109/ICPPW.2017.32","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.32","url":null,"abstract":"The pre-exascale systems are expected to have a significant amount of hierarchical and heterogeneous on-node memory, and this trend of system architecture in extreme-scale systems is expected to continue into the exascale era. Along with hierarchical-heterogeneous memory, the system typically has a high-performing network and a compute accelerator. This system architecture is not only effective for running traditional High Performance Computing (HPC) applications (Big-Compute), but also running data-intensive HPC applications and Big-Data applications. As a consequence, there is a growing desire to have a single system serve the needs of both Big-Compute and Big-Data applications. Though the system architecture supports the convergence of the Big-Compute and Big-Data, the programming models have yet to evolve to support either hierarchical-heterogeneous memory systems or the convergence. In this work, we propose and develop the programming abstraction called SHARed data-structure centric Programming abstraction (SharP) to address both of these goals, i.e., provide (1) a simple, usable, and portable abstraction for hierarchical-heterogeneous memory and (2) a unified programming abstraction for Big-Compute and Big-Data applications. To evaluate SharP, we implement a Stencil benchmark using SharP, port QMCPack, a petascale-capable application, and adapt Memcached ecosystem, a popular Big-Data framework, to use SharP, and quantify the performance and productivity advantages. Additionally, we demonstrate the simplicity of using SharP on different memories including DRAM, High-bandwidth Memory (HBM), and non-volatile random access memory (NVRAM).","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123867683","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
An Empirical Evaluation of Design Abstraction and Performance of Thrust Framework 推力框架设计抽象与性能的实证评价
2017 46th International Conference on Parallel Processing Workshops (ICPPW) Pub Date : 2017-08-01 DOI: 10.1109/ICPPW.2017.43
Ajai V. George, Sankar Manoj, S. Gupte, S. Sarkar
{"title":"An Empirical Evaluation of Design Abstraction and Performance of Thrust Framework","authors":"Ajai V. George, Sankar Manoj, S. Gupte, S. Sarkar","doi":"10.1109/ICPPW.2017.43","DOIUrl":"https://doi.org/10.1109/ICPPW.2017.43","url":null,"abstract":"High performance computing applications are far more difficult to write, therefore, practitioners expect a well-tuned software to last long and provide optimized performance even when the hardware is upgraded. It may also be necessary to write software using sufficient abstraction over the hardware so that it is capable of running on heterogeneous architecture. Therefore, it is required to have a proper programming abstraction paradigm that strikes a balance between the abstraction and visibility over the hardware so that the programmer can write a program without having to understand the hardware nuances, yet exploit the compute power optimally. In this paper we have analyzed the power of design abstraction and performance of a popular design abstraction framework called Thrust. We have shown quantitatively that while it is easier to write an application using Thrust compared to writing the same in the native CUDA or OpenMP backends, the framework does not provide any abstraction over the memory hierarchy of the underlying backend to the programmer. We have compared the performance of three Thrust applications with their corresponding native versions in CUDA, OpenMP, Xeon-Phi and the CPP backends and demonstrate that the current Thrust version performs poorly in most of the cases when the application is compute intensive. However, the framework provides close to the native performance for a non-compute intensive applications. We analyze the reasons for the performance and highlight the improvements necessary for the framework.","PeriodicalId":353142,"journal":{"name":"2017 46th International Conference on Parallel Processing Workshops (ICPPW)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116999491","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}
引用次数: 4
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学术官方微信
小红书