Scheduling Divisible Loads in Parallel and Distributed Systems
Scheduling Divisible Loads in Parallel and Distributed Systems
Parallel and Distributed Computation: Numerical Methods
Parallel and Distributed Computation: Numerical Methods
Closed Form Solutions for Bus and Tree Networks of Processors Load Sharing a Divisible Job
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Measuring the Robustness of a Resource Allocation
IEEE Transactions on Parallel and Distributed Systems
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Optimized Distributed Delivery of Continuous-Media Documents over Unreliable Communication Links
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Robust design for distributed computing systems
Robust design for distributed computing systems
A new metric for robustness with application to job scheduling
HPDC '05 Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium
Efficient and simple generation of random simple connected graphs with prescribed degree sequence
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
IEEE Communications Magazine
Scheduling multiple divisible loads in homogeneous star systems
Journal of Scheduling
Topology control algorithm target tracking-oriented
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
QoS-aware data reporting control in cluster-based wireless sensor networks
Computer Communications
EDAS: energy and distance aware protocol based on SPIN for wireless sensor networks
Transactions on Computational Science VI
Geographic convergecast using mobile sink in wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
Large-scale distributed applications are subject to frequent disruptions due to resource contention and failure. Such disruptions are inherently unpredictable and, therefore, robustness is a desirable property for the distributed operating environment. In this work, we describe and evaluate a robust topology for applications that operate on a spanning tree overlay network. Unlike previous work that is adaptive or reactive in nature, we take a proactive approach to robustness. The topology itself is able to simultaneously withstand disturbances and exhibit good performance. We present both centralized and distributed algorithms to construct the topology, and then demonstrate its effectiveness through analysis and simulation of two classes of distributed applications: Data collection in sensor networks and data dissemination in divisible load scheduling. The results show that our robust spanning trees achieve a desirable trade-off for two opposing metrics where traditional forms of spanning trees do not. In particular, the trees generated by our algorithms exhibit both resilience to data loss and low power consumption for sensor networks. When used as the overlay network for divisible load scheduling, they display both robustness to link congestion and low values for the makespan of the schedule.