Qumulo Assigned Two Patents

Data mobility, accessibility, and consistency in storage
Qumulo, Inc., Seattle, WA, has been assigned a patent (10,860,547) developed by Passey, Aaron, Fachan, Neal, and Godman, Peter, Seattle, WA, for “data mobility, accessibility, and consistency in a data storage system.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A transactional block storage system is provided which is capable of supporting a single-phase commit for data writes specifying a protected storage unit. The storage system includes a data storage map that logically links the protected data storage unit to two or more block storage units associated with a layer of the protected data storage unit. The storage system also includes an address abstraction layer which translates write requests to the block storage units and resolves whether those write requests are atomically committed to the storage system in a single phase transaction. The address abstraction layer is further configured to detected when a block storage unit becomes unavailable during a transaction and create a cleaning kit for that block in order to prevent data loss. Additionally, the address abstraction layer facilitates moving, copying, and merging of block storage units without global locking in the storage system.”

The patent application was filed on October 4, 2018 (16/152,259).

Managing throughput fairness and quality of service in file systems
Qumulo, Inc., Seattle, WA, has been assigned a patent (10,860,372) developed by Bai, Yuxi, Rothschilds, Thomas Gregory, MacLaren, Jonathan Michael, Nelson, Noah Trent, and Fairhurst, Kimberly Alice, Seattle, WA, for “managing throughput fairness and quality of service in file systems.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”Embodiments are directed to managing file systems over a network. Jobs may be provided to a storage computer in a file system. Control models may be associated with the jobs. Scores may be generated based on the control models. Each job may be associated with a score provided by its associated control model. And, each job that may be behind its corresponding schedule may be associated with a higher score value than each other job that may be either on its corresponding other schedule or ahead of its corresponding other schedule. Commands may be selected for execution based on the commands being associated with a job that may be associated with the higher score value that may be greater than score values associated with other jobs. The jobs may be ranked based on the updated scores. Subsequent commands may be selected and executed based on the ranking of the jobs.”

The patent application was filed on January 24, 2020 (16/752,509).