Results 131 to 140 of about 7,328 (165)
Some of the next articles are maybe not open access.
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 ...
Mike Holenderski +2 more
openaire +1 more source
EXTENDING OPENMP FOR TASK PARALLELISM
Parallel Processing Letters, 2003In a wide variety of scientific parallel applications, both task and data parallelism must be exploited to achieve the best possible performance on a multiprocessor machine. These applications induce task-graph parallelism with coarse-grain granularity. Nevertheless, using the available task-graph parallelism and combining it with data parallelism can
openaire +1 more source
Parallelization using task parallel library with task-based programming model
2014 IEEE 5th International Conference on Software Engineering and Service Science, 2014In order to reduce the complexity of traditional multithreaded parallel programming, this paper explores a new task-based parallel programming using the Microsoft .NET Task Parallel Library (TPL). Firstly, this paper proposes a custom data partitioning optimization method to achieve an efficient data parallelism, and applies it to the matrix ...
Xinhong Hei +4 more
openaire +1 more source
Task-Parallel Programming with Constrained Parallelism
2022 IEEE High Performance Extreme Computing Conference (HPEC), 2022Tsung-Wei Huang, Leslie Hwang
openaire +1 more source
Integrating task parallelism in data parallel languages for parallel programming on NOWs
Concurrency: Practice and Experience, 2000Summary: A number of high-level parallel programming platforms for networks of workstations (NOWs) have been developed in recent times. Most of these platforms target the exploitation of data parallelism in applications. They do not allow expressibility of applications as a collection of tasks along with their precedence relationships. As a result, the
K. J. Binu, D. Janaki Ram
openaire +2 more sources
Parallel Task for parallelizing object-oriented desktop applications
2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), 2010As multicores arrive for mainstream desktop systems, developers must invest the effort to parallelize their applications. We present Parallel Task (short ParaTask), a solution to assist the parallelization of object-oriented applications, with the unique feature of including support for the parallelization of graphical user interface (GUI) applications.
Nasser Giacaman, Oliver Sinnen
openaire +1 more source
Detection of implicit parallelisms in the task parallel language
Proceedings High Performance Computing on the Information Superhighway. HPC Asia '97, 2002In a task parallel language like Fortran M, the programmer writes a task parallel program using parallel constructs. When some data dependencies exist between called procedures in various applications, it is difficult to write a task parallel program according to their dependencies.
null Sung-Soon Park, null Mi-Soon Koo
openaire +1 more source
Integrating task and data parallelism with task HPF
2000An abstract is not available.
S. CIARPAGLINI +4 more
openaire +6 more sources
A parallel genetic algorithm for task mapping on parallel machines
1999In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilization and increase significantly the throughput of the system. We demonstrate how to map the tasks among the processors to meet performance criteria, such as minimizing ...
S. Mounir Alaoui +2 more
openaire +1 more source
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

