Optimal flow control and routing in multi-path networks
Performance Evaluation - Special issue: Internet performance and control of network systems
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Generalized nash bargaining solution for bandwidth allocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive Allocation of Independent Tasks to Maximize Throughput
IEEE Transactions on Parallel and Distributed Systems
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
IEEE Transactions on Parallel and Distributed Systems
An integrated security-aware job scheduling strategy for large-scale computational grids
Future Generation Computer Systems
Myopic versus clairvoyant admission policies in wireless networks
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Non-clairvoyant scheduling of multiple bag-of-tasks applications
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Multiple objective scheduling of HPC workloads through dynamic prioritization
Proceedings of the High Performance Computing Symposium
Fair scheduling of bag-of-tasks applications using distributed Lagrangian optimization
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In this paper, we present a fully decentralized algorithm for fair resource sharing between multiple bag-of-tasks applications in a grid environment. This algorithm is inspired from related work on multi-path routing in communication network. An interesting feature of this algorithm is that it allows the choice of wide variety of fairness criteria and achieves both optimal path selection and flow control. In addition, this algorithm only requires local information at each slave computing tasks and at each buffer of the network links while minimal computation is done by the schedulers. A naive adaptation is unstable and inefficient though. Fortunately, a simple and effective scaling mechanism is sufficient to circumvent this issue. This scaling mechanism is motivated by a careful study of the subtle differences with the classical multi-path routing problem. We prove its efficiency through a detailed analysis of a simple simulation.