Exagrid Systems, Inc.

Data General Corporation

Sun Microsystems, Inc.

Emc Corporation

Mark Bennett Hecker

Adrian T VanderSpek

David G Therrien

Thomas G Hansen

Lucas H Makosky

Stephen A Smith

Daniel P Martinelli

Ashok T Ramu

Yee-ching Chao

Robert N Murdoch

Jamey C Poirier

Thomas J Bakerman

Jefferson A Kita

Kristian R Cibulskis

Rajesh Girish Parekh

Thomas J Gillispie

Peter Watkins

William Andrews

Robert W Goodman

Andrew H French

Chandra R Vora

Donald C Wiser

Nabil Takla

Nathaniel W Turner

Brian Rickman

Raymond Chu

Alex Pientka

Michael Carleton

Luke Makosky

Sandra C Scott

Stephen Smith

Adrian Vanderspek

Yee-Ching Chao

Adrian T Vanderspek

A method, a system, and a computer program product for protection and recovery of backup storage systems from ransomware attacks. A request to modify data stored in a storage system is received. The storage system includes at least one component configured to store the deduplicated data. An acknowledgement of the received request is generated. The acknowledgement indicates that the data stored in the at least one component and identified in the received request was modified. Modification of the data stored in the at least one component and identified in the received request for a predetermined period of time is prevented.

Protection and recovery of backup storage systems from ransomware attacks

A system, a method and a computer program product for storing data, which include receiving a data stream having a plurality of transactions that include at least one portion of data, determining whether at least one portion of data within at least one transaction is substantially similar to at least another portion of data within at least one transaction, clustering together at least one portion of data and at least another portion of data within at least one transaction, selecting one of at least one portion of data and at least another portion of data as a representative of at least one portion of data and at least another portion of data in the received data stream, and storing each representative of a portion of data from each transaction in the plurality of transactions, wherein a plurality of representatives is configured to form a chain representing the received data stream.

Systems and methods for version chain clustering

A system, a method, and a computer program product for performing deduplication of data using a scalable deduplication grid are disclosed. A listing of a plurality of zone stamps is generated, where each zone stamp represents a zone in the plurality of zones in a data stream. The listing contains a logical arrangement of the plurality of zone stamps obtained from each storage location and being accessible by a plurality of servers. A first zone stamp in the listing is compared to a second zone stamp in the listing. The first and second zones are delta-compressed based on a determination that the first zone stamp is substantially similar to the second zone stamp. A server is selected to perform the comparison and delta-compression.

Scalable grid deduplication

A method, a system, and a computer-implemented method for performing multi-level deduplication of data are disclosed. A zone stamp is generated for each zone in a plurality of zones contained in at least one data stream. The zone stamp is compared to another zone stamp. The zone stamp and another zone stamp represent zones in the plurality of zones. The comparison is performed for zones at corresponding zone levels based on a determination that a zone stamp of a zone of a preceding zone level is not similar to another zone stamp of another preceding zone level. The zone at the preceding zone level includes at least one zone of a next zone level having a size smaller than or equal to a size of the zone of the preceding zone level. The zone and another zone are deduplicated based on a determination that the zone stamp is similar to another zone stamp.

Multi-level deduplication

A system, a method, and a computer program product for delta version clustering and re-anchoring are provided. A first anchor having a plurality of delta-compressed versions of data dependent on the first anchor is generated. The first anchor and the plurality of delta-compressed versions form a cluster. A second anchor is generated. The first anchor is replaced with the second anchor. The replacing includes re-computing at least one delta-compressed version in the plurality of delta-compressed versions to be dependent on the second anchor. The second anchor replaces the first anchor as an anchor of the cluster.

Delta version clustering and re-anchoring

A code generator utilizes a 'generated_source' directory to store corresponding machine-generated software code. A 'modified_source' directory stores user-written modifications associated with software generated by the code generator. During code generation, the code generator checks the modified_source directory for a class presently being generated by the code generator. If there are no user modifications (stored in the modified_source directory) associated with the class being processed, the code generator creates an implementation of the class. If the modified_source directory contains an implementation of the class being processed, the code generator creates an implementation of a base class for the class being processed. The base class is created in the generated_source directory, preserving the class created by the user.

Methods and apparatus to preserve software modifications

