1609 search results - page 94 / 322 » A Microeconomic Scheduler for Parallel Computers |
145
click to vote
PACT
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we design and implement an efficient technique for parallel evidence propagation on state-of-the-art multicore processor systems. Evidence propagation is a major ste...
142
click to vote
IRREGULAR
1995
Springer
15 years 8 months ago
1995
Springer
Dependencies between iterations of loop structures cannot always be determined at compile-time because they may depend on input data which is known only at run-time. A prime examp...
147
click to vote
PPOPP
2010
ACM
15 years 11 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
122
Voted
HPDC
2006
IEEE
15 years 10 months ago
2006
IEEE
Most parallel computing resources are controlled by batch schedulers that place requests for computation in a queue until access to compute nodes is granted. Queue waiting times a...
143
click to vote
IEEEPACT
2002
IEEE
15 years 9 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...