Vast Data Assigned Two Patents
Techniques for scalable storage without communication on synchronous path, techniques for prolonging lifespan of storage drives
By Francis Pelletier | September 16, 2022 at 2:00 pmTechniques for scalable storage without communication on synchronous path
Vast Data Ltd., Tel Aviv, Israel, has been assigned a patent (11,397,533) developed by Hallak, Renen, Tenafly, NJ, Levy, Asaf, Goren, Avi, Tel Aviv, Israel, and Turin, Alex, Kiryat Ono, Israel, for “techniques for scalable storage without communication on the synchronous path.“
The abstract of the patent published by the U.S. Patent and Trademark Office states: “A system and method for scalable storage. The method includes placing a lock on a portion of a storage node, wherein placing the lock further comprises replacing a first value stored in the storage node with a second value using an atomic operation, wherein the atomic operation replaces the first value with the second value when the first value indicates an empty lock status, wherein the second value indicates an active lock status, allocating a storage location in the storage node by updating metadata stored in the locked portion of the storage node when the lock has been placed, and releasing the lock, wherein releasing the lock further comprises replacing the second value with a third value, wherein the third value indicates the empty lock status.”
The patent application was filed on May 5, 2020 (16/867,176).
Techniques for prolonging lifespan of storage drives
Vast Data Ltd., Tel Aviv, Israel, has been assigned a patent (11,397,530) developed by Hallak, Renen, Tenafly, NJ, Zdornov, Vladimir, Kfar Saba, Israel, Vaknin, Yogev, Karkur, Israel, Levy, Asaf, Tel Aviv, Israel, and Turin, Alex, Kiryat Ono, Israel, for “techniques for prolonging lifespan of storage drives.“
The abstract of the patent published by the U.S. Patent and Trademark Office states: “A system and method for prolonging lifespans of storage drives. The method includes determining an expected expiration time for each of a plurality of blocks, wherein each block includes data of a respective file, wherein the expected expiration of each block is determined based on a file type of the respective file, and writing a portion of data to at least one block of the plurality of blocks based on the expected expiration time for each block.”
The patent application was filed on November 3, 2020 (17/088,204).