17 search results - page 3 / 4 » qest 2009 |
139
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...
148
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
—The departure process of a BMAP/MAP/1 queue can be approximated in different ways: as a Markovian arrival process (MAP) or as a matrix-exponential process (MEP). Both approximat...
145
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
—Gossip protocols are designed to operate in very large, decentralised networks. A node in such a network bases its decision to interact (gossip) with another node on its partial...
130
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
—Disk drives are a common performance bottleneck in modern storage systems. To alleviate this, disk manufacturers employ a variety of I/O request scheduling strategies which aim ...
138
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
—Failure mode and effects analysis (FMEA) is a technique to reason about possible system hazards that result from system or system component failures. Traditionally, FMEA does no...