Results 211 to 220 of about 7,208 (264)
Some of the next articles are maybe not open access.
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
openaire +1 more source
Mixed Parallel Programming Models Using Parallel Tasks
2010Parallel programming models using parallel tasks have shown to be successful for increasing scalability on medium-size homogeneous parallel systems. Several investigations have shown that these programming models can be extended to hierarchical and heterogeneous systems which will dominate in the future.
Joerg Duemmler +2 more
openaire +1 more source
Complexity of Scheduling Parallel Task Systems
SIAM Journal on Discrete Mathematics, 1989Summary: One of of the assumptions made in classical scheduling theory is that a task is always executed by one processor at a time. With the advances in parallel algorithms, this assumption may not be valid for future task systems. In this paper, a new model of task systems is studied, the so- called Parallel Task System, in which a task can be ...
Du, Jianzhong, Leung, Joseph Y.-T.
openaire +2 more sources
2015 IEEE International Conference on Data Mining, 2015
In this paper, we develop parallel algorithms for a family of regularized multi-task methods which can model task relations under the regularization framework. Since those multi-task methods cannot be parallelized directly, we use the FISTA algorithm, which in each iteration constructs a surrogate function of the original problem by utilizing the ...
openaire +1 more source
In this paper, we develop parallel algorithms for a family of regularized multi-task methods which can model task relations under the regularization framework. Since those multi-task methods cannot be parallelized directly, we use the FISTA algorithm, which in each iteration constructs a surrogate function of the original problem by utilizing the ...
openaire +1 more source
Scheduling interval ordered tasks in parallel
Journal of Algorithms, 1993Summary: We present the first NC algorithm for scheduling \(n\) unit length tasks on \(m\) identical processors for the case where the precedence constraint is an interval order. Our algorithm runs on a priority concurrent read, concurrent write parallel random acces machine in \(O(\log^2n)\) time with \(O(n^5)\) processors, or in \(O(\log^3n)\) time ...
Sunder, Sivaprakansam, He, Xin
openaire +1 more source
Parallel-Task Scheduling on Multiple Resources
2012 24th Euromicro Conference on Real-Time Systems, 2012This paper addresses the problem of scheduling periodic parallel tasks on a multi-resource platform, where tasks have real-time constraints. The goal is to exploit the inherent parallelism of a platform comprised of multiple heterogeneous resources. A resource model is proposed, which abstracts the key properties of any heterogeneous resource from a ...
Holenderski, M.J. +2 more
openaire +1 more source
Adaptive Parallelism for OpenMP Task Parallel Programs
2000We 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 +2 more
openaire +1 more source
Task Allocation by Parallel Evolutionary Computing
Journal of Parallel and Distributed Computing, 1997In this paper we will investigate the applicability of parallel evolutionary algorithms to the task allocation problem?a long standing problem in parallel computing. Three different evolutionary optimization strategies, genetic algorithms, simulated annealing, and steepest descent, are formulated in a parallel generic framework. In order to enhance the
Schoneveld, A. +2 more
openaire +3 more sources
1992
Die Theorie der parallelen Prozesse, die miteinander kooperieren und konkurrieren, indem sie Signale (Semaphore) austauschen, wurde 1968 von Dijkstra begrundet. Aus der Systemprogrammierung stammen Bezeichnungen wie TASK, ENTRY, CALL, PRIORITY und time-sharing.
openaire +1 more source
Die Theorie der parallelen Prozesse, die miteinander kooperieren und konkurrieren, indem sie Signale (Semaphore) austauschen, wurde 1968 von Dijkstra begrundet. Aus der Systemprogrammierung stammen Bezeichnungen wie TASK, ENTRY, CALL, PRIORITY und time-sharing.
openaire +1 more source
Parallel Task Management Library for MARTe
IEEE Transactions on Nuclear Science, 2012The Multithreaded Application Real-Time executor (MARTe) is a real-time framework with increasing popularity and support in the thermonuclear fusion community. It allows modular code to run in a multi-threaded environment leveraging on the current multi-core processor (CPU) technology.
Daniel F. Valcarcel +8 more
openaire +1 more source