700 search results - page 17 / 140 » A Proposal for Task Parallelism in OpenMP |
117
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Abstract. Computer vision is a challenging data intensive application. Currently, superscalar architectures dominate the processor marketplace. As more transistors become available...
141
Voted
ICPP
1999
IEEE
15 years 8 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
124
Voted
LCPC
2007
Springer
15 years 9 months ago
2007
Springer
The use of multiprocessor tasks (M-tasks) has been shown to be successful for mixed task and data parallel implementations of algorithms from scientific computing. The approach o...
146
Voted
IPPS
2003
IEEE
15 years 9 months ago
2003
IEEE
The characteristics of irregular algorithms make a parallel implementation difficult, especially for PC clusters or clusters of SMPs. These characteristics may include an unpredi...
133
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper examines the issue of dynamically scheduling applications on a wide-area network computing system. We construct a simulation model for wide-area task allocation problem...