Sciweavers

287 search results - page 17 / 58
» Introducing parallelism and concurrency in the data structur...
Sort
View
CF
2010
ACM
14 years 14 days ago
ERBIUM: a deterministic, concurrent intermediate representation for portable and scalable performance
Tuning applications for multi-core systems involve subtle concepts and target-dependent optimizations. New languages are being designed to express concurrency and locality without...
Cupertino Miranda, Philippe Dumont, Albert Cohen, ...
CIDR
2003
125views Algorithms» more  CIDR 2003»
13 years 8 months ago
Crossing the Structure Chasm
It has frequently been observed that most of the world’s data lies outside database systems. The reason is that database systems focus on structured data, leaving the unstructur...
Alon Y. Halevy, Oren Etzioni, AnHai Doan, Zachary ...
PODC
2010
ACM
13 years 9 months ago
Brief announcement: efficient graph algorithms without synchronization
We give a graph decomposition technique that creates entirely independent subproblems for graph problems such as coloring and dominating sets that can be solved without synchroniz...
Johannes Schneider, Roger Wattenhofer
PPOPP
2011
ACM
12 years 10 months ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
IEEEPACT
1998
IEEE
13 years 11 months ago
Athapascan-1: On-Line Building Data Flow Graph in a Parallel Language
In order to achieve practical efficient execution on a parallel architecture, a knowledge of the data dependencies related to the application appears as the key point for building...
François Galilée, Jean-Louis Roch, G...