Sciweavers

2110 search results - page 416 / 422
» What is the complexity of a distributed computing system
Sort
View
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 9 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor
HPCA
2009
IEEE
14 years 8 months ago
Architectural Contesting
Previous studies have proposed techniques to dynamically change the architecture of a processor to better suit the characteristics of the workload at hand. However, all such appro...
Hashem Hashemi Najaf-abadi, Eric Rotenberg
HPCA
2009
IEEE
14 years 8 months ago
Fast complete memory consistency verification
The verification of an execution against memory consistency is known to be NP-hard. This paper proposes a novel fast memory consistency verification method by identifying a new na...
Yunji Chen, Yi Lv, Weiwu Hu, Tianshi Chen, Haihua ...
HPCA
2008
IEEE
14 years 7 months ago
Fundamental performance constraints in horizontal fusion of in-order cores
A conceptually appealing approach to supporting a broad range of workloads is a system comprising many small cores that can be fused, on demand, into larger cores. We demonstrate ...
Pierre Salverda, Craig B. Zilles
PODS
2006
ACM
138views Database» more  PODS 2006»
14 years 7 months ago
Efficiently ordering subgoals with access constraints
d Abstract] Guizhen Yang Artificial Intelligence Center SRI International Menlo Park, CA 94025, USA Michael Kifer Dept. of Computer Science Stony Brook University Stony Brook, NY 1...
Guizhen Yang, Michael Kifer, Vinay K. Chaudhri