790 search results - page 2 / 158 » Limits of Work-Stealing Scheduling |
171
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
Executing subordinate activities by pushing return addresses on the stack is the most e cient working mode for sequential programs. It is supported by all current processors, yet i...
179
click to vote
EUROPAR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
194
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
198
click to vote
IPPS
2009
IEEE
16 years 1 months ago
2009
IEEE
Multiple programming models are emerging to address an increased need for dynamic task parallelism in applications for multicore processors and shared-address-space parallel compu...
197
click to vote
EUROPAR
2010
Springer
15 years 6 months ago
2010
Springer
Today, it is possible to associate multiple CPUs and multiple GPUs in a single shared memory architecture. Using these resources efficiently in a seamless way is a challenging issu...