| Creator |
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Source Title |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
|
|
|
|
| Related URI |
|
|
|
|
|
| Relation |
|
|
|
|
|
| Abstract |
コンピュータ・システムの高い信頼性を保つためには，障害の原因となる故障を検出する必要がある． 故障を検出する一般的な手法として，時間的または空間的冗長性の利用が挙げられる．しかし，それらの冗長性の 実現には追加ハードウェアや実行時間の増加といった問題が生じる．本稿では，ハードウェアの大幅な変更をする ことなく空間的冗長性を実現するデータパス分割方式を提案する．また，演算時に必要となる最小のビット幅...を考 慮し，実行時間オーバヘッドを削減する方式を提案する．最善の場合を想定し実行時間を測定した結果，冗長度2 の場合で平均1.62 倍，4 の場合で平均3.09 倍の実行時間増加となり，本手法は非常に有効であることが確認できた．
In order to maintain the high reliability of a computer system, it is necessary to detect the failure leading to an obstacle. In general, failure is detected by using time redundancy or spatial redundancy. However, in order to realize these redundancies, additional hardware and execution time increase. In this paper, the data-path partitioning which realizes spatial redundancy is proposed without making a large change of hardware. Moreover, the system which reduces an execution time overhead is proposed in consideration of the minimum bit width which is needed at the time of operation. In our evaluation, execution time became an average of 1.62 times (redundancy: two), and an average of 3.09 times (redundancy: four). Therefore, this technique is very effective.show more
|
Export Mendeley
matsusaka04_2