Initial allocation compensation algorithm for redundancy allocation: The scanning heuristic
- Authors
- Ha, Chunghun; Kuo, Way
- Issue Date
- 2008
- Publisher
- TAYLOR & FRANCIS INC
- Keywords
- redundancy allocation; reliability optimization; scanning heuristic
- Citation
- IIE TRANSACTIONS, v.40, no.7, pp.678 - 689
- Journal Title
- IIE TRANSACTIONS
- Volume
- 40
- Number
- 7
- Start Page
- 678
- End Page
- 689
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/23505
- DOI
- 10.1080/07408170701730800
- ISSN
- 0740-817X
- Abstract
- The tiny feature size in current semiconductor integrated circuits naturally requires redundancy strategies to improve manufacturing yield and operating reliability. To find an optimal redundancy architecture that provides maximum yield and reliability is a trade-off problem. In the reliability optimization field, this type of problem is generally called a redundancy allocation problem. In this paper, we propose a new iterative algorithm, the scanning heuristic, to solve the redundancy allocation problem. The solution quality of conventional iterative heuristics is highly dependent on the initial starting point of the algorithm employed. To overcome this weakness, the scanning heuristic systematically divides the original solution space into several small bounded solution spaces. The local optimum in each divided solution space then becomes a candidate for the final solution. The experimental results demonstrate that the proposed heuristic, and subsequently some combinations of heuristics, are superior to existing heuristics in terms of solution quality.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/23505)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.