Sciweavers

151 search results - page 14 / 31
» Efficient Skyline Computation over Low-Cardinality Domains
Sort
View
JSSPP
2010
Springer
14 years 10 months ago
Dynamic Proportional Share Scheduling in Hadoop
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mech...
Thomas Sandholm, Kevin Lai
105
Voted
CCGRID
2009
IEEE
14 years 10 months ago
Resource Information Aggregation in Hierarchical Grid Networks
We propose information aggregation as a method for summarizing the resource-related information, used by the task scheduler. Through this method the information of a set of resour...
Panagiotis C. Kokkinos, Emmanouel A. Varvarigos
CCCG
2010
14 years 10 months ago
Determining the robustness of sensor barriers
Various notions of coverage provided by wireless sensor networks have attracted considerable attention over the past few years. In general, coverage can be expressed geometrically...
David G. Kirkpatrick
108
Voted
JGAA
2002
99views more  JGAA 2002»
14 years 12 months ago
Graph Layout Aesthetics in UML Diagrams: User Preferences
The merit of automatic graph layout algorithms is typically judged by their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minim...
Helen C. Purchase, Jo-Anne Allder, David A. Carrin...
ICCAD
2007
IEEE
234views Hardware» more  ICCAD 2007»
15 years 4 months ago
Finding linear building-blocks for RTL synthesis of polynomial datapaths with fixed-size bit-vectors
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon ...