Patents by Inventor Matthew J. Kalos

Matthew J. Kalos 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).

  • USING AN ACCESS INCREMENT NUMBER TO CONTROL A DURATION DURING WHICH TRACKS REMAIN IN CACHE
    Publication number: 20180300257
    Abstract: Provided are a computer program product, system, and method for using an access increment number to control a duration during which tracks remain in cache. Tracks in a storage in the cache are indicated in a cache list. For each of the tracks indicated in the cache list, an access value is updated when one of the tracks is accessed in the cache. An access to a track in the cache indicated in the cache list is received. A determination is made as to whether an access increment number for the accessed track, wherein the access increment number is greater than one. The access value for the accessed track is incremented by the determined access increment number in response to the track being accessed in the cache. The access value for one of the tracks is used to determine whether to initiate to demote the track from the cache.
    Type: Application
    Filed: June 22, 2018
    Publication date: October 18, 2018
    Inventors: Kevin J. Ash, Matthew G. Borlick, Lokesh M. Gupta, Matthew J. Kalos
  • PROCESSING A CHAIN OF A PLURALITY OF WRITE REQUESTS
    Publication number: 20180293027
    Abstract: Provided are a computer program product, system, and method for processing a chain of a plurality of write requests including a commit wait flag and plurality of write requests, wherein each write request group includes write transactions directed to the storage. A determination is made as to whether the commit wait flag has a first value or a second value. The write requests are processed by requiring a current write request comprising one of the write requests being processed to complete before beginning to write data for a next write request following the current write request in the write request chain in response to the commit wait flag having the first value. The write requests are processed by processing the next write request before completing the current write request in response to the commit wait flag having the second value.
    Type: Application
    Filed: June 11, 2018
    Publication date: October 11, 2018
    Inventors: Jeffrey A. Berger, Susan K. Candelaria, Matthew J. Kalos, Beth A. Peterson, Harry M. Yudenfriend
  • GENERATING A CHAIN OF A PLURALITY OF WRITE REQUESTS
    Publication number: 20180260279
    Abstract: Provided are a computer program product, system, and method for generating a chain of a plurality of write requests including a commit wait flag and plurality of write requests. The commit wait flag is set to one of an indicated first value or a second value. The commit wait flag is set to the first value to cause a storage server to process the write requests by requiring a current write request being processed to complete before transferring data for a next write request following the current write request. The commit wait flag is set to the second value to cause the storage server to process the write requests by transferring data for the next write request before completing the current write request preceding the next write request. The write request chain is sent to the storage server to apply the write requests to the storage.
    Type: Application
    Filed: May 8, 2018
    Publication date: September 13, 2018
    Inventors: Jeffrey A. Berger, Susan K. Candelaria, Matthew J. Kalos, Beth A. Peterson, Harry M. Yudenfriend
  • PROCESSING OF A SET OF PENDING OPERATIONS FOR A SWITCHOVER FROM A FIRST STORAGE RESOURCE TO A SECOND STORAGE RESOURCE
    Publication number: 20180253237
    Abstract: A determination is made that data stored in an extent of a first storage resource is to be moved to an extent of a second storage resource. Operations that are still awaiting to start execution in the first storage resource after the data stored in the extent of the first storage resource has been moved to the extent of the second storage resource, are configured for execution in the second storage resource.
    Type: Application
    Filed: March 2, 2017
    Publication date: September 6, 2018
    Inventors: Matthew G. Borlick, Clint A. Hardy, Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach, Hui Zhang
  • Using an access increment number to control a duration during which tracks remain in cache
    Patent number: 10067883
    Abstract: Provided are a computer program product, system, and method for using an access increment number to control a duration during which tracks remain in cache. Tracks in a storage in the cache are indicated in a cache list. For each of the tracks indicated in the cache list, an access value is updated when one of the tracks is accessed in the cache. An access to a track in the cache indicated in the cache list is received. A determination is made as to whether an access increment number for the accessed track, wherein the access increment number is greater than one. The access value for the accessed track is incremented by the determined access increment number in response to the track being accessed in the cache. The access value for one of the tracks is used to determine whether to initiate to demote the track from the cache.
    Type: Grant
    Filed: May 31, 2016
    Date of Patent: September 4, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kevin J. Ash, Matthew G. Borlick, Lokesh M. Gupta, Matthew J. Kalos
  • Distributing a plurality of tracks to add to cache to lists assigned to processors
    Patent number: 10067884
    Abstract: Provided are a computer program product, system, and method for distributing a plurality of tracks to add to cache to lists assigned to processors. Tracks stored in the cache are indicated in lists, wherein there is one list for each of a plurality of processors. Each of the processors processes the list for that processor to process the tracks in the cache indicated on the list. A determination is made as to whether the lists for the processors are unbalanced in their indicated numbers of tracks. For each of the lists, a determination is made of a number of received tracks to assign to the lists in response to determining that the lists are unbalanced. For each of the lists assigned at least one of the received tracks, indication is made of the determined number of the received tracks in the list.
    Type: Grant
    Filed: August 21, 2015
    Date of Patent: September 4, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kevin J. Ash, Matthew G. Borlick, Lokesh M. Gupta, Matthew J. Kalos
  • Synchronous input/output replication of data in a persistent storage control unit
    Patent number: 10068000
    Abstract: Aspects include synchronous input/output (I/O) replication of data. A synchronous I/O request is received from an operating system (OS) by firmware on a server. A plurality of synchronous I/O mailbox commands is transmitted by the firmware to a plurality of persistent storage control unit (SCU) nodes. The content of each of the plurality of synchronous I/O commands is based on the synchronous I/O request. A unit of work in the OS corresponding to the synchronous I/O request remains active at least until the synchronous I/O request is completed. It is determined, by the firmware, that determining that each of the plurality of persistent SCU nodes have completed their respective synchronous I/O commands. Based on the determining, the firmware indicates to the OS that the synchronous I/O request is completed.
    Type: Grant
    Filed: October 1, 2015
    Date of Patent: September 4, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David F. Craddock, Beth A. Glendening, Matthew J. Kalos, Peter G. Sutton, Harry M. Yudenfriend
  • Processing a chain of a plurality of write requests
    Patent number: 10067717
    Abstract: Provided are a computer program product, system, and method for processing a chain of a plurality of write requests including a commit wait flag and plurality of write requests, wherein each write request group includes write transactions directed to the storage. A determination is made as to whether the commit wait flag has a first value or a second value. The write requests are processed by requiring a current write request comprising one of the write requests being processed to complete before beginning to write data for a next write request following the current write request in the write request chain in response to the commit wait flag having the first value. The write requests are processed by processing the next write request before completing the current write request in response to the commit wait flag having the second value.
    Type: Grant
    Filed: May 10, 2016
    Date of Patent: September 4, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jeffrey A. Berger, Susan K. Candelaria, Matthew J. Kalos, Beth A. Peterson, Harry M. Yudenfriend
  • Recovery mechanisms across storage nodes that reduce the impact on host input and output operations
    Patent number: 10067818
    Abstract: Provided are a method, a system, and a computer program product in which a storage controller determines one or more resources that are impacted by an error. A cleanup of tasks associated with the one or more resources that are impacted by the error is performed, to recover from the error, wherein host input/output (I/O) operations continue to be processed, and wherein tasks associated with other resources continue to execute.
    Type: Grant
    Filed: July 29, 2016
    Date of Patent: September 4, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Wang Ping He, Larry Juarez, Matthew J. Kalos, John N. McCauley, Louis A. Rasor, Brian A. Rinaldi, Todd C. Sorenson
  • Synchronous input/output replication of data in a persistent storage control unit
    Patent number: 10068001
    Abstract: Aspects include synchronous input/output (I/O) replication of data. A synchronous I/O request is received from an operating system (OS) by firmware on a server. A plurality of synchronous I/O mailbox commands is transmitted by the firmware to a plurality of persistent storage control unit (SCU) nodes. The content of each of the plurality of synchronous I/O commands is based on the synchronous I/O request. A unit of work in the OS corresponding to the synchronous I/O request remains active at least until the synchronous I/O request is completed. It is determined, by the firmware, that determining that each of the plurality of persistent SCU nodes have completed their respective synchronous I/O commands. Based on the determining, the firmware indicates to the OS that the synchronous I/O request is completed.
    Type: Grant
    Filed: June 14, 2016
    Date of Patent: September 4, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: David F. Craddock, Beth A. Glendening, Matthew J. Kalos, Peter G. Sutton, Harry M. Yudenfriend
  • Adjustment of buffer credits and other parameters in a startup phase of communications between a plurality of channels and a control unit
    Patent number: 10061734
    Abstract: A control unit provides a number of buffer credits, to one or more channels, in response to an initiation of a startup phase of communication between the one or more channels and the control unit, where the provided number of buffer credits when used for transferring data causes transfer ready operations but no retry operations. The control unit iteratively increases the number of buffer credits by an amount that is high enough to eliminate any transfer ready operations or cause retry operations to occur within a predetermined amount of time from the initiation of the startup phase.
    Type: Grant
    Filed: May 20, 2015
    Date of Patent: August 28, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Roger G. Hathorn, Bret W. Holley, Matthew J. Kalos
  • SELECTIVE SPACE RECLAMATION OF DATA STORAGE MEMORY EMPLOYING HEAT AND RELOCATION METRICS
    Publication number: 20180232318
    Abstract: Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation.
    Type: Application
    Filed: April 12, 2018
    Publication date: August 16, 2018
    Inventors: Michael T. Benhase, Evangelos S. Eleftheriou, Lokesh M. Gupta, Robert Haas, Xiao Y. Hu, Matthew J. Kalos, Ioannis Koltsidas, Roman A. Pletka
  • Selective space reclamation of data storage memory employing heat and relocation metrics
    Patent number: 10042779
    Abstract: Space of a data storage memory of a data storage memory system is reclaimed by determining heat metrics of data stored in the data storage memory; determining relocation metrics related to relocation of the data within the data storage memory; determining utility metrics of the data relating the heat metrics to the relocation metrics for the data; and making the data whose utility metric fails a utility metric threshold, available for space reclamation.
    Type: Grant
    Filed: August 31, 2017
    Date of Patent: August 7, 2018
    Assignee: International Business Machines Corporation
    Inventors: Michael T. Benhase, Evangelos S. Eleftheriou, Lokesh M. Gupta, Robert Haas, Xiao Y. Hu, Matthew J. Kalos, Ioannis Koltsidas, Roman A. Pletka
  • PRESERVATION OF MODIFIED CACHE DATA IN LOCAL NON-VOLATILE STORAGE FOLLOWING A FAILOVER
    Publication number: 20180210835
    Abstract: A dual-server based storage system maintains a first cache and a first non-volatile storage (NVS) in a first server, and a second cache and a second NVS in a second server, where data in the first cache is also written in the second NVS and data in the second cache is also written in the first NVS. In response to a failure of the first server, a determination is made as to whether space exists in the second NVS to accommodate the data stored in the second cache. In response to determining that space exists in the second NVS to accommodate the data stored in the second cache, the data is transferred from the second cache to the second NVS.
    Type: Application
    Filed: March 20, 2018
    Publication date: July 26, 2018
    Inventors: Kyler A. Anderson, Kevin J. Ash, Lokesh M. Gupta, Matthew J. Kalos
  • Generating a chain of a plurality of write requests
    Patent number: 10031810
    Abstract: Provided are a computer program product, system, and method for generating a chain of a plurality of write requests including a commit wait flag and plurality of write requests. The commit wait flag is set to one of an indicated first value or a second value. The commit wait flag is set to the first value to cause a storage server to process the write requests by requiring a current write request being processed to complete before transferring data for a next write request following the current write request. The commit wait flag is set to the second value to cause the storage server to process the write requests by transferring data for the next write request before completing the current write request preceding the next write request. The write request chain is sent to the storage server to apply the write requests to the storage.
    Type: Grant
    Filed: May 10, 2016
    Date of Patent: July 24, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Jeffrey A. Berger, Susan K. Candelaria, Matthew J. Kalos, Beth A. Peterson, Harry M. Yudenfriend
  • ADJUSTMENT OF BUFFER CREDITS AND OTHER PARAMETERS IN A STARTUP PHASE OF COMMUNICATIONS BETWEEN A PLURALITY OF CHANNELS AND A CONTROL UNIT
    Publication number: 20180181523
    Abstract: A control unit provides a number of buffer credits, to one or more channels, in response to an initiation of a startup phase of communication between the one or more channels and the control unit, where the provided number of buffer credits when used for transferring data causes transfer ready operations but no retry operations. The control unit iteratively increases the number of buffer credits by an amount that is high enough to eliminate any transfer ready operations or cause retry operations to occur within a predetermined amount of time from the initiation of the startup phase.
    Type: Application
    Filed: February 22, 2018
    Publication date: June 28, 2018
    Inventors: Roger G. Hathorn, Bret W. Holley, Matthew J. Kalos
  • Management of cache lists via dynamic sizing of the cache lists
    Patent number: 9996476
    Abstract: A process for caching data according to one embodiment includes maintaining a random data list and a sequential data list, and dynamically establishing a desired size of the sequential data list. Dynamically establishing the desired size of the sequential data list includes increasing the desired size of the sequential data list in response to at least one of: detecting a hit on a bottom of the sequential data list, and detecting a read miss on sequential tracks. Dynamically establishing the desired size of the sequential data list also includes decreasing the desired size of the sequential data list in response to detecting a hit on a bottom of the random data list.
    Type: Grant
    Filed: September 3, 2015
    Date of Patent: June 12, 2018
    Assignee: International Business Machines Corporation
    Inventors: Kevin J. Ash, Lokesh M. Gupta, Matthew J. Kalos, Rose L. Manz
  • USING CACHE LISTS FOR PROCESSORS TO DETERMINE TRACKS TO DEMOTE FROM A CACHE
    Publication number: 20180157594
    Abstract: Provided are a computer program product, system, and method for using cache lists for processors to determine tracks in a storage to demote from a cache. Tracks in the storage stored in the cache are indicated in lists. There is one list for each of a plurality of processors. Each of the processors processes the list for that processor to process the tracks in the cache indicated on the list. There is a timestamp for each of the tracks indicated in the lists indicating a time at which the track was added to the cache.
    Type: Application
    Filed: January 30, 2018
    Publication date: June 7, 2018
    Inventors: Kevin J. Ash, Matthew G. Borlick, Lokesh M. Gupta, Matthew J. Kalos
  • USING CACHE LISTS FOR PROCESSORS TO DETERMINE TRACKS TO DEMOTE FROM A CACHE
    Publication number: 20180150402
    Abstract: Provided are a computer program product, system, and method for using cache lists for processors to determine tracks in a storage to demote from a cache. Tracks in the storage stored in the cache are indicated in lists. There is one list for each of a plurality of processors. Each of the processors processes the list for that processor to process the tracks in the cache indicated on the list. There is a timestamp for each of the tracks indicated in the lists indicating a time at which the track was added to the cache.
    Type: Application
    Filed: January 30, 2018
    Publication date: May 31, 2018
    Inventors: Kevin J. Ash, Matthew G. Borlick, Lokesh M. Gupta, Matthew J. Kalos
  • Systems and computer program products for transferring reserves when moving virtual machines across systems
    Patent number: 9984097
    Abstract: According to one embodiment, a host system includes logic adapted for receiving device information from a source system, logic adapted for building a virtual device based at least in part on the received device information, logic adapted for transferring a reserve of a storage device to the host system and/or receiving results of transferring the reserve to the host system, logic adapted for determining if the reserve is held by the host system, logic adapted for recording the reserve if the reserve is held by the host system, and logic adapted for sending a notification that the reserve is not held by the host system if the reserve is not held by the host system. Other systems and computer program products are also described according to various embodiments.
    Type: Grant
    Filed: November 10, 2010
    Date of Patent: May 29, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Susan K. Candelaria, Mark P. Gardiner, Clint A. Hardy, Matthew J. Kalos, William R. White, Stephen G. Wilkins, Harry M. Yudenfriend