Optimal Storage On Tapes || Greedy Method || Design and Analysis of Algorithms || DAA

Sudhakar Atchala
Sudhakar Atchala
38.7 هزار بار بازدید - 3 سال پیش - #sudhakaratchala
#sudhakaratchala #daavideos #daaplaylist
Let us first break down the problem and understand what needs to be done.
A magnetic tape provides only sequential access of data. In an audio tape/cassette, unlike a CD, a fifth song from the tape can’t be just directly played. The length of the first four songs must be traversed to play the fifth song. So in order to access certain data, head of the tape should be positioned accordingly.
Now suppose there are 4 songs in a tape of audio lengths 5, 7, 3 and 2 mins respectively. In order to play the fourth song, we need to traverse an audio length of 5 + 7 + 3 = 15 mins and then position the tape head.
Retrieval time of the data is the time taken to retrieve/access that data in its entirety. Hence retrieval time of the fourth song is 15 + 2 = 17 mins.
Now, considering that all programs in a magnetic tape are retrieved equally often and the tape head points to the front of the tape every time, a new term can be defined called the Mean Retrieval Time (MRT).
3 سال پیش در تاریخ 1400/05/03 منتشر شده است.
38,742 بـار بازدید شده
... بیشتر