English
Related papers

Related papers: Experiences Porting Distributed Applications to As…

200 papers

Due to increasing core counts in modern processors, several task-based runtimes emerged, including the C++ Standard Library for Concurrency and Parallelism (HPX). Although the asynchronous many-task runtime HPX allows implicit communication…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-04-08 Alexander Strack , Dirk Pflüger

On modern supercomputers, asynchronous many task systems are emerging to address the new architecture of computational nodes. Through this shift of increasing cores per node, a new programming model with the focus on handle the fine-grain…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-12-02 Patrick Diehl , Prashant K. Jha , Hartmut Kaiser , Robert Lipton , Martin Levesque

The FFT of three-dimensional (3D) input data is an important computational kernel of numerical simulations and is widely used in High Performance Computing (HPC) codes running on a large number of processors. Performance of many scientific…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-08-28 Vivek Gavane , Supriya Prabhugawankar , Shivam Garg , Archana Achalere , Rajendra Joshi

Asynchronous Many-task (AMT) runtime systems have gained increasing acceptance in the HPC community due to the performance improvements offered by fine-grained tasking runtime systems. At the same time, C++ standardization efforts are…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-07-09 Tianyi Zhang , Shahrzad Shirzad , Patrick Diehl , R. Tohid , Weile Wei , Hartmut Kaiser

To achieve scalability with today's heterogeneous HPC resources, we need a dramatic shift in our thinking; MPI+X is not enough. Asynchronous Many Task (AMT) runtime systems break down the global barriers imposed by the Bulk Synchronous…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-01-09 Thomas Heller , Patrick Diehl , Zachary Byerly , John Biddiscombe , Hartmut Kaiser

OpenMP has been the de facto standard for single node parallelism for more than a decade. Recently, asynchronous many-task runtime (AMT) systems have increased in popularity as a new programming paradigm for high performance computing…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-02-20 Tianyi Zhang , Shahrzad Shirzad , Bibek Wagle , Adrian S. Lemoine , Patrick Diehl , Hartmut Kaiser

Asynchronous Many-Task (AMT) systems offer a potential solution for efficiently programming complicated scientific applications on extreme-scale heterogeneous architectures. However, they exhibit different communication needs from…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-03-18 Jiakun Yan , Hartmut Kaiser , Marc Snir

We describe a methodology for designing efficient parallel and distributed scientific software. This methodology utilizes sequences of mechanizable algebra--based optimizing transformations. In this study, we apply our methodology to the…

Software Engineering · Computer Science 2008-11-18 Harry B. Hunt , Lenore R. Mullin , Daniel J. Rosenkrantz , James E. Raynolds

Rapid advancements in RISC-V hardware development shift the focus from low-level optimizations to higher-level parallelization. Recent RISC-V processors, such as the SOPHON SG2042, have 64 cores. RISC-V processors with core counts…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-06-11 Alexander Strack , Christopher Taylor , Dirk Pflüger

FFT (fast Fourier transform) plays a very important role in many fields, such as digital signal processing, digital image processing and so on. However, in application, FFT becomes a factor of affecting the processing efficiency, especially…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-07-25 Fan Zhang , Chen Hu , Qiang Yin , Wei Hu

Although recent scaling up approaches to training deep neural networks have proven to be effective, the computational intensity of large and complex models, as well as the availability of large-scale datasets, require deep learning…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-04-21 Bita Hasheminezhad , Shahrzad Shirzad , Nanmiao Wu , Patrick Diehl , Hannes Schulz , Hartmut Kaiser

We present a parallel algorithm for the fast Fourier transform (FFT) in higher dimensions. This algorithm generalizes the cyclic-to-cyclic one-dimensional parallel algorithm to a cyclic-to-cyclic multidimensional parallel algorithm while…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-12-12 Thomas Koopman , Rob H. Bisseling

There has been considerable research into improving Fast Fourier Transform (FFT) performance through parallelization and optimization for specialized hardware. However, even with those advancements, processing of very large files, over 1TB…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-07-28 Rostislav Tsiomenko , Bradley S. Rees

Developing parallel algorithms efficiently requires careful management of concurrency across diverse hardware architectures. C++ executors provide a standardized interface that simplifies the development process, allowing developers to…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-22 Karame Mohammadiporshokooh , Steven R. Brandt , Hartmut Kaiser

The trend towards highly parallel multi-processing is ubiquitous in all modern computer architectures, ranging from handheld devices to large-scale HPC systems; yet many applications are struggling to fully utilise the multiple levels of…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-07-19 Michael Lange , Gerard Gorman , Michele Weiland , Lawrence Mitchell , Xiaohu Guo , James Southern

Asynchronous Many-Task (AMT) runtime systems take advantage of multi-core architectures with light-weight threads, asynchronous executions, and smart scheduling. In this paper, we present the comparison of the AMT systems Charm++ and HPX…

Distributed, Parallel, and Cluster Computing · Computer Science 2023-05-04 Nanmiao Wu , Ioannis Gonidelis , Simeng Liu , Zane Fink , Nikunj Gupta , Karame Mohammadiporshokooh , Patrick Diehl , Hartmut Kaiser , Laxmikant V. Kale

Graph processing at scale presents many challenges, including the irregular structure of graphs, the latency-bound nature of graph algorithms, and the overhead associated with distributed execution. While existing frameworks such as Spark…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-03-06 Karame Mohammadiporshokooh , Panagiotis Syskakis , Andrew Lumsdaine , Hartmut Kaiser

Despite advancements in the areas of parallel and distributed computing, the complexity of programming on High Performance Computing (HPC) resources has deterred many domain experts, especially in the areas of machine learning and…

Exceptions and errors occurring within mission critical applications due to hardware failures have a high cost. With the emerging Next Generation Platforms (NGPs), the rate of hardware failures will likely increase. Therefore, designing our…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-10-22 Nikunj Gupta , Jackson R. Mayo , Adrian S. Lemoine , Hartmut Kaiser

Open-source matters, not just to the current cohort of HPC users but also to potential new HPC communities, such as machine learning, themselves often rooted in open-source. Many of these potential new workloads are, by their very nature,…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-10-27 Nick Brown , Oliver Thomson Brown , J. Mark Bull
‹ Prev 1 2 3 10 Next ›