Differences between current version and revision by previous author of RoundRobin.
Other diffs: Previous Major Revision, Previous Revision, or view the Annotated Edit History
| Newer page: | version 3 | Last edited on Saturday, July 23, 2005 1:06:20 pm | by AristotlePagaltzis | |
| Older page: | version 2 | Last edited on Sunday, June 29, 2003 11:39:37 am | by CraigBox | Revert |
@@ -1,9 +1,17 @@
A system (in sport) whereby every team plays every other team in a nicely pre-arranged fashion.
-In computing, the action of looking up a value and being given a list of things to try. Useful in the case that the first site might fall over, etc
.
+In computing, the action of looking up a value and being given a list of things to try.
-
[[crb@jane
]: /usr/src/linux-2.4.21$ host google.com
- google.com has address 216.239.53.100
- google.com has address 216.239.51.100
+The canonical example is __RoundRobin
[DNS
]__
:''''
-See also [rrdtool] and RoundRobinArchive
.
+ <verbatim>
+ $ host google.com
+ google.com has address 216.239.53.100
+ google.com has address 216.239.51.100
+ </verbatim>
+
+This is useful in the case that the first site might fall over, etc.
+
+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.
+
+
See also [rrdtool] and [Cacti]
.
