Heuristic Algorithm Example Post: 302615729

8 More Discussions You Might Find Interesting

1. Programming

Feedback algorithm

Hi I search an exemple of scheduling Feedback algorithm, or help about how to create one. Thanks

2. Shell Programming and Scripting

PID USERNAME SIZE RSS STATE PRI NICE TIME CPU PROCESS/NLWP 21444 tomusr 213M 61M sleep 29 10 1:20:46 0.1% java/43 21249 root 93M 44M sleep 29 10 1:07:19 0.2% java/56 is there anyway i can use a command to get the total of the SIZE? 306M (Derive from...

3. Programming

Please help me to develop algorithm

Hi guys , in my study book from which I re-learn C is task to generate all possible characters combination from numbers entered by the user. I know this algorithm must use combinatorics to calculate all permutations. Problem is how to implement algortihm. // This program reads the four numbers...

4. Programming

Looking for Your Help on dijkstra algorithm

Can you help to adjust the void dijkstra(int s) function to find a path from source to every node so that the minimum cost on that path is maximum. Ex: From 1 to 2 we have 1 - 3 - 4 - 2 , costs(2+3+4+5) From 1 to 2 we have 1 - 5 - 6 - 2 , costs(3+3+4+5) I need the algorithm to choose path 1...

5. Homework & Coursework Questions

Heuristic Algorithm Example Analysis

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: It's a three step algorithm and it works fine. But I am trying to prove that it is not always true. See my...

6. UNIX for Dummies Questions & Answers

banker's algorithm.. help

i'm doing banker's algorithm.. got some error there but i cant fix it.. please help!! #!/bin/bash echo "enter no.of resources: " read n1 echo -n "enter the max no .of resources for each type: " for(( i=0; i <$n1; i++ )) do read ${t} done echo -n "enter no .of...

7. Homework & Coursework Questions

Banker's algorithm

Use and complete the template provided. The entire template must be completed. If you don't, your post may be deleted! 1. The problem statement, all variables and given/known data: shell scripts to simulate Banker’s algorithm on a collection of processes (process details are entered as inputs...

8. Shell Programming and Scripting

Masking algorithm

I have a requirement of masking few specific fields in the UNIX file. The details are as following- File is fixed length file with each record of 250 charater length. 2 fields needs to be masked – the positions are 21:30 and 110:120 The character by character making needs to be done which...

LEARN ABOUT REDHAT

amtape

AMTAPE(8)						      System Manager's Manual							 AMTAPE(8)

NAME

       amtape - user interface to Amanda tape changer controls

SYNOPSIS

       amtape config command [ command options ]

DESCRIPTION

       Amtape performs tape changer control operations.  It uses the underlying tape changer script defined by the tpchanger option for a particu-
       lar Amanda configuration as specified by the config argument.

       Tape changers maintain a notion of the current and next slot for each configuration.  These may or may not correspond to an actual physical
       state  of  the device, but do tend to minimize searching through the tape storage slots.  If the desired tape is in the current slot, it is
       likely the next tape needed is in the next slot rather than at some random position in the storage slots.

       See the amanda(8) man page for more details about Amanda.

COMMANDS

       reset  Reset the tape changer to a known state.	The current slot is set to the first slot.  Other device-specific side effects may  occur.
	      Some  gravity stackers need to be reset to the top position by hand.  This command notifies Amanda the stacker is back in that posi-
	      tion.

       eject  If a tape is loaded in the drive, it is ejected and returned to the slot from which it was loaded.

       clean  If a cleaning tape is defined for the changer, it is used to clean the drive.

       show   Show the contents of all slots.  This can be slow.

       label label
	      Search for and load the Amanda tape with label label.

       taper  Perform the taper scan algorithm.  Load the next tape in the configuration's tape sequence, or a fresh tape with a suitable label.

       device Display the name of the current tape device on stdout.

       current
	      Display the current slot.

       update Update the changer label database, if it has one, to match the tapes now available.

       slot slot
	      Eject any tape in the drive and put it away, then load the tape from slot slot and reset current.

       slot current
	      Eject any tape in the drive and put it away, then load the tape from the current slot.

       slot prev
	      Eject any tape in the drive and put it away, then load the tape from the previous slot and reset current.

       slot next
	      Eject any tape in the drive and put it away, then load the tape from the next slot and reset current.

       slot first
	      Eject any tape in the drive and put it away, then load the tape from the first slot and reset current.

       slot last
	      Eject any tape in the drive and put it away, then load the tape from the last slot and reset current.

       slot advance
	      Eject any tape in the drive and put it away.  Advance current to the next tape, but do not load it.

	      This is useful with non-gravity stackers to unload the last tape used and set up Amanda for the next run.  If you  just  use  eject,
	      the  current  tape will be mounted again in the next run, where it will be rejected as being still in use, ejected and the next tape
	      requested.  Using slot next followed by eject does an unnecessary mount.

       Note: most changers optimize the slot commands to not eject the loaded tape if it is the one being requested.

AUTHOR

       James da Silva <jds@cs.umd.edu>
       University of Maryland, College Park

SEE ALSO

       amanda(8)

																	 AMTAPE(8)