Results 231 to 240 of about 112,191 (286)
Task parallelism in constraint programming: parallel consistency
, 2009 Rolf, Carl Christian +1 more
openaire +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Task parallel assembly language for uncompromising parallelism
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021Achieving parallel performance and scalability involves making compromises between parallel and sequential computation. If not contained, the overheads of parallelism can easily outweigh its benefits, sometimes by orders of magnitude. Today, we expect programmers to implement this compromise by optimizing their code manually.
Mike Rainey +6 more
openaire +1 more source
Extracting task-level parallelism
ACM Transactions on Programming Languages and Systems, 1995Automatic 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 +1 more
openaire +1 more source
Parallel Task Routing for Crowdsourcing
Proceedings of the AAAI Conference on Human Computation and Crowdsourcing, 2014An 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 +3 more
openaire +1 more source
Ada tasking and parallel processors
Proceedings of the conference on Tri-Ada '89 Ada technology in context: application, development, and deployment - TRI-Ada '89, 1989This 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, 1991The 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
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 +2 more sources
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 +2 more sources
FunctionFlow: coordinating parallel tasks
Frontiers of Computer Science, 2018With 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 +1 more source
Featherlight Speculative Task Parallelism
Lecture Notes in Computer Science, 2019Speculative task parallelism is a widely used technique for solving search based irregular computations such as graph algorithms. Here, tasks are created speculatively to traverse different search spaces in parallel. Only a few of these tasks succeed in finding the solution, after which the remaining tasks are canceled. For ensuring timely cancellation
exaly +2 more sources
On Scheduling Parallel Tasks at Twilight
Theory of Computing Systems, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources