A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Scalable load balancing techniques for parallel computers
Journal of Parallel and Distributed Computing
Provably efficient scheduling for languages with fine-grained parallelism
Journal of the ACM (JACM)
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Efficient load balancing for wide-area divide-and-conquer applications
PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
JXTA: A Network Programming Environment
IEEE Internet Computing
Adaptive scheduling of master/worker applications on distributed computational resources
Adaptive scheduling of master/worker applications on distributed computational resources
Jalapeno: secentralized grid computing using peer-to-peer technology
Proceedings of the 2nd conference on Computing frontiers
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Unstructured peer-to-peer networks for sharing processor cycles
Parallel Computing - Parallel matrix algorithms and applications (PMAA'04)
Peer-to-peer for computational grids: mixing clusters and desktop machines
Parallel Computing
ACM Transactions on Algorithms (TALG)
Scheduling multithreaded computations by work stealing
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Bag-of-Tasks Self-Scheduling over Range-Queriable Search Overlays
NPC '09 Proceedings of the 2009 Sixth IFIP International Conference on Network and Parallel Computing
The organic grid: self-organizing computation on a peer-to-peer network
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
In this paper, we propose and evaluate a flexible architecture for desktop grids that supports multiple task allocation policies on top of a structured P2P overlay. In our proposal, a Bag-of-Tasks application is submitted to random nodes and placed in their local queue, that is processed in a FIFO way. When a node becomes idle, a task allocation policy is executed that fetches tasks from remote nodes. The proposed architecture is flexible since it is decoupled from both the P2P middleware and the P2P overlay. A prototype of the proposed architecture was implemented on top of the JXTA middleware, using the Chord P2P search overlay. The results obtained in a 16-machine heterogeneous desktop grid show that very good performance gains are obtained with multiple task allocation policies. Also, a speedup of 9.85 was achieved for an application composed of 270 network flow balancing tasks, reducing its wallclock execution time from 32.51 min to 3.3 min.