Please use this identifier to cite or link to this item: https://doi.org/10.1109/12.509914
Title: A new class of efficient algorithms for reconfiguration of memory arrays
Authors: Low, C.P. 
Leong, H.W. 
Keywords: Heuristic algorithms
Np-completeness
Rrams
Sparsity
Throughput
Vertex covers
Issue Date: 1996
Citation: Low, C.P., Leong, H.W. (1996). A new class of efficient algorithms for reconfiguration of memory arrays. IEEE Transactions on Computers 45 (5) : 614-618. ScholarBank@NUS Repository. https://doi.org/10.1109/12.509914
Abstract: In this paper, we present a new class of linear time heuristic algorithms for reconfiguring RRAMs. One novel feature of our algorithms is that we are able to derive new bounds on the fault counts for fast detection of reparable and irreparable RRAMs. Another novel feature is that, based on our algorithms, we are able to identify a new polynomial time solvable instance of the reconfiguration problem. Empirical results indicate that our new class of algorithms is indeed fast and effective. ©1996 IEEE.
Source Title: IEEE Transactions on Computers
URI: http://scholarbank.nus.edu.sg/handle/10635/99161
ISSN: 00189340
DOI: 10.1109/12.509914
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

30
checked on Jan 21, 2020

WEB OF SCIENCETM
Citations

27
checked on Jan 21, 2020

Page view(s)

137
checked on Jan 26, 2020

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.