Comparison of allocation algorithms in mesh oriented structures for different scheduling techniques

Authors:
Bartosz Bodzon;Leszek Koszalka;Iwona Pozniak-Koszalka;Andrzej Kasprzak
Affiliations:
Department of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland;Department of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland;Department of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland;Department of Systems and Computer Networks, Wroclaw University of Technology, Wroclaw, Poland
Venue:
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part II
Year:
2012

Citing 11
Cited 0

A two-dimensional buddy systems for dynamic resource allocation in a partitionable mesh connected system

Journal of Parallel and Distributed Computing
Global combine algorithms for 2-D meshes with wormhole routing

Journal of Parallel and Distributed Computing
Submesh allocation in mesh multicomputers using busy-list: a best-fit approach with complete recognition capability

Journal of Parallel and Distributed Computing
A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers

IEEE Transactions on Computers
(R) A Flexible Processor Allocation Strategy for Mesh Connected Parallel Systems

ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
Improving system performance in contiguous processor allocation for mesh-connected parallel systems

Journal of Systems and Software
Fragmentation-Efficient Node Allocation Algorithm in 2D Mesh-Connected Systems

ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Task allocation in mesh connected processors with local search meta-heuristic algorithms

ACIIDS'10 Proceedings of the Second international conference on Intelligent information and database systems: Part II
Comparative Performance Evaluation of Non-Contiguous Allocation Algorithms in 2D Mesh-Connected Multicomputers

CIT '10 Proceedings of the 2010 10th IEEE International Conference on Computer and Information Technology
Comparison of allocation algorithms for mesh structured networks with using multistage simulation

ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
Static and dynamic allocation algorithms in mesh structured networks

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper concerns task allocation problem in mesh structured system. The dynamic case is considered. Four allocation algorithms have been evaluated. The research was focused on the impact of task scheduling technique co-operated with allocation algorithms. Two queuing schemes were compared: well-known First Come First Served and newly created, by the authors of this paper, heuristic scheduling technique called First Few Random. The comparison of efficiencies of different allocation algorithms combined with different queuing schemes has been done on the basis of simulation experiments made with a designed experimentation system. The discussion of the obtained results confirms that the proposed approach and created queuing scheme seem to be promising.