output
20002026
most citedBenchmark Analysis of Representative Deep Neural Network Architectures

853 citations

Showing 2013 · cs.DCShow all

5 papers · 2 filters

cs.DC2013

Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors

Dimitrios Fotakis, Ioannis Milis, Emmanouil Zampetakis +1

We propose constant approximation algorithms for generalizations of the Flexible Flow Shop (FFS) problem which form a realistic model for non-preemptive scheduling in MapReduce sys…

cs.DC2013★ 1 cited

Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme

Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru +1

We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is bits and it converges in r…

cs.DC2013

SwiftCloud: Fault-Tolerant Geo-Replication Integrated all the Way to the Client Machine

Marek Zawirski, Annette Bieniusa, Valter Balegas +4

Client-side logic and storage are increasingly used in web and mobile applications to improve response time and availability. Current approaches tend to be ad-hoc and poorly integr…

cs.DC2013★ 11 cited

Non-Monotonic Snapshot Isolation

Masoud Saeida Ardekani, Pierre Sutra, Nuno Preguiça +1

Many distributed applications require transactions. However, transactional protocols that require strong synchronization are costly in large scale environments. Two properties help…

cs.DC2013★ 2 cited

Parameterizable Byzantine Broadcast in Loosely Connected Networks

Alexandre Maurer, Sébastien Tixeuil

We consider the problem of reliably broadcasting information in a multihop asynchronous network, despite the presence of Byzantine failures: some nodes are malicious and behave arb…