Results 11 to 20 of about 112,191 (286)
Generalized Task Parallelism [PDF]
ACM Transactions on Architecture and Code Optimization, 2015 Existing approaches to automatic parallelization produce good results in specific domains. Yet, it is unclear how to integrate their individual strengths to match the demands and opportunities of complex software. This lack of integration has both practical reasons, as integrating those largely differing approaches into one compiler would impose an ...
Kevin Streit +4 more
openaire +1 more source
Automatic Inference of Task Parallelism in Task-Graph-Based Actor Models
IEEE Access, 2018 Automatic inference of task level parallelism is fundamental for ensuring many kinds of safety and liveness properties of parallel applications. For example, two tasks running in parallel may be involved in data races when they have conflicting memory ...
Abu Naser Masud +2 more
doaj +1 more source
SpECTRE: A Task-based Discontinuous Galerkin Code for Relativistic Astrophysics [PDF]
, 2017 We introduce a new relativistic astrophysics code, SpECTRE, that combines a discontinuous Galerkin method with a task-based parallelism model. SpECTRE's goal is to achieve more accurate solutions for challenging relativistic astrophysics problems such as
Bohn, Andy +13 more
core +2 more sources
ISPRS International Journal of Geo-Information, 2017 Parallel processing in the real-time visualization of three-dimensional Geographic Information Systems (3DGIS) has tended to concentrate on algorithm levels in recent years, and most of the existing methods employ multiple threads in a Central Processing
Dongbo Zhou +4 more
doaj +1 more source
Exact and heuristic allocation of multi-kernel applications to multi-FPGA platforms [PDF]
, 2019 FPGA-based accelerators demonstrated high energy efficiency compared to GPUs and CPUs. However, single FPGA designs may not achieve sufficient task parallelism.
Casu, Mario R. +4 more
core +2 more sources
IEEE Access, 2021 Processing-in-memory (PIM) comprises computational logic in the memory domain. It is the most promising solution to alleviate the memory bandwidth problem in deep neural network (DNN) processing.
Young Sik Lee, Tae Hee Han
doaj +1 more source
MPI+X: task-based parallelization and dynamic load balance of finite element assembly [PDF]
, 2018 The main computing tasks of a finite element code(FE) for solving partial differential equations (PDE's) are the algebraic system assembly and the iterative solver. This work focuses on the first task, in the context of a hybrid MPI+X paradigm.
Artigues, Antoni +6 more
core +4 more sources
SWIFT: Using task-based parallelism, fully asynchronous communication, and graph partition-based domain decomposition for strong scaling on more than 100,000 cores [PDF]
, 2016 We present a new open-source cosmological code, called SWIFT, designed to solve the equations of hydrodynamics using a particle-based approach (Smooth Particle Hydrodynamics) on hybrid shared/distributed-memory architectures.
Chalk, Aidan B. G. +3 more
core +3 more sources
Efficient Task Flow Parallel System for New Generation Sunway Processor [PDF]
Jisuanji kexueChina’s independently developed next-generation Sunway supercomputer features a more powerful memory system and higher computational density compared to its predecessor,the Sunway TaihuLight.Its primary programming model remains the bulk synchronous ...
FU You, DU Leiming, GAO Xiran, CHEN Li
doaj +1 more source
A Parallelised ROOT for Future HEP Data Processing [PDF]
EPJ Web of Conferences, 2019 In the coming years, HEP data processing will need to exploit parallelism on present and future hardware resources to sustain the bandwidth requirements. As one of the cornerstones of the HEP software ecosystem, ROOT embraced an ambitious parallelisation
Piparo Danilo +6 more
doaj +1 more source