A dynamic processor management strategy on the reconfigurable meshes
Authors: 
Kyung-Hee Seo and Sung-Chun KimAuthors Info & Claims
Kyung-Hee Seo and Sung-Chun KimAuthors Info & ClaimsPages 54 - 61
Abstract
A reconfigurable mesh consists of a mesh connected topology augmented by a dynamically reconfigurable bus system. The reconfigurable mesh combines two attractive features of massively parallel system, namely constant diameter and the flexibility of the bus system. Efficient utilisation of processing resources in a large, multi user parallel system depends on the reliable processor management scheme. This paper presents a dynamic and reliable processor allocation strategy to increase the performance of mesh connected parallel systems with faulty processors. The basic idea is to reconfigure a faulty mesh system into a maximum convex system using the fault free upper or lower boundary nodes to compensate for the nonboundary faulty nodes. To utilise the nonrectangular shaped system parts, our strategy tries to allocate L shaped submeshes instead of signalling the allocation failure. Extensive simulations show that the strategy performs more efficiently than other strategies in terms of the completion time, the job response time and the system utilisation.
References
[1]
Babbar, D. and Krueger, P. (1994) 'A performance comparison of processor allocation and job scheduling algorithms for mesh-connected multiprocessors', In Proc. IEEE Symposium on Parallel and Distributed Processing, pp. 46-53.
[2]
Chuang, P.J. and Tzeng, N.F. (1991) 'An efficient submesh allocation strategy for mesh computer systems', In Proc. Int'l Conf. on Distributed Computing Systems, pp. 256-263.
[3]
Cray Research Inc. (1993) Cray T3D System Architecture Overview, Tech. Report, September, On Cray's website at http://www.cray.com.
[4]
Ding, J. and Bhuyan, L.N. (1993) 'An adaptive submesh allocation strategy for two-dimensional mesh connected systems', In Proc. Int'l Conf. on Parallel Processing, pp. II-193-II-200.
[5]
Gupta, V. and Jayendran, A. (1996) 'A flexible processor allocation strategy for mesh connected parallel systems', Proc. Int'l Conf. on Parallel Processing, pp. III-166-III-173.
[6]
Hong, J.W., Mehlhorn, K. and Rosenberg, A.L. (1983) 'Cost trade-offs in graph embeddings, with applications', Journal of the ACM, October, Vol. 30, No. 4, pp. 709-728.
[7]
Hwang, K. and Xu, Z. (1998) Scalable Parallel Computing: Technology, Architecture, Programming, WCB/McGraw-Hill, pp. 273-281.
[8]
Krueger, P. and Lai, T-H. (1994) 'Job scheduling is more important than processor allocation for hypercube computers', IEEE Trans, On Parallel and Distributed Systems, May, Vol. 5, No. 5, pp. 488-497.
[9]
Li, K. and Cheng, K.H. (1990) 'A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system', In Proc. ACM Computer Science Conf., pp. 22-28.
[10]
Liu, T., Huang, W-K., Lombardi, F. and Bhuyan L.N. (1995) 'A submesh allocation scheme for mesh-connected multiprocessor systems', In Proc. Int'l Conf. on Parallel Processing, pp. II-159-II-163.
[11]
Miller, R., Kumar, P.V.K., Reisis, D.I. and Stout, Q.F. (1988) 'Meshes with reconfigurable buses', Proc. MIT Conf. Advanced Research in VLSI, April, pp. 163-178.
[12]
Sharma, D.D. and Pradhan, D.K. (1993) 'A fast and efficient strategy for submesh allocation in mesh-connected parallel computers', In Proc. IEEE Symposium on Parallel and Distributed Processing, December, pp. 682-689.
[13]
Sharma, D.D. and Pradhan, D.K. (1994) 'Job scheduling in mesh multicomputers', In Proc. Int'l Conf. on Parallel Processing, pp. II-251-II-258.
[14]
Tzeng, N.F. and Lin, G. (1996) 'Maximum reconfiguration of 2-D mesh systems with faults', In Proc. Int'l Conf. on Parallel Processing, pp. I-77-I-84.
[15]
Zhu, Y. (1992) 'Efficient processor allocation strategies for mesh-connected parallel computers', Journal of Parallel and Distributed Computing, December, Vol. 16, pp. 328-337.
Index Terms
- A dynamic processor management strategy on the reconfigurable meshes
Index terms have been assigned to the content through auto-classification.
Recommendations
Parallel Computations on Reconfigurable Meshes
The mesh with reconfigurable bus is presented as a model of computation. The reconfigurable mesh captures salient features from a variety of sources, including the CAAPP, CHiP, polymorphic-torus network, and bus automation. It consists of an array of ...
Supporting tasks with adaptive groups in data parallel programming
A set of communication operations is defined, which allows a form of task parallelism to be achieved in a data parallel architecture. The set of processors can be subdivided recursively into groups, and a communication operation inside a group never ...
Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes
A number of applications in computer-aided manufacturing, CAD, and computer-aided geometric design ask for triangulating pieces of material with defects. These tasks are known collectively as constrained triangulations. Recently, a powerful architecture ...
Comments
Information & Contributors
Information
Published In
Publisher
Inderscience Publishers
Geneva 15, Switzerland
Publication History
Published: 01 September 2005
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in