Abstract: A system and method for implementing dynamic interfaces in a JAVA program including methods having a common implementation and other methods to be handled independently. The system comprises a first dynamic proxy object implementing an invocation handler for providing default implementations; a separate object providing implementations of any method in a defined interface that requires independent handling; and, a second dynamic proxy object provided for checking a method definition object for an implementation of the method, and in response, one of: invoking the method on the separate object if the implementation exists, and if the implementation does not exist, invoking the method on the first dynamic proxy object. The second dynamic proxy object thus allows for a single implementation for repetitive methods, while allowing special cases to be handled independently.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: Exemplary method, system, and computer program embodiments for data migration between first and second storage mediums of an available plurality of storage mediums in a computing storage environment are provided. 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.

Abstract: 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.

Abstract: 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.

Abstract: 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. A corresponding system, apparatus, and computer program product are also disclosed and claimed herein.

Abstract: A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to select at least one sample of data; operate a plurality of the data compression engines to compress the selected sample(s); determine the compression ratios of the operated data compression engines with respect to the selected sample(s); and select the data compression engine having the greatest compression ratio with respect to the selected sample(s), to compress the data. Further, the data compression engines may be in tiers from low to high in accordance with expected latency to compress data and to uncompress compressed data; and a data compression engine is selected from a tier that is inverse to the present rate of access.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: 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.

Abstract: A system and method implementable in a JAVA® application for providing C++ language friend-style access that grants JAVA® objects access to methods of another JAVA® object. The method comprises steps of: providing a method in the implementing JAVA object for determining the name of a JAVA object class that has called a method within the implementing JAVA object; comparing the JAVA object class name against a list of object names that have been granted access rights to the method in the implementing JAVA object; and, in response to the comparing, one of: enabling execution of the method of the implementing JAVA object upon determination that the calling object class is a member of the list, or, preventing execution of the method upon determination that the calling object is not a member of the list.

Abstract: A technique for reducing the number of events that are transmitted by a server to a client/server application programming interface (API). At the server host, each of different event messages is associated with at least one event category in a hierarchy of event categories. Each client host sends a registration request to the server host in order to inform the host server host that the client wants to receive event messages associated with a specified event category. The server host associates the specified event category with each client host and communicates the event messages that are descendants of the specified event category, wherein the event messages may be descendants of more than one specified event category.

Abstract: The amount of code required to use the command pattern for client-server communications is reduced because, instead of creating separate commands for different actions, instructions required for an action are put into a single, abstract command, along with the required data. The command pattern, an object-oriented design pattern, describes a pattern for encapsulating instructions and data into a single object, called a command. A client application or a dynamic proxy uses the command pattern to encapsulate an identifier of a function to be performed at a server, and first data for use by the server in performing the function, into a command object, and provides the command object to a server host. The server host performs the function by associating instructions with the identifier and executing the instructions, using the first data, to obtain second data, and returns the command object with the second data to the client host.