Intelliflash by DDN Assigned Two Patents

Predictable client latency via background file system operations
Intelliflash by DDN, Inc., Santa Clara, CA has been assigned a patent (10,592,124) developed by Tripathi, Shailendra, Fremont, CA, and Tan, Enyew, Newark, CA, for a “predictable client latency via background file system operations.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method, system and computer program product for managing an amount of storage written from a transaction group comprises creating a plurality of transaction classes within each of a plurality of write transaction classes and discovering an initial underlying drive capability assignable to the transaction classes when a storage pool is allocated, (SPA). Each transaction class capability weight is adjusted via computing an instruction and operations per second, a data rate per second and a time slice at every storage pool allocator sync time. An unspent time slice from an adjusted transaction class is lent to a plurality of remaining transaction classes yet to be adjusted via a staged processing distribution during sync of the SPA. The disclosed method further includes assigning system resources and underlying drive capability to each transaction class per its capability weight based on a ratio of weights for each transaction class of operations.”

The patent application was filed on September 6, 2017 (15/697,152).

Predictable allocation latency in fragmented log structured file system
Intelliflash by DDN, Inc., Santa Clara, CA has been assigned a patent (10,572,464) developed by Tripathi, Shailendra, Fremont, CA, for a “predictable allocation latency in fragmented log structured file system.“

The abstract of the patent published by the U.S. Patent and Trademark Office states: ”A method, system and computer program product for managing a file system includes a plurality of allocation areas of loaded allocation trees to serve a request per file system drive for a transaction group. The system also includes a module configured to move a loaded allocation tree to an unloading tree in the event the loaded allocation tree will not satisfy the request. The system additionally includes a module configured to select and place in a loading tree queue a most eligible unloaded tree based on a weight of each unloaded tree. The system further includes a module to asynchronously process the loading tree queue and an unloading tree queue threads parallel to a storage pool allocator sync process. Allocation areas are attached in a circular ring of loaded allocation trees. Space map trees are converted into fixed size areas for constant latency loading logs and creating index trees.”

The patent application was filed on September 7, 2017 (15/697,621).