Inventors list |
Assignees list |
Classification tree browser |
Top 100 Inventors |
Top 100 Assignees |
Aronovich
Anna Aronovich, Tel Aviv IL
| Patent application number | Description | Published |
|---|---|---|
| 20090324607 | Therapeutic Transplantation Using Developing, Human or Porcine, Renal or Hepatic, Grafts - A method of treating a renal, hepatic or enzyme-deficiency disorder in a subject in need thereof is disclosed. The method is effected by transplanting into the subject tissue derived from a human or porcine, kidney or liver, the kidney or liver being at a selected gestational stage. | 12-31-2009 |
Anna Aronovich, Rehovot IL
| Patent application number | Description | Published |
|---|---|---|
| 20100221270 | THERAPEUTIC TRANSPLANTATION USING DEVELOPING, HUMAN OR PORCINE, RENAL OR HEPATIC, GRAFTS - A method of treating a renal, hepatic or enzyme-deficiency disorder in a subject in need thereof is disclosed. The method is effected by transplanting into the subject tissue derived from a human or porcine, kidney or liver, the kidney or liver being at a selected gestational stage. | 09-02-2010 |
| 20110236405 | COAGULATION FACTOR MODULATION FOR CONTROLLING TRANSPLANT ORGAN SIZE - A method of modulating transplant organ size in a subject in need thereof is disclosed. The method comprising: (a) administering to the subject an agent capable of modulating an activity or expression of a coagulation factor or an effector thereof; and (b) transplanting the organ into the subject; thereby modulating the transplant organ size in the subject. | 09-29-2011 |
Anna Aronovich, Givataim IL
| Patent application number | Description | Published |
|---|---|---|
| 20100021433 | Disease treatment via developing non-syngeneic graft transplantation - A method of providing a pancreatic, lymphoid/hematopietic or pulmonary organ and/or tissue function to a mammalian subject is provided. The method comprises transplanting into the subject a developing mammalian pancreatic, lymphoid/hematopietic or pulmonary organ/tissue graft, respectively, thereby generating a functional pancreatic, lymphoid/hematopietic or pulmonary organ and/or tissue, respectively, for providing the pancreatic, lymphoid/hematopietic or pulmonary organ and/or tissue function, respectively, to the subject. | 01-28-2010 |
Lior Aronovich, Markham CA
| Patent application number | Description | Published |
|---|---|---|
| 20110040728 | REPLICATION OF DEDUPLICATED DATA - Various embodiments for replicating deduplicated data using a processor device are provided. A block of the deduplicated data, created in a source repository, is assigned a global block identification (id) unique in a grid set inclusive of the source repository. The global block id is generated using at least one unique identification value of the block, a containing grid of the grid set, and the source repository. The global block id is transmitted from the source repository to a target repository. If the target repository determines the global block id is associated with an existing block of the deduplicated data located within the target repository, the block is not received by the target repository during a subsequent replication process. | 02-17-2011 |
Lior Aronovich, Ramut-Gan IL
| Patent application number | Description | Published |
|---|---|---|
| 20090234821 | Systems and Methods for Efficient Data Searching, Storage and Reduction - Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space. | 09-17-2009 |
| 20090234855 | Systems and Methods for Efficient Data Searching, Storage and Reduction - Systems and methods enabling search of a repository for the location of data that is similar to input data, using a defined measure of similarity, in a time that is independent of the size of the repository and linear in a size of the input data, and a space that is proportional to a small fraction of the size of the repository. The similar data segments thus located are further analyzed to determine their common (identical) data sections, regardless of the order and position of the common data sections in the repository and input, and in a time that is linear in the segment size and in constant space. | 09-17-2009 |
Lior Aronovich, Toronto CA
| Patent application number | Description | Published |
|---|---|---|
| 20120131038 | FACILITATION OF SEARCH, LIST, AND RETRIEVAL OPERATIONS ON PERSISTENT DATA SET USING DISTRIBUTED SHARED MEMORY - Various embodiments for facilitating search, list and retrieval operations on a persistent data set using a distributed shared memory (DSM) by a processor device are provided. In one exemplary embodiment, a DSM is used to store the data structures in a cluster shared memory, such that updates, deletions and insertions are applied to both the persistent data set and the DSM, and search, list and retrieval operations are processed directly from the DSM. A data structure in the persistent data set is stored in two separate DSM pages: a first page includes an identifying search key of the data structure, the search key also pointing to a location of the data structure in the storage. A second page includes the updatable properties of the data structure. A DSM storing the data structures' pages is organized as a two-row matrix. | 05-24-2012 |
| 20120131240 | SLIDING WRITE WINDOW MECHANISM FOR WRITING DATA - Various embodiments writing data are provided. In one embodiment, the data arranged in a plurality of write intervals is loaded into a plurality of buffers, the totality of the plurality of buffers configured as a sliding write window mechanism adapted for movement to accommodate the write intervals. The data may reach the storage system out of a sequential order, and by loading it appropriately into the said buffers the data is ordered sequentially before it is written to the storage media. When a commencing section of the sliding write window is filled up with written data, this section is flushed to the storage media, and the window slides forward, to accommodate further data written by the writers. The writers are synchronized with the interval reflected by the current position of the sliding write window, and they send data to be written only where this data fits into the current interval of the window. | 05-24-2012 |
| 20120143832 | DYNAMIC REWRITE OF FILES WITHIN DEDUPLICATION SYSTEM - Various embodiments for rewriting data in a deduplication storage environment by a processor device are provided. A dynamic layer above a sequential deduplication file system (denoted as DFS) implements the rewrite functionality. A user file is composed of one or more DFS files. As incoming data is written into a user file, the data is written by the dynamic layer sequentially into DFS files, created one by one. For each user file this dynamic layer creates and maintains a dynamic metadata file, in a regular, non deduplicated file system. This metadata file contains entries pointing to sections of DFS files. | 06-07-2012 |
| 20120143835 | EFFICIENT CONSTRUCTION OF SYNTHETIC BACKUPS WITHIN DEDUPLICATION STORAGE SYSTEM - Various embodiments are provided for facilitating construction of a synthetic backup in a deduplication storage system. In one embodiment, a deduplication storage system enables new input data to be deduplicated with data of synthetic backups already constructed, and for this purpose efficiently calculates deduplication digests for synthetic backups being constructed, based on already existing digests of data referenced by the synthetic backups. For each input data segment of the plurality of input data segments of a synthetic backup being constructed, a plurality of deduplication digests of stored data segments, referenced by the input data segment, is retrieved from an index. Each input data segment is partitioned into each of a plurality of fixed-sized data sub-segments. A calculation is performed producing a deduplication digest for a data sub-segment, where the calculation is based on the retrieved deduplication digests of the plurality of stored data sub-segments referenced by the input data sub-segment. | 06-07-2012 |
| 20120144135 | REDUCTION OF COMMUNICATION AND EFFICIENT FAILOVER PROCESSING IN DISTRIBUTED SHARED MEMORY-BASED APPLICATION - Various embodiments for reducing communication between cluster nodes and optimizing failover processing in a distributed shared memory (DSM)-based application by at least one processor device are provided. In one embodiment, for a data structure operable on a DSM, a read-mostly portion is maintained in a single copy sharable between the cluster nodes while an updatable portion is maintained in multiple copies, each of the multiple copies dedicated to a single cluster node. | 06-07-2012 |
| 20120144149 | CAPACITY MANAGEMENT IN DEDUPLICATION STORAGE SYSTEMS - Various embodiments for capacity management in a deduplication computing storage environment by a processor device are provided. A deduplication storage capacity is estimated as a function of an expected deduplication ratio, the expected deduplication ratio being a combined average of a current deduplication ratio and a configured deduplication ratio, the current deduplication ratio depending on the data currently stored in the deduplication storage, and the configured deduplication ratio being an estimate made at a configuration stage of the deduplication computing storage environment. | 06-07-2012 |
Lior Aronovich, Toronot CA
| Patent application number | Description | Published |
|---|---|---|
| 20120144123 | READ-AHEAD PROCESSING IN NETWORKED CLIENT-SERVER ARCHITECTURE - Various embodiments for read-ahead processing in a networked client-server architecture by a processor device are provided. Read messages are grouped by a plurality of unique sequence identifications (IDs), where each of the sequence IDs corresponds to a specific read sequence, consisting of all read and read-ahead requests related to a specific storage segment that is being read sequentially by a thread of execution in a client application. The storage system uses the sequence id value in order to identify and filter read-ahead messages that are obsolete when received by the storage system, as the client application has already moved to read a different storage segment. Basically, a message is discarded when its sequence id value is less recent than the most recent value already seen by the storage system. The sequence IDs are used by the storage system to determine corresponding read-ahead data to be loaded into a read-ahead cache. | 06-07-2012 |