Sciweavers

465 search results - page 67 / 93
» Dynamic Scheduling with Genetic Programming
Sort
View
PPOPP
2010
ACM
16 years 3 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
MIDDLEWARE
2004
Springer
15 years 11 months ago
A grid service broker for scheduling distributed data-oriented applications on global grids
: The next generation of scientific experiments and studies, popularly called as e-Science, is carried out by large collaborations of researchers distributed around the world engag...
Srikumar Venugopal, Rajkumar Buyya, Lyle J. Winton
CONCURRENCY
2006
142views more  CONCURRENCY 2006»
15 years 6 months ago
A Grid service broker for scheduling e-Science applications on global data Grids
: The next generation of scientific experiments and studies, popularly called e-Science, is carried out by large collaborations of researchers distributed around the world engaged ...
Srikumar Venugopal, Rajkumar Buyya, Lyle J. Winton
ICS
2001
Tsinghua U.
15 years 10 months ago
Reducing the complexity of the issue logic
The issue logic of dynamically scheduled superscalar processors is one of their most complex and power-consuming parts. In this paper we present alternative issue-logic designs th...
Ramon Canal, Antonio González
IPPS
1999
IEEE
15 years 10 months ago
The MuSE System: A Flexible Combination of On-Stack Execution and Work-Stealing
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...
Markus Leberecht