Patents by Inventor Jason L. Peipelman
Jason L. Peipelman 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: 8572339Abstract: In one aspect of the present description, a data preservation function is provided for preserving a set of data on a source storage device at a point in time, and includes identifying as a function of prior update usage, such as input/output usage, of the data to be preserved, a portion of the data which is more likely to be the subject of updates during at least a portion of the data preservation operation as compared to the remaining portion of the data to be preserved, and copies the identified portion of the data to be preserved to a target storage device. In another aspect, the size of the portion of data to be identified is variable. In one embodiment, the size of the portion of data to be identified is a function of a parameter of the command, such that a user can specify the command parameter which affects the size of the portion of data which is prewritten to the target storage device.Type: GrantFiled: November 19, 2010Date of Patent: October 29, 2013Assignee: International Business Machines CorporationInventors: Paul A. Jennas, II, Jason L. Peipelman, Joshua Marshall Rhoades, Matthew J. Ward
-
Patent number: 8554737Abstract: In one embodiment, a system, includes logic for creating a snapshot of first data stored on a source storage system, wherein the snapshot is a logical copy of the first data stored on the source storage system with respect to data content and data structure; logic for copying the snapshot to a target storage system; logic for copying the first data represented by the snapshot from the source storage system to the target storage system; logic for detecting one or more write operations affecting data on the source storage system; logic for detecting one or more collisions affecting the first data on the source storage system, logic for setting a consistency group interval; and logic for altering the consistency group interval to minimise collisions affecting data on the source storage system. Other systems and computer program products for dynamic consistency group formation are also described.Type: GrantFiled: September 28, 2010Date of Patent: October 8, 2013Assignee: International Business Machines CorporationInventors: Paul A. Jennas, II, Jason L. Peipelman, Joshua M. Rhoades, Matthew J. Ward
-
Patent number: 8548949Abstract: A method for dynamic consistency group formation, in one embodiment, includes creating a snapshot of first data stored on a source storage system with respect to data content and data structure, copying the snapshot to a target storage system, detecting one or more write operations affecting data on the source storage system while copying the first data, detecting one or more collisions affecting the first data on the source storage system, wherein a collision occurs whenever the write operations affect the first data prior to the first data being written, setting a consistency group interval which represents an interval duration between successive snapshot create-and-copy events, and altering the consistency group interval to minimize collisions affecting data on at least one of the storage systems. Other methods for dynamic consistency group formation are also described.Type: GrantFiled: May 30, 2012Date of Patent: October 1, 2013Assignee: International Business Machines CorporationInventors: Paul A. Jennas, II, Jason L. Peipelman, Joshua M. Rhoades, Matthew J. Ward
-
Publication number: 20130254770Abstract: A method for singleton process control in a computer environment is provided. A process identification (PID) for a background process is stored in a first temporary file. The PID is stored by a parent process and subsequently accessed by the background process. The background process is exited if an active PID is determined to exist in a second, global temporary file. The PID from the first temporary file is stored into the second, global temporary file. A singleton code block is then executed.Type: ApplicationFiled: May 24, 2013Publication date: September 26, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mario F. ACEDO, Ezequiel CERVANTES, Paul A. JENNAS, II, Jason L. PEIPELMAN, Matthew J. WARD
-
Publication number: 20130067481Abstract: Exemplary method, system, and computer program product embodiments for audio feedback for command line interface (CLI) commands in a computing environment are provided. In one embodiment, by way of example only, auditory notifications are generated for indicating a completion of CLI commands. The auditory notifications are configurable by user preferences. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: ApplicationFiled: September 14, 2011Publication date: March 14, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dale H. ANDERSON, Paul A. JENNAS, II, Jason L. PEIPELMAN, Matthew J. WARD
-
Publication number: 20120323821Abstract: In one embodiment, a method for determining pricing for data storage includes receiving from a data provider a request indicating an amount of data storage space in at least one of one or more tiers of data storage, receiving data from the data provider to store in the at least one of the one or more tiers of data storage, storing the data provider's data in the at least one of the one or more tiers of data storage, and calculating a base price for storage of the data provider's data. In another embodiment, a tiered storage system includes a processor, a memory, logic adapted for determining an amount of a data provider's data in each of at least two tiers of data storage, and logic adapted for calculating a price for storage of the data provider's data.Type: ApplicationFiled: June 15, 2011Publication date: December 20, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Igor Crk, Gary I. Dickenson, Paul A. Jennas, II, Larry Juarez, Jason L. Peipelman, Todd C. Sorenson, David V. Valverde
-
Publication number: 20120290747Abstract: A method for more effectively distributing the I/O workload in a data replication system is disclosed herein. In selected embodiments, such a method may include generating an I/O request and identifying a storage resource group associated with the I/O request. In the event the I/O request is associated with a first storage resource group, the I/O request may be directed to a first storage device and a copy of the I/O request may be mirrored from the first storage device to a second storage device. Alternatively, in the event the I/O request is associated with a second storage resource group, the I/O request may be directed to a second storage device and a copy of the I/O request may be mirrored from the second storage device to the first storage device.Type: ApplicationFiled: April 16, 2012Publication date: November 15, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip M. Doatmas, Michael R. Groseclose, Paul A. Jennas, Larry Juarez, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson
-
Publication number: 20120290803Abstract: In one aspect of the present description, a data preservation function is provided for preserving a set of data on a source storage device at a point in time, and includes identifying as a function of prior update usage, such as input/output usage, of the data to be preserved, a portion of the data which is more likely to be the subject of updates during at least a portion of the data preservation operation as compared to the remaining portion of the data to be preserved, and copies the identified portion of the data to be preserved to a target storage device. In another aspect, the size of the portion of data to be identified is variable. Other features and aspects may be realized, depending upon the particular application.Type: ApplicationFiled: May 16, 2012Publication date: November 15, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Paul A. Jennas, II, Jason L. Peipelman, Joshua Marshall Rhoades, Matthew J. Ward
-
Publication number: 20120254568Abstract: Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure indicates data blocks in the first storage to copy to the second storage. A drain operation copies the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.Type: ApplicationFiled: May 17, 2012Publication date: October 4, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Theodore T. Harris, JR., Paul A. Jennas, II, Jason L. Peipelman, Joshua M. Rhoades, Matthew J. Ward
-
Publication number: 20120239893Abstract: A method for dynamic consistency group formation, in one embodiment, includes creating a snapshot of first data stored on a source storage system with respect to data content and data structure, copying the snapshot to a target storage system, detecting one or more write operations affecting data on the source storage system while copying the first data, detecting one or more collisions affecting the first data on the source storage system, wherein a collision occurs whenever the write operations affect the first data prior to the first data being written, setting a consistency group interval which represents an interval duration between successive snapshot create-and-copy events, and altering the consistency group interval to minimize collisions affecting data on at least one of the storage systems. Other methods for dynamic consistency group formation are also described.Type: ApplicationFiled: May 30, 2012Publication date: September 20, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Paul A. Jennas, II, Jason L. Peipelman, Joshua M. Rhoades, Matthew J. Ward
-
Publication number: 20120221822Abstract: In one embodiment, pursuant to migrating the data from the first to the second storage medium, the data is allocated to the second storage medium while retaining an allocation of the data in the first storage medium. If the data is migrated from the second storage medium back to the first storage medium, the data is pointed to the allocation of the data in the first storage medium to alleviate data movement from the second storage medium to the first storage medium. If the allocation of the data in the first storage medium is determined to be needed for other data, the allocation of the data in the first storage medium is freed.Type: ApplicationFiled: April 27, 2012Publication date: August 30, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dale H. ANDERSON, Philip M. DOATMAS, Michael R. GROSECLOSE, JR., Paul A. JENNAS, II, Larry JUAREZ, Brian S. McCAIN, David MONTGOMERY, Jason L. PEIPELMAN, Joshua M. RHOADES, Todd C. SORENSON, David V. VALVERDE
-
Publication number: 20120221778Abstract: A read/write ratio for each of a plurality of data segments classified in a hot category as hot data segments is determined. Each of the plurality of hot data segments is ordered by the read/write ratio in a descending order. Each of a plurality of available SSD devices is ordered by a remaining life expectancy in an ascending order. Those of the plurality of hot data segments are matched with those of the plurality of hot data segments with those of the plurality of available SSD devices such that a hot data segment having a higher read/write ratio is provided to an SSD device having a smaller remaining life expectancy than another hot data segment having a lower read/write ratio.Type: ApplicationFiled: May 3, 2012Publication date: August 30, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip M. DOATMAS, Paul A. JENNAS, II, Larry JUAREZ, David MONTGOMERY, Jason L. PEIPELMAN, Joshua M. Rhoades, Todd C. SORENSON
-
Publication number: 20120203996Abstract: A method for managing extents in a data storage system includes monitoring usage statistics for an extent residing on one or more powered-up storage devices. In the event the extent has not been accessed for specified period of time (as determined from the usage statistics), the method automatically compresses the extent and migrates the extent to an intermediate repository. Once the amount of data in the intermediate repository reaches a specified level, the method migrates the extent from the intermediate repository to one or more normally powered-down storage devices. If I/O is received for the extent while it resides in the normally powered-down storage devices or the intermediate repository, the method automatically migrates the extent from the normally powered-down storage devices or the intermediate repository to the normally powered-up storage devices. A corresponding apparatus and computer program product are also disclosed.Type: ApplicationFiled: April 16, 2012Publication date: August 9, 2012Applicant: International Business Machines CorporationInventors: Dale H. Anderson, Philip M. Doatmas, Michael R. Groseclose, Paul A. Jennas, Larry Juarez, Brian S. McCain, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson
-
Publication number: 20120203998Abstract: A method for concurrently converting a standard volume to a thin-provisioned volume includes initially establishing metadata for a thin-provisioned volume. The method then updates the metadata for the thin-provisioned volume to point to extents residing in a standard volume. The method then suspends I/O to metadata for the standard volume. Upon suspending the I/O, the method migrates control of the extents in the standard volume from a standard-volume control algorithm to a thin-provisioned-volume control algorithm. The method then resumes the I/O to the metadata for the thin-provisioned volume. Using this technique, standard volumes may be rapidly converted to thin-provisioned volumes while minimally disrupting I/O to the volumes. A corresponding apparatus and computer program product are also disclosed and claimed herein.Type: ApplicationFiled: April 16, 2012Publication date: August 9, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mario F. Acedo, Paul A. Jennas, Jason L. Peipelman, Richard A. Ripberger, Matthew J. Ward
-
Patent number: 8230450Abstract: A method for executing a software routine identified in a task object is provided. The method includes accessing a list of software routine identifiers associated with software routines that are executable on a computer server. The method further includes generating a task object generation command having at least a first software routine identifier, parameter data, and link task information and generating a second task object in response to the task object generation command. The second task object includes the first software routine identifier, the parameter data, and the link task information.Type: GrantFiled: January 6, 2009Date of Patent: July 24, 2012Assignee: International Business Machines CorporationInventors: Mario F. Acedo, Ezequiel Cervantes, Paul A. Jennas, II, Brian S. McCain, Jason L. Peipelman, Matthew J. Ward
-
Publication number: 20120185433Abstract: A priority-based method for replicating data is disclosed herein. In one embodiment, such a method includes providing a primary storage device and a secondary storage device. Multiple storage areas (e.g., volumes, groups of volumes, etc.) are designated for replication from the primary storage device to the secondary storage device. A priority level is assigned to each of the storage areas. Using these priority levels, the method replicates the storage areas from the primary storage device to the secondary storage device in accordance with their assigned priority levels. Higher priority storage areas are replicated prior to lower priority storage areas. A corresponding computer program product and system are also disclosed herein.Type: ApplicationFiled: January 14, 2011Publication date: July 19, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Theodore T. Harris, JR., Jason L. Peipelman, Joshua M. Rhoades, Matthew J. Ward
-
Publication number: 20120173856Abstract: An approach to generating logical configuration commands for logical objects in a system. A method may involve receiving a command requesting the logical configuration commands to configure the specified logical object (subject logical object) and the logical objects that support the logical object (the support logical objects). The method may also involve determining what logical objects in the system support the subject logical object. This may require determining the support logical objects that directly support the subject logical object, and then recursively examining each support logical objects to find the logical objects on which they depend. For each logical object (whether the subject logical object or one of the support logical objects), the method may involve determining the logical configuration commands to appropriately create and modify the logical object. The logical configuration commands may then be presented to the user.Type: ApplicationFiled: January 4, 2011Publication date: July 5, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Mario F. Acedo, Ezequiel Cervantes, Paul A. Jennas, II, Jason L. Peipelman, Matthew J. Ward
-
Publication number: 20120131292Abstract: In one aspect of the present description, a data preservation function is provided for preserving a set of data on a source storage device at a point in time, and includes identifying as a function of prior update usage, such as input/output usage, of the data to be preserved, a portion of the data which is more likely to be the subject of updates during at least a portion of the data preservation operation as compared to the remaining portion of the data to be preserved, and copies the identified portion of the data to be preserved to a target storage device. In another aspect, the size of the portion of data to be identified is variable. In one embodiment, the size of the portion of data to be identified is a function of a parameter of the command, such that a user can specify the command parameter which affects the size of the portion of data which is prewritten to the target storage device.Type: ApplicationFiled: November 19, 2010Publication date: May 24, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Paul A. Jennas, II, Jason L. Peipelman, Joshua Marshall Rhoades, Matthew J. Ward
-
Publication number: 20120124308Abstract: Provided are a computer program product, system, and method for determining whether to extend a drain time to copy data blocks from a first storage to a second storage. A data structure is generated indicating data blocks in the first storage to copy to the second storage. A drain operation is initiated to copy the data blocks indicated in the first storage to the second storage for a drain time period. Write requests to the data blocks indicated in the data structure are queued during the drain time period, wherein the queued write requests are not completed while queued. Metric information based on the writes that occur to data blocks in the first storage are gathered during the drain time period; and in response to expiration of the drain time period, a determination is made from the gathered metric information of whether to continue the drain operation or terminate the drain operation.Type: ApplicationFiled: November 17, 2010Publication date: May 17, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Theodore T. Harris, JR., Paul A. Jennas, II, Jason L. Peipelman, Joshua M. Rhoades, Matthew J. Ward
-
Publication number: 20120078848Abstract: A method for dynamic consistency group formation, in one embodiment, includes creating a snapshot of first data stored on a source storage system with respect to data content and data structure, copying the snapshot to a target storage system, detecting one or more write operations affecting data on the source storage system while copying the first data, detecting one or more collisions affecting the first data on the source storage system, wherein a collision occurs whenever the write operations affect the first data prior to the first data being written, setting a consistency group interval which represents an interval duration between successive snapshot create-and-copy events, and altering the consistency group interval to minimize collisions affecting data on at least one of the storage systems. Other methods, systems, and computer program products for dynamic consistency group formation are also described.Type: ApplicationFiled: September 28, 2010Publication date: March 29, 2012Applicant: International Business Machines CorporationInventors: Paul A. Jennas, II, Jason L. Peipelman, Joshua M. Rhoades, Matthew J. Ward