The objective of the paper is an evaluation of task allocation algorithms for computer networks with mesh topology. The properties of algo rithms have been researched with the designed and implemented experimentation system. The system gives opportunities for simulating allocation processes in the static mode and in the dynamic mode, as well. The investigations have been concentrated on comparing algorithm complexity as the introduced measure of efficiency. The obtained results justify a conclusion that the proposed Window Stack Based Algorithm is very promising.
CITATION STYLE
Koszalka, L. (2006). Static and dynamic allocation algorithms in mesh structured networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4317, pp. 89–101). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/11951957_9
Mendeley helps you to discover research relevant for your work.