Abstract: Systems and methods for automated firmware update with rollback are described herein. The systems include a plurality of storage zones, each storage zone including a plurality of storage nodes, each storage node including a plurality of storage media. The method includes monitoring storage system activity and parameters and maintaining a data storage system usage and parameter database containing system activity information. When a firmware update is available, data storage system activity is evaluated. Storage nodes needing the firmware update are identified. The firmware update is run on available storage nodes identified as needing the firmware update. The impact of the firmware update is evaluated and a rollback of the firmware update is initiated on all firmware updated storage nodes when parameter variations are significant and/or result in degraded performance.

Abstract: Systems and methods for storing data in a data storage system that allows dynamic context-based data protection and distribution are disclosed. The method includes receiving a storage request and evaluating whether a storage policy is specified in the storage request. When the storage request specifies a storage policy, the data is stored according to the specified policy. When the storage request does not specify a storage policy, meta data and/or the data item itself may be evaluated to identify a storage policy. When a storage policy has been identified, store the data is stored according to the identified policy. When a storage policy has not been specified and cannot be identified, an error is returned.

Abstract: A failure resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.

Abstract: Systems and methods for data replication in a data storage system having a disjointed network are described herein. The data storage system includes a plurality of clusters each having at least one stationary zone. The data storage system further includes at least one movable zone. Each zone has a plurality of storage nodes, and each storage node has a plurality of storage devices. The system provides for replication according to policies associated with data objects such that data items are stored among a plurality of zones. Movable zone that are disconnected from and reconnected to the other zones and clusters in the storage system are supported.

Abstract: Systems and methods for automated firmware update with rollback are described herein. The systems include a plurality of storage zones, each storage zone including a plurality of storage nodes, each storage node including a plurality of storage media. The method includes monitoring storage system activity and parameters and maintaining a data storage system usage and parameter database containing system activity information. When a firmware update is available, data storage system activity is evaluated. Storage nodes needing the firmware update are identified. The firmware update is run on available storage nodes identified as needing the firmware update. The impact of the firmware update is evaluated and a rollback of the firmware update is initiated on all firmware updated storage nodes when parameter variations are significant and/or result in degraded performance.

Abstract: Systems and methods for storing data in a data storage system that allows dynamic context-based data protection and distribution are disclosed. The method includes receiving a storage request and evaluating whether a storage policy is specified in the storage request. When the storage request specifies a storage policy, the data is stored according to the specified policy. When the storage request does not specify a storage policy, meta data and/or the data item itself may be evaluated to identify a storage policy. When a storage policy has been identified, store the data is stored according to the identified policy. When a storage policy has not been specified and cannot be identified, an error is returned.

Abstract: Systems and methods for dynamic context based data protection and distribution in which data replication in a multi-zone storage system automatically changes based on historical storage trends and/or external information obtained from third party information sources is described herein. The methods include monitoring third party information sources and evaluating a correlation between event data from the third party information sources and key words that are user provided and/or system derived. A correlation between the event data and data storage history may be evaluated. A storage policy is derived based on the results of the correlation evaluation(s). The derived storage policy and corresponding key words are stored in a database.

Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.

Abstract: A failure resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.

Abstract: A failure resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.

Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.

Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.

Abstract: A failure resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects calculated. Reassembly instructions are created for the data item. The data objects and parity objects are spread across all nodes and zones in the storage system. Reassembly instructions are also spread across the zones. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions. This provides for data resiliency while keeping the amount of storage space required relatively low.

Abstract: A resilient distributed replicated data storage system is described herein. The storage system includes zones that are independent, and autonomous from each other. The zones include nodes that are independent and autonomous. The nodes include storage devices. When a data item is stored, it is partitioned into a plurality of data objects and a plurality of parity objects are calculated. Reassembly instructions are created for the data item. The data objects, parity objects and reassembly instructions are spread across nodes and zones in the storage system according to a policy for the data item. When a zone is inaccessible, a virtual zone is created and used until the intended zone is available. When a read request is received, the data item is prepared from the lowest latency nodes according to the reassembly instructions, and a virtual zone is accessed in place of a real zone when the real zone is inaccessible.

Abstract: In a data storage system, failed disk drives are switched temporarily off-line to be quickly rebuilt by executing a journaling/rebuild algorithm which tracks the updates to the failed disk drive into a journal structure created in a non-volatile memory. The journal information is used to update those data sections of the disk drive affected by updates after the disk drive is failed. The journal information is stored in bit maps indicating which portions of the disk drive have been updated with new data while the disk was failed. As an option, the system permits verification of data consistency on the data section of the disk drive which have not been affected by the updates. The journaling/rebuild of failed disks is applicable, among others, to RAID data storage systems.

Abstract: In a data storage system, failed disk drives are switched temporarily off-line to be quickly rebuilt by executing a journaling/rebuild algorithm which tracks the updates to the failed disk drive into a journal structure created in a non-volatile memory. The journal information is used to update those data sections of the disk drive affected by updates after the disk drive is failed. The journal information is stored in bit maps indicating which portions of the disk drive have been updated with new data while the disk was failed. As an option, the system permits verification of data consistency on the data section of the disk drive which have not been affected by the updates. The journaling/rebuild of failed disks is applicable, among others, to RAID data storage systems.

Abstract: A system for detecting the precise location of a reflective element in a video field wherein the determined location is subsequently utilized to generate a graphic to be added to a foreground video scene utilizing compositing techniques. A signal is generated specifying a precise point in the foreground video scene identifying a position of a reflective element. The signal is derived from a peak detector which generates a pulse whenever the signal input to the pulse detector is at a maximum level for the current video field being scanned so long as the scan is not in the blanking area. The pulse is used by a vertical line counter and a horizontal pixel counter which specify the line and pixel on a horizontal scan line within a video field representing the position of the highest peak generated within that field. Graphics can be repositioned or lines or other graphic elements can be generated which track the movement of the reflective element.

Abstract: A system which allows the weather television personalities to move and place computer generated symbols onto a weather map background image using only his hand or finger as a pointing device. The weather forecaster is generally in front of a blue screen and must make it appear that he can actually see the weather map behind himself. In the video frame, which is raster scanned, the hand pointing to the object to be moved or placed translates to the first object in the raster (on the left) or the last object in the raster (on the right). The present invention is a method and apparatus which identifies the rightmost or leftmost point in the raster and communicates this information to a graphics computer as x-y coordinate data. The data is utilized by the computer to place a movable graphic symbol at the weather forecaster's fingertip allowing him to move and place the symbol.

Abstract: A man to machine interface for the control of video or motion picture camera movement for use with a camera aiming system which can reproduce a specific camera movement any number of times. The interface moves the camera in the pan or tilt axis giving an operator a natural control feel while actually driving the camera movement with a motor drive. A shaft encoder detects the velocity of the motor drive and stores such information over time in a memory. The data stored in the memory may be read out at a later time and used by the motor drive to replicate the movement of the camera.