Sciweavers

287 search results - page 6 / 58
» Introducing parallelism and concurrency in the data structur...
Sort
View
PPOPP
2012
ACM
13 years 7 months ago
A methodology for creating fast wait-free data structures
Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. ...
Alex Kogan, Erez Petrank
COMAD
2008
15 years 1 months ago
Concurrency Control in Distributed MRA Index Structure
Answering aggregate queries like sum, count, min, max over regions containing moving objects is often needed for virtual world applications, real-time monitoring systems, etc. Sin...
Neha Singh, S. Sudarshan
JSA
2006
114views more  JSA 2006»
14 years 11 months ago
Distributed computing using Java: A comparison of two server designs
This paper proposes a new concurrent data structure, called parallel hash table, for synchronizing the access of multiple threads to resources stored in a shared buffer. We prove ...
Boris Roussev, Jie Wu
IFM
2009
Springer
119views Formal Methods» more  IFM 2009»
15 years 6 months ago
Parallel Processes with Real-Time and Data: The ATLANTIF Intermediate Format
Abstract. To model real-life critical systems, one needs“high-level”languages to express three important concepts: complex data structures, concurrency, and real-time. So far, ...
Jan Stöcker, Frédéric Lang, Hub...
ENC
2004
IEEE
15 years 3 months ago
Efficient Data Structures and Parallel Algorithms for Association Rules Discovery
Discovering patterns or frequent episodes in transactions is an important problem in data-mining for the purpose of infering deductive rules from them. Because of the huge size of...
Christophe Cérin, Gay Gay, Gaël Le Mah...