Sciweavers

2994 search results - page 538 / 599
» Time sequences
Sort
View
ANCS
2005
ACM
14 years 2 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
ESA
2005
Springer
123views Algorithms» more  ESA 2005»
14 years 2 months ago
Oblivious vs. Distribution-Based Sorting: An Experimental Evaluation
We compare two algorithms for sorting out-of-core data on a distributed-memory cluster. One algorithm, Csort, is a 3-pass oblivious algorithm. The other, Dsort, makes three passes...
Geeta Chaudhry, Thomas H. Cormen
SPAA
2004
ACM
14 years 2 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
ISIPTA
2003
IEEE
120views Mathematics» more  ISIPTA 2003»
14 years 2 months ago
Towards a Chaotic Probability Model for Frequentist Probability: The Univariate Case
We adopt the same mathematical model of a set M of probability measures as is central to the theory of coherent imprecise probability. However, we endow this model with an objecti...
Pablo Ignacio Fierens, Terrence L. Fine
SIGMOD
2010
ACM
198views Database» more  SIGMOD 2010»
14 years 1 months ago
Continuous analytics over discontinuous streams
Continuous analytics systems that enable query processing over steams of data have emerged as key solutions for dealing with massive data volumes and demands for low latency. Thes...
Sailesh Krishnamurthy, Michael J. Franklin, Jeffre...