Application code maintenance often imposes rebuilding and/or a patch kit update from a source code vendor. Users of such applications often find such conventional rebuilds and install efforts intrusive. An extensible object-relational (O-R) model operable for dynamic additions to an existing baseline of modeled data specifications mitigates interim patches and builds by employing a scripted modeling form and a corresponding relational form. The scripted modeling form, such as an XML file, is readily modifiable from existing data specifications, such as those driven by a recognized standard, while the relational form is seamlessly updated within an existing application environment without requiring rebuilding or patch kits to implement. The extensible O-R model defines data characteristics of data specifications, and the relational model is updated by instantiating an object or entry into the modeled relational specifications based on the extensible O-R model. In this manner, an incremental update to a set of relational specifications implements an addition or modification to a data specification rather than requiring a more global build, update, or install kit.

System and method for an extensible metadata driven application framework

A shared memory clean application system assigns a process name to each process operating within a shared memory region and stores that name in shared memory elements used by that process. If there are more processes sharing an element than that element has space to keep the names, an overflow element is created and linked to the shared element. When a new element is requested and no free elements are available, the invention selects an element, clears its use count, and then reviews all the names in that shared element array to see if they match existing valid processes. If an existing process is found that matches a name in the array, the use count is incremented for that process. If no existing process match is found for a process name in the element array, that name is deleted from the array. If overflow elements exist, they are also cleared of names that do not match, or deallocated entirely if the review indicates there is an overflow element that no longer has process names associated with it.

Method and apparatus for shared memory cleanup

A media access scheduling system that allows concurrent users to access shared media by having each user decide, as it gets access to the media, whether it is the best candidate for the use of the media: if it is, it proceeds to use the media; if it is not, it does not access the media, but instead releases access reservation and waits for a time when it may be the best candidate. In a preferred embodiment, the determining factor for the best candidate is whether the media needs to be repositioned or setup. If the media is positioned where the candidate wants it to be, no positioning or setup is required, and the user declares itself to be the best choice. If the media must be repositioned or setup, then there is probably another user process which would be a better candidate. To identify when a user is finished with the media and repositioning or setup is warranted, each user program refers to and maintains an access time in a globally visible place. If some period of time has elapsed since the previous access to the volume, it is likely that the previous user program has finished, and a candidate which requires repositioning should proceed. To prevent users from waiting indefinitely, each candidate keeps track of the time it has spent waiting, and upon reaching some predetermined limit of continuous waiting, accesses the media regardless of whether or not it needs to reposition.

Media access scheduler method and apparatus

A data processing system which includes a central processor unit which has an arithmetic logic unit (ALU) for performing fixed point arithmetic operations and a separate floating point unit (FPU) for performing floating point operations and which uses multi-level microcode architecture wherein each unit has its own control store (a 'horizontal' store) which responds to addresses of execution control signals supplied thereto from a common control store (a 'vertical' store) to produce horizontal microinstructions for performing ALU and FPU operations, respectively. Selected ones of such addresses are recognized for ALU operations by the CPU control store only, other selected ones are recognized for FPU operations by the FPU control store only, while still other selected ones are recognized for both ALU and FPU operations by both control stores so that such operations can be performed simultaneously in parallel.

Data processing system having unique multilevel microcode architecture

A data processing system which includes a central processing unit (CPU) to which is connected an I/O bus and a memory bus is disclosed. The data processing system further includes an I/O controller and a video control section. The I/O controller includes a terminal control section which is connected to the CPU through an RS232 Cable, an I/O control section which is connected to the I/O bus over a single line and a single processor for managing both the terminal control section and the I/O control section. The I/O control section includes a plurality of interface and control subsystems each for use with a separate peripheral device and an I/O bus interface and control subsystem. The terminal control section includes a video control section interface through which data is sent directly to the video control section over a separate line, and a keyboard interface for interfacing the terminal control section to a keyboard. The video control section includes a video memory and a microprocessor which are both connected to the memory bus.

Data processing system with unified I/O control and adapted for display

A carry-save propagate adder employing two exclusive-OR blocks, a multiplexer block for selecting between a carry propagate input or a carry-save input, and a further multiplexer block for supplying as a carry-save output either the carry-save input or one of the data inputs.

Carry-save propagate adder

Growing community of inventors

Northborough, MA, United States of America

Mark Bennett Hecker