Processor Allocation Scheme on the Mesh-connected System with Faults


The KIPS Transactions:PartA, Vol. 12, No. 4, pp. 281-288, Aug. 2005
10.3745/KIPSTA.2005.12.4.281,   PDF Download:

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 and the system utilization.,


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. H. Seo, "Processor Allocation Scheme on the Mesh-connected System with Faults," The KIPS Transactions:PartA, vol. 12, no. 4, pp. 281-288, 2005. DOI: 10.3745/KIPSTA.2005.12.4.281.

[ACM Style]
Kyung Hee Seo. 2005. Processor Allocation Scheme on the Mesh-connected System with Faults. The KIPS Transactions:PartA, 12, 4, (2005), 281-288. DOI: 10.3745/KIPSTA.2005.12.4.281.