Sciweavers

12453 search results - page 45 / 2491
» Concurrent Data Structures
Sort
View
ICFEM
2000
Springer
15 years 3 months ago
Fragmented Retrenchment, Concurrency and Fairness
Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and brie...
Richard Banach, Michael Poppleton
PPOPP
2009
ACM
16 years 13 days ago
Atomic quake: using transactional memory in an interactive multiplayer game server
Transactional Memory (TM) is being studied widely as a new technique for synchronizing concurrent accesses to shared memory data structures for use in multi-core systems. Much of ...
Adrián Cristal, Eduard Ayguadé, Fera...
DEXA
1998
Springer
179views Database» more  DEXA 1998»
15 years 3 months ago
Concurrent Warehouse Maintenance Without Compromising Session Consistency
Abstract. To achieve acceptable query response times in data warehouse environments, the data have to be pre-aggregated according to the need of the applications and stored redunda...
Michael Teschke, Achim Ulbrich
LICS
2012
IEEE
13 years 2 months ago
The Winning Ways of Concurrent Games
Abstract—A bicategory of concurrent games, where nondeterministic strategies are formalized as certain maps of event structures, was introduced recently. This paper studies an ex...
Pierre Clairambault, Julian Gutierrez, Glynn Winsk...
SPAA
2005
ACM
15 years 5 months ago
Using elimination to implement scalable and lock-free FIFO queues
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
Mark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit