Sciweavers

1053 search results - page 86 / 211
» Estimating Execution Time of Distributed Applications
Sort
View
IPPS
2006
IEEE
15 years 5 months ago
Selecting the tile shape to reduce the total communication volume
In this paper we revisit the tile-shape selection problem, that has been extensively discussed in bibliography. An efficient approach is proposed for the selection of a suitable t...
Nikolaos Drosinos, Georgios I. Goumas, Nectarios K...
EDBT
2011
ACM
199views Database» more  EDBT 2011»
14 years 3 months ago
Predicting completion times of batch query workloads using interaction-aware models and simulation
A question that database administrators (DBAs) routinely need to answer is how long a batch query workload will take to complete. This question arises, for example, while planning...
Mumtaz Ahmad, Songyun Duan, Ashraf Aboulnaga, Shiv...
IPPS
2006
IEEE
15 years 5 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan
PVM
2010
Springer
14 years 10 months ago
Toward Performance Models of MPI Implementations for Understanding Application Scaling Issues
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
Torsten Hoefler, William Gropp, Rajeev Thakur, Jes...
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
13 years 2 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky