Sciweavers

274 search results - page 33 / 55
» Dynamic Cluster Assignment Mechanisms
Sort
View
SAC
2008
ACM
13 years 6 months ago
Exploiting program cyclic behavior to reduce memory latency in embedded processors
In this work we modify the conventional row buffer allocation mechanism used in DDR2 SDRAM banks to improve average memory latency and overall processor performance. Our method as...
Ehsan Atoofian, Amirali Baniasadi
EDBT
2010
ACM
170views Database» more  EDBT 2010»
13 years 10 months ago
Augmenting OLAP exploration with dynamic advanced analytics
Online Analytical Processing (OLAP) is a popular technique for explorative data analysis. Usually, a fixed set of dimensions (such as time, place, etc.) is used to explore and ana...
Benjamin Leonhardi, Bernhard Mitschang, Rubé...
CORR
1999
Springer
98views Education» more  CORR 1999»
13 years 7 months ago
A variational description of the ground state structure in random satisfiability problems
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
Giulio Biroli, Rémi Monasson, Martin Weigt
CLUSTER
2007
IEEE
14 years 1 months ago
Satisfying your dependencies with SuperMatrix
— SuperMatrix out-of-order scheduling leverages el abstractions and straightforward data dependency analysis to provide a general-purpose mechanism for obtaining parallelism from...
Ernie Chan, Field G. Van Zee, Enrique S. Quintana-...
COMSWARE
2007
IEEE
14 years 1 months ago
Topology-based Clusterhead Candidate Selection in Wireless Ad-hoc and Sensor Networks
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due t...
Matthias R. Brust, Adrian Andronache, Steffen Roth...