Sciweavers

256 search results - page 33 / 52
» Speculative Versioning Cache
Sort
View
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
13 years 11 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
DEXAW
1998
IEEE
83views Database» more  DEXAW 1998»
13 years 12 months ago
Programming Views for Mobile Database Clients
Within a database mobile environment, cached data on mobile clients can take the form of materialized views. In order to e ciently maintain such materialized views while taking in...
Susan Weissman Lauzac, Panos K. Chrysanthis
EUROPAR
2000
Springer
13 years 11 months ago
Automatic Generation of Block-Recursive Codes
Abstract. Block-recursive codes for dense numerical linear algebra computations appear to be well-suited for execution on machines with deep memory hierarchies because they are e e...
Nawaaz Ahmed, Keshav Pingali
DAC
2005
ACM
14 years 8 months ago
High performance computing on fault-prone nanotechnologies: novel microarchitecture techniques exploiting reliability-delay trad
Device and interconnect fabrics at the nanoscale will have a density of defects and susceptibility to transient faults far exceeding those of current silicon technologies. In this...
Andrey V. Zykov, Elias Mizan, Margarida F. Jacome,...
ISCA
2010
IEEE
189views Hardware» more  ISCA 2010»
14 years 22 days ago
RETCON: transactional repair without replay
Over the past decade there has been a surge of academic and industrial interest in optimistic concurrency, i.e. the speculative parallel execution of code regions that have the se...
Colin Blundell, Arun Raghavan, Milo M. K. Martin