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

How to bypass Android pattern lock using CMD.

Many of you have encountered the situation where you forget your phone's pattern lock. This is totally common and we can't deny this. Then after trying all the combinations in mind and losing hope we just choose to reset our phone. But here I am providing you with the solution to this problem. You can just open up your phone following these few steps and without undergoing any trouble of losing your data and wasting your time.  Yes, I am talking about bypassing the pattern lock you used to unlock your phone. This procedure will be done using CMD. CMD, also known as command prompt is an amazing tool provided in Windows OP. You can control your entire computer using CMD which includes copying files from one folder to another, hiding your files, checking details of connected wireless devices and even shutting down your PC. You just need to learn some easy commands. How to bypass Pattern lock on your Android Phone? Before trying to Bypass the pattern lock...
Post a Comment
Read more

1721 - Swapping Nodes in a Linked List.

Hi, Today we will be solving leetcode qs 1721 - Swapping Nodes in a Linked List. This qs is really simple. We need to swap the nodes placed at k distance from the start and end of the Linked List. So let's suppose you have a Linked List input as follows: 1 -> 2-> 4 -> 5 -> 7 -> 8 -> 10-> 9  and you are given a k = 2, so the output should be 1 -> 10 -> 4 -> 5 -> 7 -> 8 -> 2 -> 9 so how do we achieve it??? Intuition The most brute force solution one can think of is using Array data structure. For that, we will traverse through linked List and store all the elements in the Array, swap the two numbers and again insert it in theLinked List again. Not bad, but let's deal with it, it is not the optimal solution and far from being as an acceptable solution in interviews. So what can we done instead of that??? Let's try to look deep into the working of Linked List first and how do we traverse it. Linked List is a linear data structure that...
Post a Comment
Read more

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