1609 search results - page 74 / 322 » A Microeconomic Scheduler for Parallel Computers |
146
click to vote
ICPADS
2006
IEEE
15 years 10 months ago
2006
IEEE
Multi-cluster schedulers can dramatically improve average job turn-around time performance by making use of fragmented node resources available throughout the grid. By carefully m...
144
click to vote
WIOPT
2005
IEEE
15 years 10 months ago
2005
IEEE
In this paper we develop distributed approaches for power allocation and scheduling in wireless access networks. We consider a model where users communicate over a set of parallel...
119
click to vote
PADS
1999
ACM
15 years 9 months ago
1999
ACM
This paper introduces the Critical Channel Traversing (CCTJ algorithm, a new scheduling algorithm for both sequential and parallel discrete event simulation. CCT is a general cons...
144
Voted
HPCC
2007
Springer
15 years 10 months ago
2007
Springer
Computing ”in-place and in-order”FFT poses a very difficult problem on hierarchical memory architectures where data movement can seriously degrade the performance. In this pape...
126
Voted
IPPS
1996
IEEE
15 years 8 months ago
1996
IEEE
Many irregular scientific computing problems can be modeled by directed acyclic task graphs (DAGs). In this paper, we present an efficient run-time system for executing general as...