Abstract.
Among all non-blocking job scheduling techniques for mesh-connected multiprocessor systems to ensure contiguous processor allocation, Largest-Job-First (LJF) technique proves to be one of the best in achieving small latency compared to First-Come-First-Serve (FCFS) among others. The scheduling becomes “blocking” whenever a job reaches a bypass limit and it deprives the scheduling process the flexibility benefit in its non-blocking nature. Such an adverse effect is especially pronounced in LJF compared to the simpler FCFS. This paper proposes a novel scheduling technique that is capable of dynamically adjusting the priority of a job in the queue by weighing its job size with a factor based on its current bypass value. This technique ensures that the advantage of the LJF is preserved while significantly diminishing the chance for the blocking situation to occur. In our simulation results, we show that frequency in leading to “blocking” scenario is significantly reduced and thus a much improved latency ensues.
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
Chang, C.-Y., Mohapatra, P.: An integrated processor management schema for the mesh-connected multicomputer systems. In: Proc. of the 1997 international conference on parallel processing, pp. 118-121 (1997)
Chuang, P.J., Tzeng, N.F.: An efficient submesh allocation strategy for mesh computer systems. In: Proc. Int’l Conf. Distributed Computing Systems, (August 1991), pp. 256-263 (1991)
Ding, J., Bhuyan, L.N.: An adaptive submesh allocation strategy for twodimensional mesh connected systems. In: Proc. Int’l Conf. Parallel Processing, (August 1993), pp. II-192-200 (1993)
Min, D., Mutka, M.W.: Efficient job scheduling in a mesh multicomputer without discrimination against large jobs. In: Proc. Seventh IEEE Symposium on Parallel and Distributed Processing, pp. 52-59 (1995)
Li, K., Cheng, K.H.: A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. J. Parallel and Distributed Computing 12, 79–83 (1991)
Sharma, D.D., Pradhan, D.K.: A fast and efficient strategy for submesh allocation in mesh-connected parallel computers. In: Proc.Symp. Parallel and Distributed Processing, (December 1993), pp. 682-689 (1993)
Sharma, D.D., Pradhan, D.K.: Job scheduling in mesh multicomputers. IEEE transactions on parallel and distributed systems 9(1) (January 1998)
Yoo, S.M., et al.: An efficient task allocation scheme for 2D mesh architectures. IEEE Transactions on Parallel and Distributed Systems 8(9) (September 1997)
Zhu, Y.: Efficient processor allocation strategies for mesh-connected parallel computers. Journal of Parallel and Distributed Computing 16, 328–337 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, WM., Ho, HJ. (2003). A Bypass-Sensitive Blocking-Preventing Scheduling Technique for Mesh-Connected Multicomputers. In: Veidenbaum, A., Joe, K., Amano, H., Aiso, H. (eds) High Performance Computing. ISHPC 2003. Lecture Notes in Computer Science, vol 2858. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39707-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-39707-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20359-9
Online ISBN: 978-3-540-39707-6
eBook Packages: Springer Book Archive