Skip to main content

Cartridge created by IBM stores 330 TB uncompressed data - World Record

Storing data have been the main priority every time. So, to fulfil the same companies have been developing the storage devices which are more efficient.


Grabbing the facts from History we will see how the storage devices evolved with the passing time. First the storage devices were equivalent to the size of big locomotive engine. The same have the storage capacity of 124 MB. Now we see the storage devices of capacity of 124 GB (pen drives) which now fit in our pockets. For more storage space we have got Hard Drives which have capacity of more than 2 TB.

Although, all the fact put aside we also see magnetic tapes used for storing. In recent years we have seen them disappearing but still are used in some areas especially in storage centers. The price and storage capacity are the reason behind the same.

Keeping in mind the trend of evolution IBM took an initiative. The evolution of technology is considered as the main priority at IBM. They have reduced the physical sate while at the same time have improved the storage density in an incredible way. Grabbing the new world record for capturing 330 TB of uncompressed data in a cartridge. The interesting fact is the size of cartridge is as same as palm of the hand. In case if you are not able to imagine the feat just consider 330 million books compressed into a single kinder garden poetry book.

Usually the magnetic tapes are capable of storing 210 GB and here we are talking about 330 TB. This simplifies that the density of this technology is 20 times to that of magnetic tapes. We can simply say that the area of recording density is the amount of information that can be stored on a given surface.
IBM and Sony have collaborated for many years as to capture information on magnetic tapes. “The result of this collaboration has led to several improvements  in media technology, such as the roll-to-roll process for the manufacture of magnetic tapes and better lubrication technology, which stabilizes the functionality of the tapes”, commented Evangelos Eleftheriou of IBM.

The cartridge developed would serve for long term storage, something that might draw attention of many companies. In a world where information is gold, it becomes more necessary to find secure place for storing the data. Whether its business purpose or some official use this technology will serve them all.

Comments

Post a Comment

Popular posts from this blog

1235. Maximum Profit in Job Scheduling

Hi everyone, Today's post is little bit intriguing to me as it took me some time to get t the solution. I have been out of practice for a bit so I was not able to do it in the DP. I didn't want to copy the code. Though i understood the code after i checked its solution in the discussions. Anyways, i tried to do it with heap and with some thinking I was able to do it and with my surprise It performed real well. I would like to jump to the solution but first I would like to explain a little bit about heaps so you can get better understanding of the code. A heap is like a special type of list where the smallest (or largest) item is always at the front. Think of it like a priority line at a theme park, where the person with the highest priority goes to the front. There are two types of heaps: Min Heap: The smallest item is at the front. It's like standing in a line where the shortest person is always at the front. Max Heap: The largest item is at the front. It's like stand
2 comments
Read more

1456, Maximum Number of Vowels in a Substring of Given Length

Hi, folks today I am here with an interesting coding problem from Leetcode. *To directly go to the question please click here. So I will walk through the solution. It will be a brute force and an optimized way solution. I will be explaining the optimized way solutions in depth. # Intuition For any substring of length k, we need to find how many vowels are there in it and provide the highest count of all counts of vowels in a substring. Test Case 1 Input k = 2 and s='asjdee' Output - 2 Explanation: As for substring of length k=2, in the string 's' we have 'ee' when the length is k and the vowels count is 2 Test Case 2 Input k=3 and s='aasdiisdwe' Output - 2 Explanation - For all the substrings with length k = 3 we have 'aas' and 'dii' with 2 vowels each in it. Brute Force - Looping (twice) - Gives TLE (Not recommended) # Approach Create a hashmap (dictionary) with all the vowels in it. Loop through the string till len(s)-k element of strin
Post a Comment
Read more

1287. Element Appearing More Than 25% In Sorted Array

Hi, Today i bring you new Leetcode problem. Its an easy one :) The problem is - Element Appearing More Than 25% In Sorted Array As qs. explains itself we need to find a number that appears 25% times or more than the length of he array. So for example if array has length of 8 then the resultant number should appear 2 or more times. The constraints given are - 1 <= arr.length <= 100, 0 <= arr[i] <= 10 5 So, lets look at the cases which we may encounter. 1. if length is 1. then the number itself is the result. 2. if length is divisibe by 4 3. if length is not divisible by 4. Let's look at the code now...  class Solution : def findSpecialInteger ( self , arr : List[ int ]) -> int : n = len (arr) start = 0 end = n hm = defaultdict() for i in arr: hm[i] = hm.get(i, 0 )+ 1 for i in hm: if hm[i]>n// 4 : return i Now we will go through the code. Step 1: Initializatio
Post a Comment
Read more