700 search results - page 27 / 140 » A Proposal for Task Parallelism in OpenMP |
151
click to vote
EUROPAR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We consider approaches that allow task migration for scheduling recurrent directed-acyclic-graph (DAG) tasks on symmetric, shared-memory multiprocessors (SMPs) in order t...
141
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
100
Voted
ICS
2005
Tsinghua U.
15 years 9 months ago
2005
Tsinghua U.
Chip Multiprocessors (CMPs) are flexible, high-frequency platforms on which to support Thread-Level Speculation (TLS). However, for TLS to deliver on its promise, CMPs must explo...
110
Voted
EUROPAR
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. This paper presents new techniques for master-slave tasking on treeshaped networks with fully heterogeneous communication and processing resources. A large number of inde...
162
Voted
CCGRID
2009
IEEE
15 years 4 months ago
2009
IEEE
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...