Sciweavers

660 search results - page 11 / 132
» Parallel Computer Workload Modeling with Markov Chains
Sort
View
LCN
2002
IEEE
14 years 18 days ago
On Modeling the Packet Error Statistics in Bursty Channels
Wireless channels usually face bursty errors, i.e., errors are prone to occur in clusters. These bit errors can be modeled using the Gilbert-Elliott model. When data packets are t...
Changli Jiao, Loren Schwiebert, Bin Xu
FOCS
2007
IEEE
14 years 2 months ago
Mixing Time Power Laws at Criticality
We study the mixing time of some Markov Chains converging to critical physical models. These models are indexed by a parameter β and there exists some critical value βc where th...
Yun Long, Asaf Nachmias, Yuval Peres
JSSPP
2009
Springer
14 years 2 months ago
Modeling Parallel System Workloads with Temporal Locality
In parallel systems, similar jobs tend to arrive within bursty periods. This fact leads to the existence of the locality phenomenon, a persistent similarity between nearby jobs, in...
Tran Ngoc Minh, Lex Wolters
DEBS
2010
ACM
13 years 11 months ago
Predictive publish/subscribe matching
A new publish/subscribe capability is presented: the ability to predict the likelihood that a subscription will be matched at some point in the future. Composite subscriptions con...
Vinod Muthusamy, Haifeng Liu, Hans-Arno Jacobsen
GECCO
2008
Springer
158views Optimization» more  GECCO 2008»
13 years 8 months ago
Convergence analysis of quantum-inspired genetic algorithms with the population of a single individual
In this paper, the Quantum-inspired Genetic Algorithms with the population of a single individual are formalized by a Markov chain model using a single and the stored best individ...
Mehrshad Khosraviani, Saadat Pour-Mozafari, Mohamm...