Data networks
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Journal of Parallel and Distributed Computing
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
High Performance Parametric Modeling with Nimrod/G: Killer Application for the Global Grid?
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Resource Management for Rapid Application Turnaround on Enterprise Desktop Grids
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
IEEE Transactions on Parallel and Distributed Systems
Design and Analysis of Experiments
Design and Analysis of Experiments
IEEE/ACM Transactions on Networking (TON)
Generalized nash bargaining solution for bandwidth allocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Practical Scheduling of Bag-of-Tasks Applications on Grids with Dynamic Resilience
IEEE Transactions on Computers
Adaptive Allocation of Independent Tasks to Maximize Throughput
IEEE Transactions on Parallel and Distributed Systems
Evaluations of the Lightweight Grid CIGRI upon the Grid5000 Platform
E-SCIENCE '07 Proceedings of the Third IEEE International Conference on e-Science and Grid Computing
Algorithm 875: DSDP5—software for semidefinite programming
ACM Transactions on Mathematical Software (TOMS)
The performance of bags-of-tasks in large-scale distributed systems
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
IEEE Transactions on Parallel and Distributed Systems
Efficient scheduling of task graph collections on heterogeneous resources
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
Toward a fully decentralized algorithm for multiple bag-of-tasks application scheduling on grids
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Scheduling Concurrent Bag-of-Tasks Applications on Heterogeneous Platforms
IEEE Transactions on Computers
Non-clairvoyant scheduling of multiple bag-of-tasks applications
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Bag-of-Tasks Scheduling under Budget Constraints
CLOUDCOM '10 Proceedings of the 2010 IEEE Second International Conference on Cloud Computing Technology and Science
Dominant resource fairness: fair allocation of multiple resource types
Proceedings of the 8th USENIX conference on Networked systems design and implementation
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for the Multiorganization Scheduling Problem
IEEE Transactions on Parallel and Distributed Systems
Exploiting replication and data reuse to efficiently schedule data-intensive applications on grids
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Workload analysis of a cluster in a grid environment
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Distributed Demand and Response Algorithm for Optimizing Social-Welfare in Smart Grid
IPDPS '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium
The characteristics and performance of groups of jobs in grids
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
MPTCP is not pareto-optimal: performance issues and a possible solution
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Hi-index | 0.00 |
Large scale distributed systems typically comprise hundreds to millions of entities (applications, users, companies, universities) that have only a partial view of resources (computers, communication links). How to fairly and efficiently share such resources between entities in a distributed way has thus become a critical question. Although not all applications are suitable for execution on large scale distributed computing platform, ideal are the Bag-of-Tasks (BoT) applications. Hence a large fraction of jobs in workloads imposed on Grids is made of sequential applications submitted in the form of BoTs. Up until now, mainly simple mechanisms have been used to ensure a fair sharing of resources among these applications. Although these mechanisms are proved to be efficient for CPU-bound applications, they are known to be ineffective in the presence of network-bound applications. A possible answer resorts to Lagrangian optimization and distributed gradient descent. Under certain conditions, the resource sharing problem can be formulated as a global optimization problem, which can be solved by a distributed self-stabilizing supply and demand algorithm. In the last decade, this technique has been applied to design various network protocols (variants of TCP, multi-path network protocols, wireless network protocols) and even distributed algorithms for smart grids. In this article, we explain how to use this technique for fairly scheduling concurrent BoT applications with arbitrary communication-to-computation ratio on a Grid. Yet, application heterogeneity raises severe convergence and stability issues that did not appear in the previous contexts and need to be addressed by non-trivial modifications. The effectiveness of our proposal is assessed through an extensive set of complex and realistic simulations.