Dynamic Task Reconfiguration in the Faulty Hypercube Multiprocessor
Summary :
This paper considers processor utilization in faulty hypercube multiprocessor. The utilization is proportional to the continuity of processor allocation model based on Gray code. Busy and faulty processors make this model fragmented. That prevents assigning of larger tasks onto hypercube and decreases processor utilization. A set of procedures is derived which reassigns active tasks so that a new task configuration along with faulty processors makes as little damage as possible to the continuity of allocation model. First, a hypercube fragmentation measure is defined and a task reassigning technique presented. Then, procedures are given which determine: (1) active tasks to be reassigned, (2) their new optimal locations and (3) the shortest reassigning paths. At last, it is proved that while increasing processor utilization, presented scheme minimizes task reconfiguration overhead.
- Publication
- IEICE TRANSACTIONS on Information Vol.E74-D No.2 pp.435-446
- Publication Date
- 1991/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Fault Tolerant Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Dusan JOKANOVIC, Norio SHIRATORI, Shoichi NOGUCHI, "Dynamic Task Reconfiguration in the Faulty Hypercube Multiprocessor" in IEICE TRANSACTIONS on Information,
vol. E74-D, no. 2, pp. 435-446, February 1991, doi: .
Abstract: This paper considers processor utilization in faulty hypercube multiprocessor. The utilization is proportional to the continuity of processor allocation model based on Gray code. Busy and faulty processors make this model fragmented. That prevents assigning of larger tasks onto hypercube and decreases processor utilization. A set of procedures is derived which reassigns active tasks so that a new task configuration along with faulty processors makes as little damage as possible to the continuity of allocation model. First, a hypercube fragmentation measure is defined and a task reassigning technique presented. Then, procedures are given which determine: (1) active tasks to be reassigned, (2) their new optimal locations and (3) the shortest reassigning paths. At last, it is proved that while increasing processor utilization, presented scheme minimizes task reconfiguration overhead.
URL: https://global.ieice.org/en_transactions/information/10.1587/e74-d_2_435/_p
Copy
@ARTICLE{e74-d_2_435,
author={Dusan JOKANOVIC, Norio SHIRATORI, Shoichi NOGUCHI, },
journal={IEICE TRANSACTIONS on Information},
title={Dynamic Task Reconfiguration in the Faulty Hypercube Multiprocessor},
year={1991},
volume={E74-D},
number={2},
pages={435-446},
abstract={This paper considers processor utilization in faulty hypercube multiprocessor. The utilization is proportional to the continuity of processor allocation model based on Gray code. Busy and faulty processors make this model fragmented. That prevents assigning of larger tasks onto hypercube and decreases processor utilization. A set of procedures is derived which reassigns active tasks so that a new task configuration along with faulty processors makes as little damage as possible to the continuity of allocation model. First, a hypercube fragmentation measure is defined and a task reassigning technique presented. Then, procedures are given which determine: (1) active tasks to be reassigned, (2) their new optimal locations and (3) the shortest reassigning paths. At last, it is proved that while increasing processor utilization, presented scheme minimizes task reconfiguration overhead.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Dynamic Task Reconfiguration in the Faulty Hypercube Multiprocessor
T2 - IEICE TRANSACTIONS on Information
SP - 435
EP - 446
AU - Dusan JOKANOVIC
AU - Norio SHIRATORI
AU - Shoichi NOGUCHI
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E74-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1991
AB - This paper considers processor utilization in faulty hypercube multiprocessor. The utilization is proportional to the continuity of processor allocation model based on Gray code. Busy and faulty processors make this model fragmented. That prevents assigning of larger tasks onto hypercube and decreases processor utilization. A set of procedures is derived which reassigns active tasks so that a new task configuration along with faulty processors makes as little damage as possible to the continuity of allocation model. First, a hypercube fragmentation measure is defined and a task reassigning technique presented. Then, procedures are given which determine: (1) active tasks to be reassigned, (2) their new optimal locations and (3) the shortest reassigning paths. At last, it is proved that while increasing processor utilization, presented scheme minimizes task reconfiguration overhead.
ER -
English
