{"title":"OpenACC Multi-GPU Approach for WSM6 Microphysics","authors":"H. C. D. Silva, M. A. Stefanes, V. Capistrano","doi":"10.1109/HiPC53243.2021.00053","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00053","url":null,"abstract":"Weather Research Forecasting (WRF) model is a popular tool used in both research and operational applications that enables us to obtain relevant information about rain, snow, and others. The WRF Single-Moment 6-Class Microphysics Scheme (WSM6) is an important routine and it is the most time-consuming task of the WRF model. Due to its importance, several parallel methods have been proposed to the problem. The parallel approach using multiple GPU for the WSM6 scheme has allowed the address of a large number of data in a reasonable time. This paper describes the improvement of the computational performance of the WSM6 by exploiting fine-grained parallelism using the Graphics Processing Unit (GPU) with OpenACC paradigm. When compared to a 24-thread CPU, the speedup we achieve is 67.4 and 108.0 on one and four GPUs, respectively. We also compare our implementation to a recent OpenACC implementation in the literature and our proposed solution is 21 times faster than it using one GPU and 34 times faster using four GPUs. We also performed a study about the accuracy of the proposed implementation with good results.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115295379","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}
{"title":"A computational technique for parallel solution of diagonally dominant banded linear systems","authors":"S. Rao, Rabia Kamra","doi":"10.1109/HiPC53243.2021.00064","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00064","url":null,"abstract":"In this work, we present a WZ factorization for a nonsingular diagonally dominant banded matrix. With little modifications in the structures of W and Z, we construct a stable parallel algorithm suitable for solving narrow banded nonsingular diagonally dominant linear systems using divide and conquer technique. Partition the coefficient matrix along the main diagonal; also partition the unknown vector and the right hand side vector accordingly. The coefficient matrix of the ‘reduced system’ which is obtained by collecting the first ß and last ß equations from each partition, where ß is semibadwidth of the given banded linear system, is proved to be nonsingular diagonally dominant. The backward error analysis of the algorithm is presented and the algorithm is proved to be numerically stable. Numerical experiments are conducted to check the performance of the parallel algorithm and to compare the present parallel algorithm with the corresponding subroutines of ScaLAPACK. The performance of the parallel algorithm is evaluated in terms of speedup and scalability.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115697656","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}
{"title":"Efficient Parallel Algorithms for Computing Percolation Centrality","authors":"Athreya Chandramouli, Sayantan Jana, Kishore Kothapalli","doi":"10.1109/HiPC53243.2021.00025","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00025","url":null,"abstract":"Centrality measures on graphs have found applications in a large number of domains including modeling the spread of an infection/disease, social network analysis, and transportation networks. As a result, parallel algorithms for computing various centrality metrics on graphs are gaining significant research attention in recent years. In this paper, we study parallel algorithms for the percolation centrality measure which extends the betweenness-centrality measure by incorporating a time dependent state variable with every node. We present parallel algorithms that compute the source-based and source-destination variants of the percolation centrality values of nodes in a network. Our algorithms extend the algorithm of Brandes, introduce optimizations aimed at exploiting the structural properties of graphs, and extend the algorithmic techniques introduced by Sariyuce et al. [26] in the context of centrality computation. Experimental studies of our algorithms on an Intel Xeon(R) Silver 4116 CPU and an Nvidia Tesla V100 GPU on a collection of 12 real-world graphs indicate that our algorithmic techniques offer a significant speedup.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125332639","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}
Jake Tronge, Patricia A. Grubel, Timothy Randles, Quincy Wofford, Rusty Davis, Steven Anaya, Qiang Guan
{"title":"BEE Orchestrator: Running Complex Scientific Workflows on Multiple Systems","authors":"Jake Tronge, Patricia A. Grubel, Timothy Randles, Quincy Wofford, Rusty Davis, Steven Anaya, Qiang Guan","doi":"10.1109/HiPC53243.2021.00052","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00052","url":null,"abstract":"In this paper, we propose a workflow orchestration system that is able to run workflows on both HPC systems and in the cloud using HPC containers. Most existing workflow orchestration systems are only able to run workflows on one system at a time, and thus may be unable to run workflows that require more resources than what some platforms provide, and may also be unable to handle validation and fault tolerance requirements. Users may have access to a number of different systems, perhaps a mix of HPC systems and private and public clouds, but currently are only able to utilize one system at a time for running complex workflows. Utilizing HPC containers, such as Charliecloud, and a subset of the Common Workflow Language (CWL) for representing workflows, we extend the BEE Orchestration System to allow for possible scheduling of complex workflows across resources. We design and implement a scheduling component and a component for interacting with OpenStack-based HPC clusters and Google Compute Engine clouds to allow for communication between any combination of Cloud and HPC components. We demonstrate how BEE orchestrates workflows across systems, making it possible to run complex scientific applications across all systems that are available to a user. These results also show that BEE will become a viable alternative to other workflow orchestration systems.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129414462","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}
Edigley Fraga, A. Cortés, T. Margalef, P. Hernández
{"title":"Cloud-Based Urgent Computing for Forest Fire Spread Prediction under Data Uncertainties","authors":"Edigley Fraga, A. Cortés, T. Margalef, P. Hernández","doi":"10.1109/HiPC53243.2021.00061","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00061","url":null,"abstract":"Forest fires severely affect many ecosystems every year, leading to large environmental damages, casualties, and economic losses. Emerging and established technologies are used to help wildfire analysts determine fire behavior and spread, aiming at more accurate prediction results and efficient use of resources in fire fighting. We propose a novel forest fire spread prediction platform based on a proven two-stage prediction model devised to deal with input data uncertainties. The model is able to calibrate the unknown parameters based on the real observed data using an iterative process. Since this calibration is compute-intensive and due to the unpredictability of urgent computing needs, we exploit an elastic and scalable cloud-based solution platform implemented through coarse-grain parallel processing using a work queue.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121186033","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}
{"title":"Message from the Program Chairs HiPC 2021","authors":"","doi":"10.1109/hipc53243.2021.00006","DOIUrl":"https://doi.org/10.1109/hipc53243.2021.00006","url":null,"abstract":"","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116366350","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}
Leonel Toledo, Pedro Valero-Lara, J. Vetter, Antonio J. Peña
{"title":"Static Graphs for Coding Productivity in OpenACC","authors":"Leonel Toledo, Pedro Valero-Lara, J. Vetter, Antonio J. Peña","doi":"10.1109/HiPC53243.2021.00050","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00050","url":null,"abstract":"The main contribution of this work is to increase the coding productivity for GPU programming by using the concept of Static Graphs. To do so, we have combined the new CUDA Graph API with the OpenACC programming model. We use as test cases a well-known and widely used problems in HPC and AI: the Particle Swarm Optimization. We complement the OpenACC functionality with the use of CUDA Graph, achieving accelerations of more than one order of magnitude, and a performance very close to a reference and optimized CUDA code. Finally, we propose a new specification to incorporate the concept of Static Graphs into the OpenACC specification.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133789491","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}
{"title":"Model-based Reinforcement Learning for Elastic Stream Processing in Edge Computing","authors":"Jinlai Xu, Balaji Palanisamy","doi":"10.1109/HiPC53243.2021.00043","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00043","url":null,"abstract":"Low-latency data processing is critical for enabling next generation Internet-of-Things(IoT) applications. Edge computing-based stream processing techniques that optimize for low latency and high throughput provide a promising solution to ensure a rich user experience by meeting strict application requirements. However, manual performance tuning of stream processing applications in heterogeneous and dynamic edge computing environments is not only time consuming but also not scalable. Our work presented in this paper achieves elasticity for stream processing applications deployed at the edge by automatically tuning the applications to meet the performance requirements. The proposed approach adopts a learning model to configure the parallelism of the operators in the stream processing application using a reinforcement learning(RL) method. We model the elastic control problem as a Markov Decision Process(MDP) and solve it by reducing it to a contextual Multi-Armed Bandit(MAB) problem. The techniques proposed in our work uses Upper Confidence Bound(UCB)-based methods to improve the sample efficiency in comparison to traditional random exploration methods such as the e-greedy method. It achieves a significantly improved rate of convergence compared to other RL methods through its innovative use of MAB methods to deal with the tradeoff between exploration and exploitation. In addition, the use of model-based pre-training results in sub-stantially improved performance by initializing the model with appropriate and well-tuned parameters. The proposed techniques are evaluated using realistic and synthetic workloads through both simulation and real testbed experiments. The experiment results demonstrate the effectiveness of the proposed approach compared to standard methods in terms of cumulative reward and convergence speed.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117074404","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}
{"title":"Empirical Analysis of Architectural Primitives for NVRAM Consistency","authors":"K. P. Arun, Debadatta Mishra, Biswabandan Panda","doi":"10.1109/HiPC53243.2021.00031","DOIUrl":"https://doi.org/10.1109/HiPC53243.2021.00031","url":null,"abstract":"Non-volatile memory (NVM) provides persistent memory semantics with access latencies comparable to volatile DRAM. The persistent nature of NVM requires the application developers to design data consistency mechanisms for failure recovery, without which application may end up with inconsistent memory state after a power failure or a system crash. Most commonly employed methods use architectural support for cache line flushing and memory fencing to enforce ordering of writes to NVM. In this paper, we study the performance overhead of different hardware primitives used to achieve NVM consistency on Intel x86-64 and Arm64 systems using micro-benchmarks. Further, we also empirically analyze the impact of working set size and memory access characteristics (read-to-write ratio) of applications on different data consistency techniques. Logging based mechanisms (e.g., redo and undo logging), commonly used for NVM consistency, also use underlying architectural primitives like cache flushing. We comparatively study the overheads of redo and undo logging with different architectural primitives. The analysis presented in this paper can be useful to improve the software/hardware architecture, develop efficient applications and perform better capacity planning in NVM systems.","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130988801","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}
{"title":"[Title page iii]","authors":"","doi":"10.1109/hipc53243.2021.00002","DOIUrl":"https://doi.org/10.1109/hipc53243.2021.00002","url":null,"abstract":"","PeriodicalId":330148,"journal":{"name":"2021 IEEE 28th International Conference on High Performance Computing, Data, and Analytics (HiPC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125208455","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}