10 search results - page 1 / 2 » An Efficient Algorithm for Reconfiguring Shared Spare RRAM |
ICCD
2004
IEEE
14 years 2 months ago
2004
IEEE
Redundant rows and columns have been used for years to improve the yield of DRAM fabrication. However, finding a memory repair solution has been proved to be an NP-complete proble...
FAW
2008
Springer
13 years 7 months ago
2008
Springer
constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized ...
DC
2010
13 years 2 months ago
2010
In this paper, we present RAMBO, an algorithm for emulating a read/write distributed shared memory in a dynamic, rapidly changing environment. RAMBO provides a highly reliable, hi...
AINA
2011
IEEE
12 years 9 months ago
2011
IEEE
— Next generation wireless networks will be heterogeneous, where several primary users (PU e.g. licensed users) and secondary users (SU e.g. unlicensed users) can operate in the ...
ICSE
2004
IEEE-ACM
14 years 5 months ago
2004
IEEE-ACM
An important emerging requirement for computing systems is the ability to adapt at run time, taking advantage of local computing devices, and coping with dynamically changing reso...