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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Koszalka, L., Kubiak, M., Pozniak-Koszalka, I.: Allocation Algorithm for Mesh-Structured Networks. In: Proc. of 5th ICN Conference IARIA, ICN5: Management, Mauritius, IEEE Computer Society Press, Los Alamitos (2006)
Chang, C., Mohapatra, P.: An Integrated Processor Management Scheme for Mesh-Connected Multicomputer System. In: Proc. of International Conference on Parallel Processing (August 1997)
Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh - Structured Networks with Using Multistage Experiment. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3984, pp. 58–67. Springer, Heidelberg (2006)
Chmaj, G., Zydek, D., Koszalka, L.: Comparison of Task Allocation Algorithms for Mesh-Structured Systems, Computer Systems Engineering. In: Proc. of 4th Polish-British Workshop, pp. 39–50 (2004)
Sharma, D.D., Pradhan, D.K.: Submesh Allocation in Mesh Multicomputers Using Busy-List: A Best-Fit Approach with Complete Recognition Capability. Journal of Parallel and Distributed Computing 1, 106–118 (1996)
Byung, S., Das, C.R.: A Fast and Efficient Processor Allocation Scheme for Mesh-Connected Multicomputers. IEEE Trans. on Computers 1, 46–59 (2002)
De, M., Das, D., Ghosh, M.: An Efficient Sorting Algorithm on the Multi-Mesh Network. IEEE Trans. on Computers 10, 1132–1136 (1997)
Yang, Y., Wang, J.: Pipelined All-to-All Broadcast in All-Port Meshes and Tori. IEEE Trans. on Computers 10, 1020–1031 (2001)
Agarwal, A.: The MIT Alewife Machine: Architecture and Performance. Computer Architecture, 2–13 (1995)
Kasprzak, A.: Packet Switching Wide Area Networks. In: WPWR, Wroclaw (1997) (in Polish)
Liu, T., Huang, W., Lombardi, F., Bhutan, L.N.: A Submesh Allocation for Mesh-Connected Multiprocessor Systems. Parallel Processing, 159–163 (1995)
Batcher, K.E.: Architecture of a massively parallel processor. In: Proc. of International Conference on Computer Architecture, pp. 174–179 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koszalka, L. (2006). Static and Dynamic Allocation Algorithms in Mesh Structured Networks. In: Madria, S.K., Claypool, K.T., Kannan, R., Uppuluri, P., Gore, M.M. (eds) Distributed Computing and Internet Technology. ICDCIT 2006. Lecture Notes in Computer Science, vol 4317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11951957_9
Download citation
DOI: https://doi.org/10.1007/11951957_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68379-7
Online ISBN: 978-3-540-68380-3
eBook Packages: Computer ScienceComputer Science (R0)