3104 search results - page 322 / 621 » Using quantitative analysis to implement autonomic IT system... |
161
click to vote
QEST
2009
IEEE
16 years 22 days 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...
139
click to vote
CONCURRENCY
2008
15 years 6 months ago
2008
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
132
click to vote
CN
2002
15 years 5 months ago
2002
End-to-end QoS requires mapping of QoS between heterogeneous subnetworks of the end-to-end path. For this mapping to be accurate, we argue, in this paper, that it should be based ...
163
click to vote
EUROPAR
2006
Springer
15 years 9 months ago
2006
Springer
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
145
click to vote
GPEM
2007
15 years 6 months ago
2007
We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...