Static and dynamic allocation algorithms in mesh structured networks

  • Authors:
  • Leszek Koszalka

  • Affiliations:
  • Chair of Systems and Computer Networks, Faculty of Electronics, Wroclaw University of Technology, Wroclaw, Poland

  • Venue:
  • ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The objective of the paper is an evaluation of task allocation algorithms for computer networks with mesh topology. The properties of algorithms 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.