Results 111 to 120 of about 7,375 (166)

A Proposal for Task Parallelism in OpenMP

2008
This paper presents a novel proposal to define task parallelism in OpenMP. Task parallelism has been lacking in the OpenMP language for a number of years already. As we show, this makes certain kinds of applications difficult to parallelize, inefficient or both.
Ayguadé Parra, Eduard, Nawal, Copty, Duran González, Alejandro, Hoeflinger, Jay, Yuan, Lin, Massaioli, Federico, Ernesto, Su, Unnikrishnan, Priya, Guansong, Zhang   +8 more
openaire   +3 more sources

Ada tasking and parallel processors

Proceedings of the conference on Tri-Ada '89 Ada technology in context: application, development, and deployment - TRI-Ada '89, 1989
This paper describes the creation of a shared memory multiprocessor runtime that uses the Ada language tasking model as the basis for CPU allocation. The modifications to an Ada runtime targeted to a single MIL-STD-1750A processor to create a multiprocessor Ada runtime are described. Some performance information is given.
Michael Linnig, Donna Forinash
openaire   +1 more source

List scheduling of parallel tasks

Information Processing Letters, 1991
The original list scheduling algorithm \textit{R. L. Graham} [Bounds an multprocessing timing anomalies, SIAM J. Appl. Math. 17, 416-429 (1969)] is presented and its performance ratio is shown to be \(\Delta +(m- \Delta)/m\) when parallel tasks are involved.
Quingzhou Wang, Kam-Hoi Cheng
openaire   +1 more source

Streaming Task Parallelism

Proceedings of the 29th ACM on International Conference on Supercomputing, 2015
Stream computing is often associated with regular, data-intensive applications, and more specifically with the family of cyclo-static data-flow models. The term also refers to bulk-synchronous data parallelism on SIMD architectures. Both interpretations are valid but incomplete: streams underline the formal definition of Kahn process networks, a ...
openaire   +3 more sources

Parallel Task Routing for Crowdsourcing

Proceedings of the AAAI Conference on Human Computation and Crowdsourcing, 2014
An ideal crowdsourcing or citizen-science system would route tasks to the most appropriate workers, but the best assignment is unclear because workers have varying skill, tasks have varying difficulty, and assigning several workers to a single task may significantly improve output quality.
Jonathan Bragg, Andrey Kolobov, Mausam, Daniel S. Weld   +3 more
openaire   +2 more sources

Elastic Tasks: Unifying Task Parallelism and SPMD Parallelism with an Adaptive Runtime

2015
In this paper, we introduce elastic tasks, a new high-level parallel programming primitive that can be used to unify task parallelism and SPMD parallelism in a common adaptive scheduling framework. Elastic tasks are internally parallel tasks and can run on a single worker or expand to take over multiple workers.
Agrawal, Kunal, Sarkar, Vivek, Sbîrlea, Alina   +2 more
openaire   +2 more sources

FunctionFlow: coordinating parallel tasks

Frontiers of Computer Science, 2018
With the growing popularity of task-based parallel programming, nowadays task-parallel programming libraries and languages are still with limited support for coordinating parallel tasks. Such limitation forces programmers to use additional independent components to coordinate the parallel tasks — the components can be third-party libraries or ...
Xuepeng Fan, Xiaofei Liao, Hai Jin 0001
openaire   +2 more sources

Extracting task-level parallelism

ACM Transactions on Programming Languages and Systems, 1995
Automatic detection of task-level parallelism (also referred to as functional, DAG, unstructured, or thread parallelism) at various levels of program granularity is becoming increasingly important for parallelizing and back-end compilers.
Milind Girkar, Constantine D. Polychronopoulos   +1 more
openaire   +1 more source

On Scheduling Parallel Tasks at Twilight

Theory of Computing Systems, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +4 more sources

Adaptive Parallelism for OpenMP Task Parallel Programs

2000
We present a system that allows task parallel OpenMP programs to execute on a network of workstations (NOW) with a variable number of nodes. Such adaptivity, generally called adaptive parallelism, is important in a multi-user NOW environment, enabling the system to expand the computation onto idle nodes or withdraw from otherwise occupied nodes.
Alex Scherer, Thomas R. Gross, Willy Zwaenepoel   +2 more
openaire   +1 more source