1534 search results - page 134 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
178
click to vote
SIGMOD
2009
ACM
16 years 25 days ago
2009
ACM
The state of the art commercial query optimizers employ cost-based optimization and exploit dynamic programming (DP) to find the optimal query execution plan (QEP) without evalua...
190
click to vote
ICPP
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
136
click to vote
MICRO
1999
IEEE
15 years 10 months ago
1999
IEEE
Since there is generally insufficient instruction level parallelism within a single basic block, higher performance is achieved by speculatively scheduling operations in superbloc...
166
Voted
CRYPTO
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this work, we introduce one-time programs, a new computational paradigm geared towards security applications. A one-time program can be executed on a single input, who...
163
click to vote
SBACPAD
2005
IEEE
15 years 11 months ago
2005
IEEE
Executing long-running parallel applications in Opportunistic Grid environments composed of heterogeneous, shared user workstations, is a daunting task. Machines may fail, become ...