A bridging model for parallel computation
Communications of the ACM
Towards an architecture-independent analysis of parallel algorithms
SIAM Journal on Computing
Parallel sorting by regular sampling
Journal of Parallel and Distributed Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
General purpose parallel computing
Lectures on parallel computation
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model
ESA '95 Selected papers from the third European symposium on Algorithms
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
IEEE Transactions on Parallel and Distributed Systems
A Self-Organizing Flock of Condors
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
In the case of desktop grids, a single hardware-determined latency and constant bandwidth between processors cannot be assumed without incurring in unnecessary error. The actual network topology is determined not only by the physical hardware, but also by the instantaneous bandwidth availability for parallel processes to communicate. In this paper we present a novel task assignment scheme which takes the dynamic network topology into consideration along with the traditionally evaluated variables such as processor availability and potential. The method performs increasingly better as the grid size increases.