Sciweavers

10 search results - page 1 / 2
» An Efficient Algorithm for Reconfiguring Shared Spare RRAM
Sort
View
ICCD
2004
IEEE
99views Hardware» more  ICCD 2004»
14 years 8 months ago
An Efficient Algorithm for Reconfiguring Shared Spare RRAM
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...
Hung-Yau Lin, Hong-Zu Chou, Fu-Min Yeh, Ing-Yi Che...
FAW
2008
Springer
137views Algorithms» more  FAW 2008»
14 years 22 days ago
Constraint Bipartite Vertex Cover: Simpler Exact Algorithms and Implementations
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 ...
Guoqiang Bai 0002, Henning Fernau
DC
2010
13 years 7 months ago
Rambo: a robust, reconfigurable atomic memory service for dynamic networks
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...
Seth Gilbert, Nancy A. Lynch, Alexander A. Shvarts...
AINA
2011
IEEE
13 years 2 months ago
Power Adaptive Cognitive Pilot Channel for Spectrum Co-existence in Wireless Networks
— 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 ...
Md. Akbar Hossain, Roberto Passerone
ICSE
2004
IEEE-ACM
14 years 11 months ago
Dynamic Configuration of Resource-Aware Services
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...
David Garlan, João Pedro Sousa, Mary Shaw, ...