Name
Abstract | ||
|---|---|---|
Many learning problems are formulated as minimization of some loss function on a training set of examples. Distributed gradient methods on a cluster are often used for this purpose. In this paper, we study how the variability of task execution times at cluster nodes affects the system throughput. In particular, a simple but accurate model allows us to quantity how the time to solve the minimization problem depends on the network of information exchanges among the nodes. Interestingly, we show that, even when communication overhead may be neglected, the clique is not necessarily the most effective topology, as commonly assumed in previous works. |
Year | Venue | Keywords |
|---|---|---|
2019 | ieee international conference computer and communications | Computational modeling,Convergence,Task analysis,Throughput,Synchronization,Network topology,Servers |
Field | DocType | ISSN |
Convergence (routing),Synchronization,Task analysis,Clique,Computer science,Server,Network topology,Minification,Throughput,Distributed computing | Conference | 0743-166X |
ISBN | Citations | PageRank |
978-1-7281-0515-4 | 1 | 0.36 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Giovanni Neglia | 1 | 781 | 63.67 |
| Gianmarco Calbi | 2 | 1 | 0.36 |
| Don Towsley | 3 | 18693 | 1951.05 |
| Gayane Vardoyan | 4 | 19 | 4.46 |