Sciweavers

631 search results - page 96 / 127
» Composable memory transactions
Sort
View
ASPLOS
2010
ACM
15 years 4 months ago
Dynamic filtering: multi-purpose architecture support for language runtime systems
This paper introduces a new abstraction to accelerate the readbarriers and write-barriers used by language runtime systems. We exploit the fact that, dynamically, many barrier exe...
Tim Harris, Sasa Tomic, Adrián Cristal, Osm...
FODO
1998
Springer
242views Algorithms» more  FODO 1998»
15 years 1 months ago
Optimizing OID Indexing Cost in Temporal Object-Oriented Database Systems
In object-oriented database systems (OODB) with logical OIDs, an OID index (OIDX) is needed to map from OID to the physical location of the object. In a transaction time temporal ...
Kjetil Nørvåg, Kjell Bratbergsengen
SIGMOD
2011
ACM
193views Database» more  SIGMOD 2011»
14 years 14 days ago
Fast checkpoint recovery algorithms for frequently consistent applications
Advances in hardware have enabled many long-running applications to execute entirely in main memory. As a result, these applications have increasingly turned to database technique...
Tuan Cao, Marcos Antonio Vaz Salles, Benjamin Sowe...
ISCA
2012
IEEE
243views Hardware» more  ISCA 2012»
13 years 2 days ago
BlockChop: Dynamic squash elimination for hybrid processor architecture
Hybrid processors are HW/SW co-designed processors that leverage blocked-execution, the execution of regions of instructions as atomic blocks, to facilitate aggressive speculative...
Jason Mars, Naveen Kumar
IPPS
2008
IEEE
15 years 4 months ago
Impact of multicores on large-scale molecular dynamics simulations
Processing nodes of the Cray XT and IBM Blue Gene Massively Parallel Processing (MPP) systems are composed of multiple execution units, sharing memory and network subsystems. Thes...
Sadaf R. Alam, Pratul K. Agarwal, Scott S. Hampton...