Sciweavers

595 search results - page 9 / 119
» Using Constraints with Memory to Implement Variable Eliminat...
Sort
View
ICESS
2007
Springer
14 years 1 months ago
An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory
Recently, NAND flash memory has been used for a storage device in various mobile computing devices such as MP3 players, mobile phones and laptops because of its shock-resistant, lo...
Hyun-Seob Lee, Sangwon Park, Ha-Joo Song, Dong-Ho ...
SAS
1999
Springer
13 years 11 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
CP
2005
Springer
14 years 27 days ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
PPOPP
2009
ACM
14 years 8 months ago
Transactional memory with strong atomicity using off-the-shelf memory protection hardware
This paper introduces a new way to provide strong atomicity in an implementation of transactional memory. Strong atomicity lets us offer clear semantics to programs, even if they ...
Martín Abadi, Tim Harris, Mojtaba Mehrara
DATE
2009
IEEE
143views Hardware» more  DATE 2009»
14 years 2 months ago
Time and memory tradeoffs in the implementation of AUTOSAR components
—The adoption of AUTOSAR in the development of automotive electronics can increase the portability and reuse of functional components. Inside each component, the behavior is repr...
Alberto Ferrari, Marco Di Natale, Giacomo Gentile,...