Sciweavers

720 search results - page 140 / 144
» Uniform Memory Hierarchies
Sort
View
PODC
2011
ACM
12 years 10 months ago
From bounded to unbounded concurrency objects and back
We consider the power of objects in the unbounded concurrency shared memory model, where there is an infinite set of processes and the number of processes active concurrently may...
Yehuda Afek, Adam Morrison, Guy Wertheim
PPOPP
2011
ACM
12 years 10 months ago
GRace: a low-overhead mechanism for detecting data races in GPU programs
In recent years, GPUs have emerged as an extremely cost-effective means for achieving high performance. Many application developers, including those with no prior parallel program...
Mai Zheng, Vignesh T. Ravi, Feng Qin, Gagan Agrawa...
ICDE
2006
IEEE
215views Database» more  ICDE 2006»
14 years 8 months ago
cgmOLAP: Efficient Parallel Generation and Querying of Terabyte Size ROLAP Data Cubes
In this demo we present the cgmOLAP server, the first fully functional parallel OLAP system able to build data cubes at a rate of more than 1 Terabyte per hour. cgmOLAP incorporat...
Ying Chen, Andrew Rau-Chaplin, Frank K. H. A. Dehn...
ISCC
2009
IEEE
163views Communications» more  ISCC 2009»
14 years 2 months ago
Distributed parallel scheduling algorithms for high-speed virtual output queuing switches
Abstract—This paper presents a novel scalable switching architecture for input queued switches with its proper arbitration algorithms. In contrast to traditional switching archit...
Lotfi Mhamdi, Mounir Hamdi
INFOCOM
2009
IEEE
14 years 2 months ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...