Sciweavers

11212 search results - page 430 / 2243
» Semi-persistent Data Structures
Sort
View
FUIN
2007
100views more  FUIN 2007»
15 years 6 months ago
Interpreted Nets
The nets considered here are an extension of Petri nets in two aspects. In the semantical aspect, there is no one firing rule common to all transitions, but every transition is tr...
Ludwik Czaja
WS
2008
ACM
15 years 6 months ago
hGRDDL: Bridging microformats and RDFa
We propose hGRDDL (pronounced "h-griddle"), a simple mechanism for transforming ad-hoc HTML-embedded structured data, such as microformats, into RDFa. This technique pre...
Ben Adida
WDAG
2010
Springer
216views Algorithms» more  WDAG 2010»
15 years 4 months ago
A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware
The imminent arrival of best-effort transactional hardware has spurred new interest in the construction of nonblocking data structures, such as those that require atomic updates to...
Francois Carouge, Michael F. Spear
PODC
2011
ACM
14 years 9 months ago
On the power of hardware transactional memory to simplify memory management
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
Aleksandar Dragojevic, Maurice Herlihy, Yossi Lev,...
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 9 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu