Emc Corporation

Nasuni Corporation

Hitachi Data Systems Corporation

Applause App Quality, Inc.

Archivas, Inc.

Robert S Mason, Jr

Andres Rodriguez

David M Shaw

Kevin William Baughman

Stephen A Fridella

Adi Ofer

Yuval Ofek

Steven T McClure

Eitan Bachmat

Richard Wheeler

Preston F Crow

Jesse A Noller

Susan C Nagy

Natan Vishlitzky

Dan Arnon

Benjamin K D Bernhard

Haim Kopylovitz

Yechiel Yochai

Peng Yin

Tao Kai Lam

Russell Andrew Neufeld

Christopher S Lacasse

Matthew M McDonald

Akshay K Saxena

Daniel P Leprohon

Jonathan W Zaleski

Leonardo Covarrubias

A test automation system is provided that implements a DataTap service to capture underlying communications in a test environment or on a test platform. In some embodiments, the DataTap service can be configured as a passive data capture element. In various embodiments, passive data capture allows the system to record/mirror all data traffic flows associated with test execution without affecting the operation or execution of the tests. Some alternatives include functions to modify test traffic. In some examples, the system is configured to replay tests, modify test execution, modify test parameters, among other options. Various embodiments of the system allow new and updated feature sets to be integrated into existing test platforms without any changes in code, tests, or operation. Further, updates to test services become simple plug-in based features that, for example, provide assurance of zero impact on existing implementation.

Systems and methods for capturing test execution and communication

A test automation system is provided that enables 'codeless' code test generation and execution. Various embodiments allow users to create automation tests, sets variables in test scripts, set validation criteria, etc. all without having to write code for the operation being tested. In some examples, the system is configured to provide access to mobile device emulation based on selection of or from any number of mobile devices. By automatically defining a suite of tests that can be run on a mobile device population, automated testing can improve validation of any developed software, functionality, and identification of test failures over many existing approaches. Once the codeless tests are created on the system, they can be scheduled to run repeatedly, periodically, a-periodically, all without supervision. Any errors can be communicated to the user, with recommendations to resolve, re-test, among other options.

Systems and methods for automating test and validity

A versioned file system comprises a set of structured data representations. At a first time, an interface creates and exports to a cloud data store a first structured data representation corresponding to a first version of the local file system. The first structured data representation is an XML tree having a root element, one or more directory elements associated with the root element, and one or more file elements associated with a given directory element. Upon a change within the file system, the interface creates and exports a second structured data representation corresponding to a second version of the file system. The second structured data representation differs from the first structured data representation up to and including the root element of the second structured data representation. The interface continues to generate and export the structured data representations to the data store.

Versioned file system using structured data representations

An interface between an existing local file system and a data store generates and exports to the data store a versioned file system. The state of the local file system at a given point in time can be determined using the versioned file system. In operation, the interface creates and exports to the data store structured data representations, which correspond to versions of the local file system, as well as actual file system data that these structured data representations represent. A cache associated with the interface stores recently used data and metadata, as well as all write data and metadata waiting to be transferred to the data store. Prior to transfer, one or more data transformations may be applied to the data and metadata. In one embodiment, the data store comprises one or more cloud storage service providers. A content control system is used to configure and manage the interface.

Method and system for interfacing to cloud storage

A versioned file system comprising network accessible storage is provided. Aspects of the system include globally locking files or groups of files so as to better control the stored files in the file system and to avoid problems associated with simultaneous remote access or conflicting multiple access requests for the same files. A method for operating, creating and using the global locks is also disclosed. A multiprotocol global lock can be provided for filing nodes that have multiple network protocols for generating local lock requests.

Versioned file system with global lock

An archival storage cluster of preferably symmetric nodes includes a data protection management system that periodically organizes the then-available nodes into one or more protection sets, with each set comprising a set of n nodes, where 'n' refers to a configurable 'data protection level' (DPL). At the time of its creation, a given protection set is closed in the sense that each then available node is a member of one, and only one, protection set. When an object is to be stored within the archive, the data protection management system stores the object in a given node of a given protection set and then constrains the distribution of copies of that object to other nodes within the given protection set. As a consequence, all DPL copies of an object are all stored within the same protection set, and only that protection set. This scheme significantly improves MTDL for the cluster as a whole, as the data can only be lost if multiple failures occur within nodes of a given protection set. This is far more unlikely than failures occurring across any random distribution of nodes within the cluster.

Method for improving mean time to data loss (MTDL) in a fixed content distributed data storage

A versioned file system comprises a set of structured data representations. Each structured data representation corresponds to a version, and each version comprises a tree of write-once objects. Each version in the versioned file system has associated therewith a borrow window. When it is desired to reconstruct the file system to a point in time, i.e., to perform a 'restore,' it is only required to walk a single structured data representation. During a restore, metadata is pulled back from the cloud first, so users can see the existence of needed files immediately. The remainder of the data is pulled back from the cloud when the user goes to open the file. As a result, the entire file system is restored to a previous time nearly instantaneously. A fast restore is performed if an object being restored exists within a borrow window of the version from which the system is restoring.

Versioned file system with fast restore

A method of data sharing among multiple entities is provided. Each entity exports to a data store a structured data representation comprising a versioned file system local to that entity. The method begins by forming a sharing group that includes two or more entities. Sharing of the structured data representations by members of the sharing group is enabled. The filers use a single distributed lock to protect each version of the file system. This lock is managed to allow each filer access to the shared file system volume to create its new version. To share a fully-versioned file system, asynchronous updates at each of the filers is permitted, and each node is then allowed to 'push' its individual changes to the store to form the next version of the file system. A mechanism also may be used to reduce the period during which filers in the group operate under lock.

Versioned file system with sharing

A versioned file system comprises a set of structured data representations, such as XML. Each structured data representation corresponds to a 'version,' and each version comprises a tree of write-once objects rooted at a root directory manifest. Each version in the versioned file system has associated therewith a 'borrow window.' When it is desired to reconstruct the file system to a point in time (or, more generally, a given state), i.e., to perform a &#x201c;restore,&#x201d; it is only required to walk (use) a single structured data representation (a tree). During a restore, metadata is pulled back from the cloud first, so users can see the existence of needed files immediately. The remainder of the data is then pulled back from the cloud if/when the user goes to open the file. As a result, the entire file system (or any portion thereof) can be restored to a previous time nearly instantaneously. A &#x201c;fast&#x201d; restore is performed if an object being restored exists within a &#x201c;borrow window&#x201d; of the version from which the system is restoring. A version is pruned from the versioned file system by deleting all objects in the tree (associated with the version) that, at the time of pruning: (i) are not being lent to any other version within the borrow window of the version being pruned, and (ii) are not referenced in any other version whose borrow window is sufficiently large enough such that an object in the version could have been restored from that other version.

Versioned file system with pruning

Growing community of inventors

Uxbridge, MA, United States of America

Robert S Mason, Jr