Sciweavers

5640 search results - page 648 / 1128
» Parallelizing the Data Cube
Sort
View
130
Voted
PDIS
1996
IEEE
15 years 8 months ago
Scrambling Query Plans to Cope With Unexpected Delays
Accessing data from numerous widely-distributed sources poses signi cant new challenges for query optimization and execution. Congestion and failures in the network can introduce ...
Laurent Amsaleg, Michael J. Franklin, Anthony Toma...
ICPP
1994
IEEE
15 years 8 months ago
Optimizing IPC Performance for Shared-Memory Multiprocessors
We assert that in order to perform well, a shared-memory multiprocessorinter-process communication (IPC)facility mustavoid a) accessing any shared data, and b) acquiring any locks...
Benjamin Gamsa, Orran Krieger, Michael Stumm
PODC
1990
ACM
15 years 8 months ago
Composite Registers
We introduce a shared data object, called a composite register, that generalizes the notion of an atomic register. A composite register is an array-like shared data object that is...
James H. Anderson
CASES
2007
ACM
15 years 8 months ago
Application driven embedded system design: a face recognition case study
The key to increasing performance without a commensurate increase in power consumption in modern processors lies in increasing both parallelism and core specialization. Core speci...
Karthik Ramani, Al Davis
CLADE
2004
IEEE
15 years 7 months ago
Engineering a Peer-to-Peer Collaboratory for Tissue Microarray Research
This paper presents the design, development and evaluation of a prototype peer-to-peer collaboratory for imaging, analyzing, and seamlessly sharing tissue microarrays (TMA), corre...
Cristina Schmidt, Manish Parashar, Wenjin Chen, Da...