Results 61 to 70 of about 3,115,284 (271)
Automation of Determination of Optimal Intra-Compute Node Parallelism [PDF]
Maximizing the productivity of modern multicore and manycore chips requires optimizing parallelism at the compute node level. This is, however, a complex multi-step process.
Brown, James C.+1 more
core +1 more source
In this paper, we propose a model-based workflow to generate parallel code on a multiple instruction stream, multiple data stream (MIMD) processor with vector accelerator (MIMDV) from a Simulink model. Solving data- and task-parallelism is crucial during
Shanwen Wu+3 more
doaj +1 more source
Quantifying the benefits of SPECint distant parallelism in simultaneous multithreading architectures [PDF]
We exploit the existence of distant parallelism that future compilers could detect and characterise its performance under simultaneous multithreading architectures.
Ayguadé Parra, Eduard+4 more
core +1 more source
Alleviating the software parallelization task
Despite decades of research into parallelizing compiler technology, software parallelization remains a largely manual task, which is complex, time-consuming, and error-prone. An embarrassingly parallel problem can be hidden behind a serial algorithm, thoughtless software design, or unsuccessfully chosen lower-level constructs, such as data structures ...
openaire +2 more sources
Mapping the Join Calculus to Heterogeneous Hardware [PDF]
As modern architectures introduce additional heterogeneity and parallelism, we look for ways to deal with this that do not involve specialising software to every platform.
Peter Calvert, Alan Mycroft
doaj +1 more source
Online Admission of Parallel Real-Time Tasks [PDF]
6th Real-Time Scheduling Open Problems Seminar (RTSOPS 2015), Lund, Sweden.No abstract (2 page paper) Parallel real-time tasks can be assigned into a multiprocessor system in many different ways, with regards to the schedulability of the task ...
Maia, Cláudio+2 more
core
Scheduling parallel tasks on hypercubes [PDF]
The authors consider the problem of non-pre-emptively scheduled independent parallel tasks with communication overhead on a d-dimensional hypercube system. To find a schedule such that the schedule length is minimised is NP-hard. Therefore, a simple heuristic algorithm is investigated and its performance boundary is derived as (2+In m-1/m), where m=2 ...
Lin, J.-F., Chen, S.-J.
openaire +2 more sources
Puppet is a great tool for making changes on systems, and ensuring that those changes happen. But Puppet is not intended to make this happen on many systems at the same time. Puppet is intended for eventual compliance over time. Each agent checks in over a period of time, al- lowing the puppetmaster to process only a few at a time.
openaire +3 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]
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.
M. Schaller+3 more
semanticscholar +1 more source
Automatic Parallelization: Executing Sequential Programs on a Task-Based Parallel Runtime
There are billions of lines of sequential code inside nowadays' software which do not benefit from the parallelism available in modern multicore architectures.
Cabral, Bruno+3 more
core +1 more source