Patent application number | Description | Published |
20090172541 | METHOD AND SYSTEM FOR PROVIDING DYNAMIC CONTEXT ASSIST FOR A COMMAND LINE INTERFACE - A method, system, and computer program product for providing dynamic context assistance to a user of a system, such as a storage system. One or more current command line interface (CLI) entries that are entered in a CLI of the system are received and a current state of the system is determined. Dynamic context assistance is then generated for one or more current CLI entries based on entered values of the one or more CLI entries. In this regard, the dynamic context assistance can be generated and displayed in a text or graphical form when one or more dynamic context assist keys are entered in the CLI in conjunction with the current CLI entry. | 07-02-2009 |
20090187650 | Method and system for determining probability for availability in an instant message system - This invention provides a method or a system to track, query, and display an accurate time for the availability of other users in an instant messaging environment. The solution provides an advantage over the known solutions by providing an accurate estimation of the time for the user to be online, thus avoiding waiting for the person to log on during a timeframe where the person typically does not log on. This is a common occurrence where team members are located on the other side of the world. | 07-23-2009 |
20090193088 | Dynamic message correction - A system is presented to allow users in an instant messaging environment to edit already-exchanged messages dynamically, and resend the edited version of the message to the target users, as an example. The newly edited message received by the second user is clearly understandable because the corrected parts of the message have been tagged. Depending on the implementation, either a new complete and corrected message is sent, or the sent message indicates the recent editions. The altering user should go over the communication text, change or edit the text, and press ENTER. | 07-30-2009 |
20090198699 | REMOTE SPACE EFFICIENT REPOSITORY - A method for storing data includes establishing a space efficient storage system including a virtual repository, a staging repository and a remote repository. The virtual repository includes a first pointer to the staging repository, and the staging repository includes a second pointer to the remote repository. The method further includes receiving data at the virtual repository, storing the received data in the staging repository based on the first pointer, and determining a data access frequency based on the storage in the staging repository. In addition, the method includes comparing the determined data access frequency to a threshold frequency and transferring the stored data to the remote repository based on the second pointer and comparison and storing the stored data at the staging repository based on the comparison. | 08-06-2009 |
20090198710 | REMOTE SPACE EFFICIENT REPOSITORY - A method for storing data includes establishing a space efficient storage system including a virtual repository, a staging repository and a remote repository. The virtual repository includes a first pointer to the staging repository, and the staging repository includes a second pointer to the remote repository. The method further includes receiving data at the virtual repository, storing the received data in the staging repository based on the first pointer, and transferring the stored data to the remote repository based on the second pointer. | 08-06-2009 |
20100175075 | METHOD FOR EXECUTING A SOFTWARE ROUTINE IDENTIFIED IN A TASK OBJECT - 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. The method further includes adding the second task object to a task execution queue on the computer server and executing the first software routine identified by the first software routine identifier in the second task object on the computer server to obtain at least a first result value, when the first flag value is a first predetermined value and the result parameter associated with the first task object corresponds to a second predetermined value. | 07-08-2010 |
20100175076 | METHOD FOR EXECUTING A SOFTWARE ROUTINE IDENTIFIED IN A TASK OBJECT - 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, and generating a task object generation command having at least a first software routine identifier, parameter data, and event information. The event information has an event identifier and a first flag value. The method further includes generating a first task object in response to the task object generation command, which includes the first software routine identifier, the parameter data, and the event information. The method further includes adding the first task object to a task execution queue on the computer server, and executing the first software routine identified by the first software routine identifier in the first task object on the computer server to obtain at least a first result value, when an event listener on the computer server determines that the first flag value is a first predetermined value and an event associated with the event identifier is detected. | 07-08-2010 |
20110191558 | DATA MIGRATION METHODOLOGY FOR USE WITH ARRAYS OF POWERED-DOWN STORAGE DEVICES - 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. | 08-04-2011 |
20110191563 | ON DEMAND CONVERSION OF STANDARD LOGICAL VOLUMES TO THIN-PROVISIONED LOGICAL VOLUMES - 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. | 08-04-2011 |
20110258363 | SUB-LUN INPUT/OUTPUT PROFILING FOR SSD DEVICES - Exemplary method, system, and computer program embodiments for profiling input/output (I/O) for solid state drive (SSD) devices in a computing storage environment by a processor device are provided. In one embodiment, 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. | 10-20-2011 |
20110280404 | ITERATIVE DATA SECRET-SHARING TRANSFORMATION - Provided are a method, system, and article of manufacture for iterative data secret-sharing transformation and reconversion. In one aspect, data secret-sharing transformation and reconversion is provided in which each bit of an input stream of bits of data is split, on a bit by bit basis, into a pair of secret-sharing bits, and the secret-sharing bits of each pair of secret-sharing bits are separated into separate streams of secret-sharing bits. In this manner, one secret-sharing bit of each pair of secret-sharing bits may be placed in one stream of secret-sharing bits and the other secret-sharing bit of each pair may be placed in another stream of secret-sharing bits different from the one stream of secret-sharing bits. Confidentiality of the original input stream may be protected in the event one but not both streams of secret-sharing bits is obtained by unauthorized personnel. In another aspect, for an input stream of N bits, each received bit of the N bits of the input stream of data, may be interatively split, on a bit by bit basis, into a pair of secret-sharing bits, to generate as few as N+1 secret-sharing bits from the input stream of bits N bits. Other features and aspects may be realized, depending upon the particular application. | 11-17-2011 |
20110289059 | ORDERING VOLUMES AND TRACKS FOR DATA TRANSFER BASED ON USAGE CHARACTERISTICS - A data transfer application implemented in a computational device receives a request to copy a plurality of storage volumes that form a consistency group. A determination is made that a first storage volume of the plurality of storage volumes is more likely to be written into than a second storage volume of the plurality of storage volumes, in response to receiving the request to copy the plurality of storage volumes. The first storage volume is copied before copying the second storage volume, in response to determining that the first storage volume is more likely to be written into than the second storage volume. | 11-24-2011 |
20120078848 | METHODS FOR DYNAMIC CONSISTENCY GROUP FORMATION AND SYSTEMS USING THE SAME - 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. | 03-29-2012 |
20120124308 | DETERMINING WHETHER TO EXTEND A DRAIN TIME TO COPY DATA BLOCKS FROM A FIRST STORAGE TO A SECOND STORAGE - 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. | 05-17-2012 |
20120131292 | VARIABLE DATA PRESERVATION PREWRITE - 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. The parameter may be, for example, a percentage of the data to be preserved, such that a user can specify the percentage of the point-in-time data which is prewritten to the target storage device. Alternatively, the parameter may be, for example, a probability of a collision occurring, such that a user can specify a probability of a collision occurring. Other features and aspects may be realized, depending upon the particular application. | 05-24-2012 |
20120173856 | Determining Logical Configuration Commands to Create a Logical Object - 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. | 07-05-2012 |
20120185433 | PRIORITY-BASED ASYNCHRONOUS DATA REPLICATION - 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. | 07-19-2012 |
20120203996 | DATA MIGRATION METHODOLOGY FOR USE WITH ARRAYS OF POWERED-DOWN STORAGE DEVICES - 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. | 08-09-2012 |
20120203998 | ON DEMAND CONVERSION OF STANDARD LOGICAL VOLUMES TO THIN-PROVISIONED LOGICAL VOLUMES - 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. | 08-09-2012 |
20120221778 | SUB-LUN INPUT/OUTPUT PROFILING FOR SSD DEVICES - 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. | 08-30-2012 |
20120239893 | METHODS FOR DYNAMIC CONSISTENCY GROUP FORMATION - 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. | 09-20-2012 |
20120254568 | DETERMINING WHETHER TO EXTEND A DRAIN TIME TO COPY DATA BLOCKS FROM A FIRST STORAGE TO A SECOND STORAGE - 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. | 10-04-2012 |
20120290803 | VARIABLE DATA PRESERVATION PREWRITE - 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. | 11-15-2012 |
20120323821 | METHODS FOR BILLING FOR DATA STORAGE IN A TIERED DATA STORAGE SYSTEM - 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. | 12-20-2012 |
20130067481 | AUDIO FEEDBACK FOR COMMAND LINE INTERFACE COMMANDS - 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. | 03-14-2013 |
20130169437 | AUDIO FEEDBACK FOR COMMAND LINE INTERFACE COMMANDS - For providing audio feedback for command line interface (CLI) commands in a computing environment, auditory notifications are generated for indicating a completion of CLI commands. The auditory notifications are configurable by user preferences. | 07-04-2013 |
20130254770 | METHOD FOR SINGLETON PROCESS CONTROL - 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. | 09-26-2013 |
20140208010 | SUB-LUN INPUT/OUTPUT PROFILING FOR SSD DEVICES - 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. | 07-24-2014 |
20140208011 | SUB-LUN INPUT/OUTPUT PROFILING FOR SSD DEVICES - 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. | 07-24-2014 |