Browse > Article
http://dx.doi.org/10.3745/KIPSTA.2005.12A.4.281

Processor Allocation Scheme on the Mesh-connected System with Faults  

Seo, Kyung-Hee (성신여자대학교 컴퓨터정보학부)
Abstract
Efficient utilization of processing resources in a large multicomputer system with the possibility of fault occurrence 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 non-boundary faulty nodes. To utilize the non-rectangular shaped system parts, our strategy tries to allocate L-shaped submeshes instead of signaling the allocation failure. Extensive simulations show that the strategy performs more efficiently than other strategies in terms of the job response time md the system utilization.
Keywords
Reconfigurable Mesh; Maximal Convex System; Fragmentation; Processor Allocation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Y. Zhu, 'Efficient Processor Allocation Strategies for Mesh-Connected Parallel Computers,' Journal of Parallel and Distributed Computing, Vol.16, No.12, pp.328- 337, Dec., 1992   DOI   ScienceOn
2 D. D. Sharma and D. K. Pradhan, 'Job Scheduling in Mesh Multicomputers,' Proc. Int'l Conf. on Parallel Processing, Vol.II, pp.251- 258, 1994   DOI
3 N. F. Tzeng and G. Lin, Maximum Reconfiguration of 2-D Mesh Systems with Faults, In Proc. Int'l Conf. on Parallel Processing, pp.I-77-I-84, 1996.   DOI
4 B. S. Yoo and C. R. Das, 'A Fast and Efficient Processor Allocation Scheme for Mesh-Connencted Multicomputers,' IEEE Trans. on Computers, Vol.51, No.1, pp.46-60, Jan., 2002   DOI   ScienceOn
5 D. D. Sharma and D. K. Pradhan, 'A Fast and Efficient Strategy for Submesh Allocation in Mesh-Connected Parallel Computers,' Proc. IEEE Symposium on Parallel and Distributed Processing, pp.682-689, Dec., 1993   DOI
6 K. Li and K. H. Cheng, 'A Two-Dimensional Buddy System for Dynamic Resource Allocation in a Partitionable Mesh Connected System,' Proc. ACM Computer Science Conf., pp.22-28, 1990   DOI
7 T. Liu et al., 'A Submesh Allocation Scheme for Mesh-Connected Multiprocessor Systems,' Proc. Int'l Conf on Parallel Processing, Vol.II, pp.159- 163, 1995.
8 K.H. Seo and S.C. Kim, 'Improving system performance in contiguous processor allocation for mesh-connected parallel systems,' ELSEVIER Journal of Systems and Software, Vol. 67, Issue 1, pp.45-54, July, 2003   DOI   ScienceOn
9 V. Gupta and A. Jayendran, 'A Flexible Processor Allocation Strategy For Mesh Connected Parallel Systems,' Proc. Int'l Conf. on Parallel Processing, Vol.Ill, pp.166-173, 1996   DOI
10 M. Kang, C. Yu, H. Y. Youn, B. Lee, and M. Kim, Isomorphic Strategy for Processor Allocation in k-Ary n-Cube Systems, IEEE trans. on Computers, Vol.52, No.5, pp.645-657, May, 2003   DOI   ScienceOn
11 J. H. Kim and P. K. Rhee, 'The Rule-Based Approach to Reconfiguration of 2-D Processor arrays,' IEEE Trans. Computers, Vol.42, No.11, pp.1403-1408, Nov., 1993   DOI   ScienceOn
12 D. Babbar and P. Krueger, 'A performance Comparison of Processor Allocation and Job Scheduling Algorithms for Mesh-Connected Multiprocessors,' Proc. IEEE Symposium on Parallel and Distributed Processing, pp.46-53, 1994.   DOI
13 H. Chen and S. Hu, 'Submesh Determination in Faulty Tori and Meshes,' IEEE Trans. on Parallel and Distributed Systems, Vol.12, No.3, Mar., 2001   DOI   ScienceOn
14 A. Alan, B. Pritsker, J.J. O'reilly, and D.K. LaVal, Simulation with Visual SLAM and AweSim, John Wiley & Sons, Inc., 1997
15 P. J. Chuang and N. F. Tzeng, 'An Efficient Submesh Allocation Strategy for Mesh Computer systems,' Proc. Int'l Conf. on Distributed Computing Systems, pp.256-263, 1991   DOI
16 J. Ding and L. N. Bhuyan, 'An Adaptive Submesh Allocation Strategy for Two-Dimensional Mesh Connected systems,' Proc Int'l Conf. on Parallel Processing, Vol.II, pp.193-200, 1993   DOI