'\" t .\" Title: amanda-taperscan .\" Author: Dustin J. Mitchell .\" Generator: DocBook XSL Stylesheets vsnapshot_8273 .\" Date: 06/01/2010 .\" Manual: Miscellanea .\" Source: Amanda 3.1.0 .\" Language: English .\" .TH "AMANDA\-TAPERSCAN" "7" "06/01/2010" "Amanda 3\&.1\&.0" "Miscellanea" .\" ----------------------------------------------------------------- .\" * set default formatting .\" ----------------------------------------------------------------- .\" disable hyphenation .nh .\" disable justification (adjust text to left margin only) .ad l .\" ----------------------------------------------------------------- .\" * MAIN CONTENT STARTS HERE * .\" ----------------------------------------------------------------- .SH "NAME" amanda-taperscan \- Amanda Taperscan Algorithms .SH "DESCRIPTION" .PP Amanda uses a \fItaperscan algorithm\fR to select volumes on which to store dumps\&. Historically Amanda has provided only one, fairly complex taperscan algorithm, but this algorithm did not suit the needs of all users\&. Now Amanda offers a wide array of algorithms to suit varied needs\&. Adding new algorithms is not difficult\&. .PP The taperscan algorithm is specified with the \fBtaperscan\fR parameter, which has a default value of \fBtraditional\fR\&. .PP Taperscan algorithms are implemented as perl packages with the prefix Amanda::Taper::Scan::\&. See the perl documentation for Amanda::Taper::Scan for more information\&. .SH "TAPERSCAN ALGORITHMS" .PP In general, these volumes will only select reusable volumes\&. These are volumes which are listed in the \fBtapelist\fR(5) with the \fIreuse\fR flag, and which are not among the \fItapecycle\-1\fR most recent volumes in the list\&. Put another way, reusable volumes do not contain data that must be retained\&. Note that if fewer than \fItapecycle\-1\fR volumes have been written then there are no reusable volumes\&. Newly labeled volumes (volumes that have been labeled with \fBamlabel\fR but never used) are considered reusable\&. .PP Many of these algorithms look for the oldest reusable volume\&. In most cases, this is the best volume to overwrite, as the data it contains is older than that on any other volume\&. If there are no reusable volumes, then there is no oldest reusable volume\&. .SS "traditional" .PP This algorithm duplicates Amanda\'s historical behavior, and it operates in two stages\&. .PP First, if there is an oldest reusable volume and if the changer supports "fast" searches, then the algorithm uses the changer to search for that volume\&. Newly labeled volumes are not considered when calculating the oldest reusable volume\&. Consequently, this taperscan algorithm prefers volumes which have been used before to newly\-labeled volumes when a fast\-searchable changer is in use\&. .PP Second, if there is no oldest reusable volume, or if that volume is not available in the changer, then the algorithm begins a sequential scan of the changer, starting at the current slot\&. It selects the first suitable volume it finds: a reusable volume (perhaps newly\-labeled) or, if \fIlabel_new_tapes\fR is true, a blank volume\&. Even across multiple invocations (when \fIruntapes > 1\fR), it will not return the same slot twice\&. .if n \{\ .sp .\} .RS 4 .it 1 an-trap .nr an-no-space-flag 1 .nr an-break-flag 1 .br .ps +1 \fBNote\fR .ps -1 .br This algorithm shows an undue preference for volumes already containing data, by omitting newly\-labeled volumes from its first stage\&. Historically, many Amanda changer scripts were not fast\-searchable (including \fIchg\-multi\fR, \fIchg\-disk\fR and, if \fIhavereader=0\fR, \fIchg\-zd\-mtx\fR), and thus skipped the first stage, allowing new volumes to find their way into the tape cycle\&. New changers are almost all fast\-searchable, so both stages of the algorithm are used and new tapes may be unexpectedly excluded\&. If this causes an undesirable change in behavior, consider one of the other taperscan algorithms\&..sp .5v .RE .SH "SEE ALSO" .PP \fBamanda\fR(8), \fBamanda.conf\fR(5), \fBtapelist\fR(5), \fBamanda-changers\fR(7) .PP The Amanda Wiki: : http://wiki.zmanda.com/ .SH "AUTHOR" .PP \fBDustin J\&. Mitchell\fR <\&dustin@zmanda\&.com\&> .RS 4 Zmanda, Inc\&. (http://www\&.zmanda\&.com) .RE