1534 search results - page 50 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
IPPS
2000
IEEE
14 years 4 days ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
CLUSTER
2003
IEEE
14 years 1 months ago
2003
IEEE
Application run-time information is a fundamental component in application and job scheduling. However, accurate predictions of run times are difficult to achieve for parallel app...
BIRTHDAY
1997
Springer
13 years 12 months ago
1997
Springer
This article describes a parallel and distributed machine learning approach to a basic variant of the job assignment problem. The approach is in the line of the multiagent learning...
IPPS
2000
IEEE
14 years 4 days ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
PPAM
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...