Patents by Inventor Matti A. Vanninen

Matti A. Vanninen has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20120131286
    Abstract: Detection and reduction of unaligned input/output (“I/O”) requests is implemented by a storage server determining an alignment value for data stored by the server within a storage system on behalf of a first client, writing the alignment value to a portion of the volume that stores the data for the first client, but not to a portion of the volume that stores data for a second client, and changing a location of data within the portion of the volume that stores the data for the first client, but not a location of data in the portion of the volume that stores data for the second client, to an alignment corresponding to the alignment value. The alignment value is applied to I/O requests directed to the portion of the volume that stores the data blocks for the first client after the location of the data blocks has been changed.
    Type: Application
    Filed: November 19, 2010
    Publication date: May 24, 2012
    Inventors: Rickard E. Faith, Matthew D. Hambrick, Matti A. Vanninen
  • Patent number: 8156290
    Abstract: Just-in-time segment cleaning obtains the location of blocks of a storage system predicted to be targeted by a future write operation and cleans the blocks targeted for the future write operation prior to the occurrence of the future write operation. In one aspect, just-in-time segment cleaning is performed in proportion to previous user-initiated write operations. In another aspect, just-in-time segment cleaning applies a cost analysis determination to minimize the work of cleaning.
    Type: Grant
    Filed: April 23, 2009
    Date of Patent: April 10, 2012
    Assignee: Network Appliance, Inc.
    Inventors: Matti Vanninen, Rickard E. Faith
  • Patent number: 8117396
    Abstract: Methods and apparatuses provide a multi-level buffer cache having queues corresponding to different priority levels of queuing within the buffer cache. One or more data blocks are buffered in the buffer cache. In one embodiment, an initial level of queue is identified for a data block to be buffered in the buffer cache. The initial level of queue can be modified higher or lower depending on a value of a cache property associated with the data block. In one embodiment, the data block is monitored for data access in a queue, and the data block is aged and moved to higher level(s) of queuing based on rules for the data block. The rules can apply to the queue in which the data block is buffered, to a data type of the data block, or to a logical partition to which the data block belongs.
    Type: Grant
    Filed: October 10, 2006
    Date of Patent: February 14, 2012
    Assignee: Network Appliance, Inc.
    Inventors: Robert L. Fair, Matti A. Vanninen