168 search results - page 11 / 34 » Making Applications Persistent at Run-time |
125
Voted
ICCS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. A new approach for acquiring knowledge of parallel applications regarding resource usage and for searching similarity on workload traces is presented. The main goal is to...
112
Voted
WG
2010
Springer
15 years 8 days ago
2010
Springer
Eulerian extension problems aim at making a given (directed) (multi-)graph Eulerian by adding a minimum-cost set of edges (arcs). These problems have natural applications in schedu...
154
Voted
PVM
2010
Springer
15 years 25 days ago
2010
Springer
Abstract. Designing and tuning parallel applications with MPI, particularly at large scale, requires understanding the performance implications of different choices of algorithms ...
138
Voted
STACS
2007
Springer
15 years 8 months ago
2007
Springer
The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
160
click to vote
HPDC
2012
IEEE
13 years 4 months ago
2012
IEEE
Hadoop has become a critical component in today’s cloud environment. Ensuring good performance for Hadoop is paramount for the wide-range of applications built on top of it. In ...