Annotated edit history of
RoundRobin version 3, including all changes.
View license author blame.
| Rev |
Author |
# |
Line |
| 1 |
CraigBox |
1 |
A system (in sport) whereby every team plays every other team in a nicely pre-arranged fashion. |
| |
|
2 |
|
| 3 |
AristotlePagaltzis |
3 |
In computing, the action of looking up a value and being given a list of things to try. |
| 1 |
CraigBox |
4 |
|
| 3 |
AristotlePagaltzis |
5 |
The canonical example is __RoundRobin [DNS]__:'''' |
| 1 |
CraigBox |
6 |
|
| 3 |
AristotlePagaltzis |
7 |
<verbatim> |
| |
|
8 |
$ host google.com |
| |
|
9 |
google.com has address 216.239.53.100 |
| |
|
10 |
google.com has address 216.239.51.100 |
| |
|
11 |
</verbatim> |
| |
|
12 |
|
| |
|
13 |
This is useful in the case that the first site might fall over, etc. |
| |
|
14 |
|
| |
|
15 |
Another would be a __RoundRobin Archive__: a data structure that contains a pointer and N (eg 1000) spaces for data. Whenever you want to add a data item, you put the data item at the space pointed to by the pointer and increment it. If it gets to N, you set it back to 0 again. This way you can store exactly the last 1000 items of data with very little effort. |
| |
|
16 |
|
| |
|
17 |
See also [rrdtool] and [Cacti]. |
