Sciweavers

329 search results - page 21 / 66
» Experimental Implementation of Dynamic Access Ordering
Sort
View
DLS
2009
150views Languages» more  DLS 2009»
13 years 7 months ago
Fast type reconstruction for dynamically typed programming languages
Type inference and type reconstruction derive static types for program elements that have no static type associated with them. They have a wide range of usage, such as helping to ...
Frédéric Pluquet, Antoine Marot, Roe...
APLAS
2009
ACM
14 years 4 months ago
Ownership Downgrading for Ownership Types
Ownership types support information hiding by providing object-based encapsulation. However the static restrictions they impose on object accessibility can limit the expressiveness...
Yi Lu 0003, John Potter, Jingling Xue
ISCA
2007
IEEE
145views Hardware» more  ISCA 2007»
14 years 4 months ago
Mechanisms for store-wait-free multiprocessors
Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, prog...
Thomas F. Wenisch, Anastassia Ailamaki, Babak Fals...
SIGMOD
2009
ACM
172views Database» more  SIGMOD 2009»
14 years 4 months ago
Self-organizing tuple reconstruction in column-stores
Column-stores gained popularity as a promising physical design alternative. Each attribute of a relation is physically stored as a separate column allowing queries to load only th...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
IPPS
2010
IEEE
13 years 7 months ago
Runtime checking of serializability in software transactional memory
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
Arnab Sinha, Sharad Malik