Patents by Inventor Steven M. Partlow
Steven M. Partlow 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).
-
Patent number: 9594509Abstract: Address-based thresholds for freemained frames are used to determine retention actions. Based, at least in part, on a comparison of a number of freemained frames for an address space against a threshold of freemained frames for the address space, freemained frames can be retained or rejected and/or the threshold can be adjusted.Type: GrantFiled: July 20, 2016Date of Patent: March 14, 2017Assignee: International Business Machines CorporationInventor: Steven M. Partlow
-
Patent number: 9588802Abstract: In one embodiment, a computer-implemented method includes producing one or more clean frames by clearing a batch of one or more frames for use in backing virtual memory pages. The producing the one or more clean frames may be performed asynchronously from a unit of work being performed by a processor. The one or more clean frames may be added to a clean frame queue, where the clean frame queue includes a plurality of clean frames that have been cleared. A first request may be received, from the processor, for a frame for use in backing a virtual memory page of the unit of work. A clean frame, of the one or more clean frames, may be removed from the clean frame queue, responsive to the first request. The clean frame may be delivered to the processor, responsive to the first request.Type: GrantFiled: April 22, 2016Date of Patent: March 7, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert Miller, Jr., Steven M. Partlow, Thomas F. Rankin, Scott B. Tuttle, Elpida Tzortzatos
-
Patent number: 9542301Abstract: More robust testing of computer module responses to processing errors using a flexible, lightweight solution that does not alter the computer module. Through modification of processing pointers, a wide variety of processing errors and delays are injected into a computer module without modifying the computer module.Type: GrantFiled: May 2, 2016Date of Patent: January 10, 2017Assignee: International Business Machines CorporationInventors: Joseph A. Griesemer, Steven M. Partlow, David A. Stilwell
-
Publication number: 20160378812Abstract: Embodiments of the present invention provide methods, computer program products, and systems for performing bind breaks. Embodiments of the present invention can be used to reduce bind breaks by saving a save sequence number that reflects a count associated with updates made to a data structure responsive to performing an update to a data structure, retrieving a done sequence number that reflects a count associated with completed bind breaks, and determining whether the save sequence number is less than the done sequence number. Responsive to determining that the save sequence number is less than the done sequence number, embodiments of the invention can reuse the data structure without performing a bind break for the update of the data structure. Embodiments of the invention can be used to reduce bind breaks using sequence numbers to identify when a bind break occurred and updating other processors to avoid duplicating work.Type: ApplicationFiled: June 25, 2015Publication date: December 29, 2016Inventors: Harris M. Morgenstern, Steven M. Partlow, Thomas F. Rankin, Peter J. Relson, Elpida Tzortzatos
-
Publication number: 20160364164Abstract: In one embodiment, a computer-implemented method includes building an available frame header queue (AFHQ). The AFHQ includes one or more headers, each header including one or more frame references being no more than a maximum count of frame references. Each of the one or more frame references of each of the one or more headers refers to an available frame. A frame request is received for one or more requested frames. One or more frame references are extracted, by a computer processor, from the AFHQ in response to the frame request. The extracting includes extracting from the AFHQ one or more requested headers including the one or more frame references referring to at least a portion of the one or more requested frames.Type: ApplicationFiled: June 12, 2015Publication date: December 15, 2016Inventors: David Hom, Harris M. Morgenstern, Steven M. Partlow, Scott B. Tuttle, Elpida Tzortzatos
-
Publication number: 20160364168Abstract: In one embodiment, a computer-implemented method includes receiving a large frame area (LFAREA) request, including a request for a plurality of page frame table entries (PFTEs) to back a plurality of frames in an LFAREA of main memory. Each of the plurality of frames has one of a first size and a second size, where the second size is larger than the first size. The method further includes counting how many frames in the main memory have yet to be initialized and have one of the first size and the second size. A size needed for the plurality of PFTEs is calculated, based at least in part on the counting. A storage area is reserved for the plurality of PFTEs, by a computer processor, where a size of the storage area is the size calculated based at least in part on the counting.Type: ApplicationFiled: August 31, 2016Publication date: December 15, 2016Inventors: Harris M. Morgenstern, Steven M. Partlow, Scott B. Tuttle, Elpida Tzortzatos
-
Publication number: 20160364339Abstract: In one embodiment, a computer-implemented method includes receiving a large frame area (LFAREA) request, including a request for a plurality of page frame table entries (PFTEs) to back a plurality of frames in an LFAREA of main memory. Each of the plurality of frames has one of a first size and a second size, where the second size is larger than the first size. The method further includes counting how many frames in the main memory have yet to be initialized and have one of the first size and the second size. A size needed for the plurality of PFTEs is calculated, based at least in part on the counting. A storage area is reserved for the plurality of PFTEs, by a computer processor, where a size of the storage area is the size calculated based at least in part on the counting.Type: ApplicationFiled: June 11, 2015Publication date: December 15, 2016Inventors: Harris M. Morgenstern, Steven M. Partlow, Scott B. Tuttle, Elpida Tzortzatos
-
Patent number: 9483394Abstract: In one embodiment, a computer-implemented method includes receiving a large frame area (LFAREA) request, including a request for a plurality of page frame table entries (PFTEs) to back a plurality of frames in an LFAREA of main memory. Each of the plurality of frames has one of a first size and a second size, where the second size is larger than the first size. The method further includes counting how many frames in the main memory have yet to be initialized and have one of the first size and the second size. A size needed for the plurality of PFTEs is calculated, based at least in part on the counting. A storage area is reserved for the plurality of PFTEs, by a computer processor, where a size of the storage area is the size calculated based at least in part on the counting.Type: GrantFiled: April 22, 2016Date of Patent: November 1, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Harris M. Morgenstern, Steven M. Partlow, Scott B. Tuttle, Elpida Tzortzatos
-
Patent number: 9471481Abstract: Address-based thresholds for freemained frames are used to determine retention actions. Based, at least in part, on a comparison of a number of freemained frames for an address space against a threshold of freemained frames for the address space, freemained frames can be retained or rejected and/or the threshold can be adjusted.Type: GrantFiled: May 2, 2016Date of Patent: October 18, 2016Assignee: International Business Machines CorporationInventor: Steven M. Partlow
-
Patent number: 9229724Abstract: Embodiments of the disclosure serializing wrapping of a circularly wrapping trace buffer via a compare-and-swap (CS) instruction by a method including executing a CS loop to advance to a location in the buffer indicated by a next free pointer. The method also includes incrementing a master wrap sequence number each time the next free pointer returns to a top of the buffer and executing another CS loop to increment a wrap number stored in a trace block corresponding to the location indicated by the next free pointer. Based upon determining that the wrap number stored in the trace block is one less than or equal to the master wrap sequence number, the method includes reserving space in a buffer associated with the trace block and storing the wrap number stored in the trace block as an old wrap number and incrementing a use-count of the trace block.Type: GrantFiled: March 14, 2013Date of Patent: January 5, 2016Assignee: International Business Machines CorporationInventors: Christopher G. Brooker, Steven M. Partlow
-
Patent number: 8918617Abstract: Embodiments relate to methods, systems and computer program products for defragmenting storage class memory by comparing a utilization rate of the storage class memory to a threshold value. If the utilization rate of the storage class memory is greater than the threshold value, the potentially wasted storage space is then compared to the combined storage capacity of the unclaimed extents of the storage class memory. If the potentially wasted storage space is greater than the combined storage capacity of the unclaimed extents of the storage class memory, a determination is made whether a defragmentation was recently performed. Based on determining that the defragmentation was not recently performed, or that it was recently performed and was productive, performing a defragmentation of the storage class memory.Type: GrantFiled: September 14, 2012Date of Patent: December 23, 2014Assignee: International Business Machines CorporationInventors: Christopher G. Brooker, Alfred F. Foster, Charles E. Mari, Robert Miller, Jr., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Scott B. Tuttle, Elpida Tzortzatos
-
Patent number: 8688946Abstract: An auxiliary storage medium is selected for writing data of a set of one or more pages being paged-out from real memory. The auxiliary storage medium is selected from among a plurality of auxiliary storage media, including differing types of storage media, based on characteristics of the plurality of storage media and/or the attributes of the data being written to the auxiliary storage media.Type: GrantFiled: April 28, 2012Date of Patent: April 1, 2014Assignee: International Business Machines CorporationInventors: Alfred F. Foster, Duane C. Hughes, Charles E. Mari, Robert Miller, Jr., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Peter G. Sutton, Elpida Tzortzatos
-
Patent number: 8683169Abstract: An auxiliary storage medium is selected for writing data of a set of one or more pages being paged-out from real memory. The auxiliary storage medium is selected from among a plurality of auxiliary storage media, including differing types of storage media, based on characteristics of the plurality of storage media and/or the attributes of the data being written to the auxiliary storage media.Type: GrantFiled: May 5, 2011Date of Patent: March 25, 2014Assignee: International Business Machines CorporationInventors: Alfred F. Foster, Duane C. Hughes, Charles E. Mari, Robert Miller, Jr., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Peter G. Sutton, Elpida Tzortzatos
-
Publication number: 20140082313Abstract: Embodiments relate to methods, systems and computer program products for evacuating a portion of a storage class memory. Upon receiving a request to evacuate the portion of the storage class memory a determination is made if the requested evacuation will result in a storage shortage. Based upon determining that the requested evacuation will not result in a storage shortage, the portion of the storage class memory is initialized for evacuation. After initialization is complete, evacuation of the plurality of address spaces of the portion of the storage class memory is preformed, wherein one or more of the plurality of address spaces are evacuated in parallel.Type: ApplicationFiled: September 14, 2012Publication date: March 20, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Robert Miller, JR., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Elpida Tzortzatos
-
Publication number: 20140082317Abstract: Embodiments relate to methods, systems and computer program products for defragmenting storage class memory by comparing a utilization rate of the storage class memory to a threshold value. If the utilization rate of the storage class memory is greater than the threshold value, the potentially wasted storage space is then compared to the combined storage capacity of the unclaimed extents of the storage class memory. If the potentially wasted storage space is greater than the combined storage capacity of the unclaimed extents of the storage class memory, a determination is made whether a defragmentation was recently performed. Based on determining that the defragmentation was not recently performed, or that it was recently performed and was productive, performing a defragmentation of the storage class memory.Type: ApplicationFiled: September 14, 2012Publication date: March 20, 2014Applicant: International Business Machines CorporationInventors: Christopher G. Brooker, Alfred F. Foster, Charles E. Mari, Robert Miller, JR., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Scott B. Tuttle, Elpida Tzortzatos
-
Patent number: 8656133Abstract: Auxiliary storage is segmented into different types of extents (i.e., ranges of storage), including extents with 4K blocks of storage, extents with 1M blocks of storage, empty extents, and mixed extents that include blocks of storage of various sizes (e.g., 4K blocks and 1M blocks). The auxiliary storage, and in particular, the extents and blocks of storage therein, are managed to reduce storage fragmentation and optimize system performance.Type: GrantFiled: May 5, 2011Date of Patent: February 18, 2014Assignee: International Business Machines CorporationInventors: Christopher G. Brooker, Alfred F. Foster, Duane C. Hughes, Charles E. Mari, Robert Miller, Jr., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Elpida Tzortzatos
-
Publication number: 20130339573Abstract: Embodiments relate to optimizing write performance of a flash device. Aspects include receiving a request to evict a plurality of pages from a main memory and determining a block size for the flash device. Aspects also include grouping the plurality of pages from the main memory into a move specification block, wherein a size of the move specification block is the block size and writing the move specification block to the flash device. The block size being determined based on one or more operational characteristics of the flash device.Type: ApplicationFiled: June 15, 2012Publication date: December 19, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Clark A. Anderson, Edward W. Chencinski, Jon S. Entwistle, Adrian C. Gerhard, Thomas J. Griffin, Charles E. Mari, Kenneth J. Oakes, Steven M. Partlow, Peter G. Sutton, Elpida Tzortzatos, Dustin J. VanStee
-
Publication number: 20120284457Abstract: An auxiliary storage medium is selected for writing data of a set of one or more pages being paged-out from real memory. The auxiliary storage medium is selected from among a plurality of auxiliary storage media, including differing types of storage media, based on characteristics of the plurality of storage media and/or the attributes of the data being written to the auxiliary storage media.Type: ApplicationFiled: May 5, 2011Publication date: November 8, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Alfred F. Foster, Duane C. Hughes, Charles E. Mari, Robert Miller, JR., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Peter G. Sutton, Elpida Tzortzatos
-
Publication number: 20120284478Abstract: Auxiliary storage is segmented into different types of extents (i.e., ranges of storage), including extents with 4K blocks of storage, extents with 1M blocks of storage, empty extents, and mixed extents that include blocks of storage of various sizes (e.g., 4K blocks and 1M blocks). The auxiliary storage, and in particular, the extents and blocks of storage therein, are managed to reduce storage fragmentation and optimize system performance.Type: ApplicationFiled: May 5, 2011Publication date: November 8, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Christopher G. Brooker, Alfred F. Foster, Duane C. Hughes, Charles E. Mari, Robert Miller, JR., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Elpida Tzortzatos
-
Publication number: 20120284458Abstract: An auxiliary storage medium is selected for writing data of a set of one or more pages being paged-out from real memory. The auxiliary storage medium is selected from among a plurality of auxiliary storage media, including differing types of storage media, based on characteristics of the plurality of storage media and/or the attributes of the data being written to the auxiliary storage media.Type: ApplicationFiled: April 28, 2012Publication date: November 8, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Alfred F. Foster, Duane C. Hughes, Charles E. Mari, Robert Miller, JR., Harris M. Morgenstern, Walter W. Otto, Steven M. Partlow, Thomas F. Rankin, Peter G. Sutton, Elpida Tzortzatos