| HITACHI DATA SYSTEMS CORPORATION Patent applications |
| Patent application number | Title | Published |
|---|
| 20120079424 | SYSTEM AND METHOD FOR OPTIMIZING PROTECTION LEVELS WHEN REPLICATING DATA IN AN OBJECT STORAGE SYSTEM - A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. A data protection level method comprises setting a numerical value of a system dynamic data protection level for each system of nodes; and in response to user input, setting a value of a data protection level for one or more data objects in a system, the value being a fixed numerical value or a dynamic value. If the one or more data objects have a dynamic value of the data protection level in a system, the one or more data objects inherit the system dynamic data protection level of the system in which the one or more data objects reside. The value of the data protection level represents a number of copies of data of the one or more data objects to be kept where the one or more data objects reside. | 03-29-2012 |
| 20120079315 | SYSTEM AND METHOD FOR TRANSPARENT RECOVERY OF DAMAGED OR UNAVAILABLE OBJECTS IN A REPLICATED OBJECT STORAGE SYSTEM - A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. The nodes are grouped into a plurality of systems each having multiple nodes. An object recovery method comprises: receiving, by a first system of the plurality of systems from a client application, a read request for an object, the object having been replicated to/from at least one second system among the plurality of systems; if the object of the read request is available in the first system, returning by the first system the object of the read request to the client application; and if the object of the read request is not available in the first system, performing a read from replica process by the first system to access a replica of the object from a second system among the plurality of systems and using the replica of the object to return the object of the read request to the client application. | 03-29-2012 |
| 20120078881 | SYSTEM AND METHOD FOR AGGREGATING QUERY RESULTS IN A FAULT-TOLERANT DATABASE MANAGEMENT SYSTEM - A redundant array of independent nodes are networked together. Each node executes an instance of an application that provides object-based storage. Metadata objects are stored in a set of regions distributed among the nodes across the array. A given region is identified by hashing a metadata object attribute and extracting a given set of bits of a resulting hash value. A method of managing query results comprises: receiving, by a first node of the plurality of independent nodes from a client application, a request for a list of objects with a criterion; issuing by the first node a query to all the nodes based on the received request; processing the query by each node over the regions in the node using the metadata objects stored in the regions; aggregating and filtering by the first node results of the query from all the nodes; and returning by the first node the aggregated and filtered results to the client application. | 03-29-2012 |
| 20120078850 | System and method for managing scalability in a distributed database - This disclosure enables a user to incrementally increase or decrease the size of the cluster and, in particular, to incrementally increase or decrease the number of map regions implemented in a metadata manager associated with the cluster while maintaining availability of the cluster. In a representative embodiment, a configurable target map size is identified, either manually (e.g., by the user) or programmatically. If the target map size is found to be within an acceptable value (given the available node configuration), a procedure to create a new map is triggered. The new map preferably is generated as follows. Initially, one or more new temporary region(s) are created either to split or join the existing regions (depending on whether the map is being increased or decreased). For each temporary region, the process also generates MDPL backup regions. Metadata from an original region (or regions) is then migrated to the temporary region(s). Once the migrations have been completed, the old region or regions (from which the metadata is migrated) are removed and what were the temporary regions are, in effect, promoted. The result is the new map. | 03-29-2012 |
| 20120078849 | System and method for enhancing availability of a distributed object storage system during a partial database outage - An “operate with missing region” feature of this disclosure allows the cluster to continue servicing reads for available regions even when some regions are missing. In particular, upon a given node failure condition, the cluster is placed in an effective read-only mode for all regions. The node failure condition typically is one where there has been a failure of an authoritative region copy and no backup copy is then available. As used herein, “read-only” means that no client write or update requests will succeed while the cluster is in this state. In particular, those requests should fail with an error message (or the like) that indicates failure because of the read-only status. Preferably, such requests are then re-tried. In this mode, all regions are only allowed to perform read operations. During the read-only state, the cluster continues to operate with missing regions, and missing regions are entered on the region map. The cluster then automatically recovers returning missing region(s), after which is leaves the read-only state. | 03-29-2012 |
| 20120078847 | System and method for managing integrity in a distributed database - Cluster recovery time is reduced by an incremental refresh technique that is described herein. The goal of the technique is to salvage the portion of the redundant distributed database lost (e.g., during a fault) by performing an incremental refresh of only the updates occurring to that portion of the database since the time of loss. | 03-29-2012 |
| 20120047293 | METHOD AND APPARATUS OF STORAGE ARRAY WITH FRAME FORWARDING CAPABILITY - Embodiments of the invention provide a method of storage array with frame forwarding capability to reduce the complexity of an IT platform system having a large number of hardware devices. In one embodiment, a storage system comprises one or more storage devices; a storage controller having a storage controller processor and a storage controller memory and being coupled with the one or more storage devices; an interface controller receiving an input/output command directly from a host computer; and an internal bus. The interface controller and the storage controller are coupled by the internal bus. In another embodiment, a storage system comprises one or more storage devices; a storage controller having a processor and a memory and being coupled with the one or more storage devices; and a network interface controller which provides virtual Ethernet bridging. | 02-23-2012 |
| 20110238715 | COMPLEX OBJECT MANAGEMENT THROUGH FILE AND DIRECTORY INTERFACE - A method for representing a computer-related resource in a computer-related system environment comprises creating an object model of the resource, the object model including objects that correspond to components of the resource, configuration information of the objects, and relationships among the objects; providing a resource application program interface to allow communication with and access to the components of the resource; mapping the objects of the object model to files and directories of a file and directory structure; presenting the file and directory structure via a file system application program interface to allow an application to manipulate the files and directories so as to manipulate the components of the resource via the resource application program interface; and manipulating the components of the resource based on manipulation of the files and directories from the application. | 09-29-2011 |
| 20110178983 | Fast primary cluster recovery - A cluster recovery process is implemented across a set of distributed archives, where each individual archive is a storage cluster of preferably symmetric nodes. Each node of a cluster typically executes an instance of an application that provides object-based storage of fixed content data and associated metadata. According to the storage method, an association or “link” between a first cluster and a second cluster is first established to facilitate replication. The first cluster is sometimes referred to as a “primary” whereas the “second” cluster is sometimes referred to as a “replica.” Once the link is made, the first cluster's fixed content data and metadata are then replicated from the first cluster to the second cluster, preferably in a continuous manner. Upon a failure of the first cluster, however, a failover operation occurs, and clients of the first cluster are redirected to the second cluster. Upon repair or replacement of the first cluster (a “restore”), the repaired or replaced first cluster resumes authority for servicing the clients of the first cluster. This restore operation preferably occurs in two stages: a “fast recovery” stage that involves preferably “bulk” transfer of the first cluster metadata, following by a “fail back” stage that involves the transfer of the fixed content data. Upon receipt of the metadata from the second cluster, the repaired or replaced first cluster resumes authority for the clients irrespective of whether the fail back stage has completed or even begun. | 07-21-2011 |
| 20110010664 | FLEXIBLE REPORTING ON STORAGE RESOURCES - A method for providing flexible reporting for applications which utilize storage in at least one storage system comprises presenting a plurality of business views which aggregate application storage characteristics for a plurality of applications according to a reporting structure which is defined by a user, each of the business views being a hierarchical folder structure of the applications and a plurality of folders, wherein at least one folder in the hierarchical folder structure contains at least one of an application or another folder; for each of the business views, presenting the applications and folders as a plurality of nodes which are selectable by the user; and in response to a selection of one of the nodes from the plurality of business views and a report type specified by the user, generating a report based on the report type of the selected node, the report aggregating any of the application storage characteristics for the selected node according to the report type. | 01-13-2011 |
| 20110010445 | MONITORING APPLICATION SERVICE LEVEL OBJECTIVES - Embodiments of the invention provide a technique to model applications and storage used thereby, and to monitor application service level objectives. An aspect is directed to a method for managing a computer system which includes at least one host computer and at least one storage system which are connected via a network, the at least one host having an application running thereon. The method comprises modeling an application running on a host of a computer system as an application object, which includes associating storage utilized by the application with the application object; monitoring one or more application-based storage service level objectives for the storage utilized by the application, each service level objective being defined by a user to be threshold specific to the application; and alerting the user when any of the one or more service level objectives being monitored is violated. | 01-13-2011 |
| 20110010161 | MODELING COMPUTER APPLICATIONS AND STORAGE USED THEREBY - Embodiments of the invention provide a technique to model applications and storage used thereby. An aspect of the present invention is directed to a method for managing a computer system which includes at least one host computer and at least one storage system which are connected via a network, the at least one host computer having an application running thereon. The method comprises modeling an application running on a host of a computer system as an application object, which includes associating storage utilized by the application with the application object; tracking operation of the storage associated with the application object as a service being delivered by the storage to the application; and presenting result on the service being delivered by the storage to the application based on tracking the operation of the storage. | 01-13-2011 |
| 20100241820 | RECLAIMING STORAGE ON A THIN-PROVISIONING STORAGE DEVICE - A method, medium and apparatus for managing storage in a thin-provisioning storage device. The method includes ceasing to use storage on thinly provisioned storage delivered by a thin-provisioning storage device and notifying the thin-provisioning storage device of the unused storage. The method may further include reclaiming the unused storage in response to the notification. Alternatively, the notification may include recognizing the storage being freed and communicating the recognition to the storage device. In another form, the invention is a method, medium and apparatus for managing storage in a thin-provisioning storage device. This method includes delivering thinly provisioned storage and receiving notification that part of the thinly provisioned storage is no longer in use. The method may further include reclaiming that part of the thinly provisioned storage in response to the notification. Between receiving and reclaiming, the method may wait for a time to pass. | 09-23-2010 |
| 20100235807 | Method and system for feature automation - A feature automation process defines step-by-step instructions for involving automation engineers, defining, implementing and reviewing software test automation during the development of a feature or product. This process seamlessly integrates the roles of automation engineers and other resources into the software development life cycle (SDLC). An enterprise first creates a dedicated automation team. The feature automation team preferably works with a product/feature team to enable the latter team to better understand the roles of the automation engineers and to further facilitate transparency into the product/feature requirements, design and implementation activities. The feature automation process enables a quality assurance (QA) team to offload (to the feature automation team) the responsibility of writing test scripts, and for creating an automation framework, test designs, and for implementing and maintaining test code. The process ensures that all stakeholders are involved in the reviewing the automation framework and test design prior to test implementation to enhance the reusability of the framework and the stability of the test runs. | 09-16-2010 |
| 20090006888 | Fast primary cluster recovery - A cluster recovery process is implemented across a set of distributed archives, where each individual archive is a storage cluster of preferably symmetric nodes. Each node of a cluster typically executes an instance of an application that provides object-based storage of fixed content data and associated metadata. According to the storage method, an association or “link” between a first cluster and a second cluster is first established to facilitate replication. The first cluster is sometimes referred to as a “primary” whereas the “second” cluster is sometimes referred to as a “replica.” Once the link is made, the first cluster's fixed content data and metadata are then replicated from the first cluster to the second cluster, preferably in a continuous manner. Upon a failure of the first cluster, however, a failover operation occurs, and clients of the first cluster are redirected to the second cluster. Upon repair or replacement of the first cluster (a “restore”), the repaired or replaced first cluster resumes authority for servicing the clients of the first cluster. This restore operation preferably occurs in two stages: a “fast recovery” stage that involves preferably “bulk” transfer of the first cluster metadata, following by a “fail back” stage that involves the transfer of the fixed content data. Upon receipt of the metadata from the second cluster, the repaired or replaced first cluster resumes authority for the clients irrespective of whether the fail back stage has completed or even begun. | 01-01-2009 |
