International Business Machines Corporation

Zhengwen He

William Roy Yonker

David Lynn Merbach

Christopher Zaremba

James Patrick Smith

Mark L Yakushev

Mandeep Kaur Jandir

Duane Mark Baldwin

Bernhard Julius Klingenberg

Gregory John Tevis

David Gregory Van Hise

Allen Robert Heitman

Gregory John Knight

Gary Thomas Axberg

Raymond M Li

Hans Hanhsia Lin

Farhan Ahmad

Embodiments of the present invention provide efficient and cost-effective systems and methods for backing up and recovering a virtual machine and application data therein. Embodiments of the present invention can be used to satisfy near-zero RPOs by providing more recovery points for backups in virtual machine environments, while also providing increased granularity for recovery (i.e., single virtual disk, single file, etc.) and maintaining central management capabilities and back up efficiencies offered by virtual machine-level backups.

Back up and recovery in virtual machine environments

A method, system, and computer program product are provided for matching a storage dependent device to a storage subsystem. Storage requirements are identified for a storage dependent device that is coupled to a network. Additionally, a set of storage subsystems that are coupled to the network are identified. A determination is made as to whether at least one storage subsystem in the set of storage subsystems meets the storage requirements of the storage dependent device. An identified storage subsystem is formed by identifying the at least one storage subsystem that meets the storage requirements of the storage dependent device. Responsive to forming the identified storage subsystem, at least one storage subsystem is coupled to the storage dependent device, wherein the storage dependent device utilizes storage capabilities of the identified storage subsystem.

Dynamically matching data service capabilities to data service level objectives

The present invention provides for a method and system for the disposition of tasks which failed to run during their originally scheduled time. The determination of whether to run missed or delayed tasks is based on calculated ratios rather than on fixed window sizes. A Lateness Ratio is calculated to determine if the time elapsed between the missed task and the scheduled run time is small enough to still allow a late task to run. A Closeness Ratio is calculated to determine if the next available run time for the missed task is close enough to the next scheduled execution of the task that the missed task will be run in place of the upcoming scheduled task. Each ratio is compared to a user defined ratio limit, so if the calculated ratio does not exceed the limit, then the missed task is executed at the first available opportunity.

Optimized methodology for dispositioning missed scheduled tasks

A storage area network (SAN) of the type has a plurality of components including one or more digital data processors in communication with one or more storage devices via a switching fabric. An interface process, e.g., resident on a manager digital data processor, permits the operator/administrator to effect execution of at least a process residing on the manager and at least one process, such as a management application, residing on another SAN component.

Methods and apparatus for launching device specific applications on storage area network components

Provided are a method, system, and program for selectively removing entities from a user interface displaying network entities. A discovery database includes information on at least one network, and, for each network, information on entities in the network and a status of the entities. A user interface display is generated indicating the entities in one network that are available and unavailable. User selection is received of at least one entity in the network that is displayed as unavailable, wherein at least one displayed unavailable entity is not selected. User selection is received to remove the selected at least one entity and the selected at least one entity and any underlying entities within the selected entity are removed in response to the user selection to remove the selected at least one entity.

Selectively removing entities from a user interface displaying network entities

A storage area network (SAN) has a plurality of components including digital data processors, e.g., hosts, coupled to a plurality of storage device. Common, platform-independent processes execute on the hosts, which can be of varied platform types, e.g., Unix&#x2122;, Windows&#x2122;, Solaris, and so forth. Those processes utilizes the command line interface of the host operating system to invoke platform-dependent processes on the respective hosts. The platform-dependent processes return data to the platform-independent processes, e.g., via Standard Output or Standard Error of the host operating system command line interface.

Storage area network methods and apparatus for communication and interfacing with multiple platforms

Method, program product, and system for the probabilistic determination of storage device enclosure-to-storage device relationships in a storage system, when the exact relationship is unknown. A table is built at storage system startup representing the initial storage device enclosure to storage device relationship. For efficiency, as topology changes occur within the storage system, the table is not updated to reflect the topology change. When a user wishes to access a specific storage device enclosure, the table is opened, and the most recently added storage device entry for the selected enclosure is chosen. The chosen storage device is queried for its current physical location. If the storage device still resides within the selected enclosure, the user access the enclosure via the chosen storage device. If the chosen storage device does not reside within the disclosure, the storage device entry is moved to the enclosure entry where it now resides, and the next most recently added storage device within the selected enclosure entry is chosen. The storage device select/query process is repeated until a storage device referenced by the chosen storage device entry is determined to reside within the selected enclosure. If the list of storage devices for the selected enclosure entry is exhausted, the table is rebuilt.

Growing community of inventors

Rochester, MN, United States of America

Zhengwen He