Abstract
In the last years, computer networks with mesh structure become a common computing platform. It is very important to find free resources for executing incoming jobs in a short time. The objective of the paper is a comparison between five task allocation algorithms. The evaluation of algorithms properties has been carried out with utilization of the designed and implemented experimentation system. The investigations have been concentrated on complexity as the introduced measure of efficiency. Moreover, a concept of an experimentation system allowing research for allocation in dynamic mode is presented.
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.
Similar content being viewed by others
References
Koszalka, L., Kubiak, M., Pozniak-Koszalka, I.: Allocation Algorithm for Mesh-Structured Networks. In: Proc. of IARIA ICN 2006 Conf., 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 Int. Conf. on Parallel Processing (1997)
Koszalka, L., Lisowski, D., Pozniak-Koszalka, I.: Comparison of Allocation Algorithms for Mesh Structured Networks with Using Multistage Simulation. 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)
Batcher, K.E.: Architecture of Massively Parallel Processor. In: Proc. of Intern. Conf. on Computer Architecture, pp. 174–179 (1998)
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 Distrib-uted 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, 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)
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., Kubiak, M., Pozniak-Koszalka, I. (2006). Comparison of SBA – Family Task Allocation Algorithms for Mesh Structured Networks. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_3
Download citation
DOI: https://doi.org/10.1007/11942634_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49860-5
Online ISBN: 978-3-540-49862-9
eBook Packages: Computer ScienceComputer Science (R0)