Sciweavers

423 search results - page 9 / 85
» Predicting Queue Times on Space-Sharing Parallel Computers
Sort
View
INFOCOM
1993
IEEE
13 years 11 months ago
Queueing Delays in Rate Controlled ATM Networks
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
Anindo Banerjea, Srinivasan Keshav
IPPS
1998
IEEE
13 years 11 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
CCGRID
2005
IEEE
14 years 1 months ago
Empirical evaluation of shared parallel execution on independently scheduled clusters
Parallel machines are typically space shared, or time shared such that only one application executes on a group of nodes at any given time. It is generally assumed that executing ...
M. Ghanesh, S. Kumar, Jaspal Subhlok
IPPS
2007
IEEE
14 years 1 months ago
A Comparative Study of Parallel Metaheuristics for Protein Structure Prediction on the Computational Grid
A comparative study of parallel metaheuristics executed in grid environments is proposed, having as case study a genetic algorithm, a simulated annealing algorithm and a random se...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
HPDC
2006
IEEE
14 years 1 months ago
Effective Prediction of Job Processing Times in a Large-Scale Grid Environment
Grid applications that use a considerable number of processors for their computations need effective predictions of the expected computation times on the different nodes. Currentl...
Menno Dobber, Robert D. van der Mei, Ger Koole