Patent application number | Description | Published |
20090249298 | Evaluation of Software based on Change History - A method for software processing includes obtaining change information, which records changes that have been performed in respective locations in software code. The change information is processed so as to assign to at least some of the locations respective priorities, which are indicative of respective likelihoods that the locations contain program faults. The at least some of the locations are presented to a user in accordance with the assigned priorities. | 10-01-2009 |
20100325376 | Apparatus and Method to Maintain Write Operation Atomicity Where a Data Transfer Operation Crosses a Data Storage Medium Track Boundary - A method to maintain write operation atomicity where a write operation crosses a data storage medium track boundary. The method supplies a storage controller comprising a host adapter, a processor, and a NVS. The primary host adapter receives from a host computer a write request and data. The method determines if the write request will cross a data storage medium track boundary. If the write request will cross a data storage medium track boundary, the method indicates to the host adapter that the write request comprises a two-track transfer, and writes the data to the primary NVS as the data is received. If the host computer fails prior to providing all the data to the storage controller, the method discards the data written to the NVS to ensure write operation atomicity. | 12-23-2010 |
20110055499 | Managing Backup Relationships in a Data Storage System - A method for re-establishing a backup relationship between first and second volumes associated with one or more storage media in a data storage system is provided. The method comprises storing first information for preserving the backup relationship, in response to or in advance of receiving a request to terminate the backup relationship; recording changes to the first or second volumes that occur subsequent to terminating the backup relationship; and re-establishing the backup relationship between the first and second volumes according to the first information such that the first and second volumes are synchronized by merging the recorded changes with the first or second volumes. | 03-03-2011 |
20110060759 | Data De-Duplication in a Distributed Network - A computer-implemented method for efficient data storage is provided. A first storage medium associates data stored on one or more data storage media with a unique identification value (ID) for the purpose of determining de-duplication status of the data. In response to receiving a request to read the data from a logical address, the first storage medium retrieves the data from a second storage medium based on the unique ID. In response to receiving a request to write the data to a logical address, the one or more data storage media store at least one copy of the data based on the de-duplication status of the data. | 03-10-2011 |
20110191557 | SYNCHRONIZING DATA STORAGE SYSTEMS IN A DATA STORAGE ENVIRONMENT - A method for synchronizing data storage systems is provided. The method comprises designating a relationship between a first data storage system and a second data storage system, such that data stored in the first data storage system is copied to the second data storage system, in response to determining that the data stored in the first data storage system has been modified; receiving a first request to modify data stored in a first data block of a first storage volume in the first data storage system, wherein the data block is modified according to the first request; determining that the first data block has not been successfully synchronized when the modified data stored in the first data block is not copied to the second data storage system; and executing a process to retry synchronization of the first data block until synchronization of the first data block is successful, without suspending the relationship while the process is executed. | 08-04-2011 |
20140059018 | DATA DE-DUPLICATION IN A DISTRIBUTED NETWORK - A computer-implemented method for efficient data storage is provided. A first storage medium associates data stored on one or more data storage media with a unique identification value (ID) for the purpose of determining de-duplication status of the data. In response to receiving a request to read the data from a logical address, the first storage medium retrieves the data from a second storage medium based on the unique ID. In response to receiving a request to write the data to a logical address, the one or more data storage media store at least one copy of the data based on the de-duplication status of the data. | 02-27-2014 |
20140136804 | MANAGING BACKUP RELATIONSHIPS IN A DATA STORAGE SYSTEM - A method for re-establishing a backup relationship between first and second volumes associated with one or more storage media in a data storage system is provided. The method comprises storing first information for preserving the backup relationship, in response to or in advance of receiving a request to terminate the backup relationship; recording changes to the first or second volumes that occur subsequent to terminating the backup relationship; and re-establishing the backup relationship between the first and second volumes according to the first information such that the first and second volumes are synchronized by merging the recorded changes with the first or second volumes. | 05-15-2014 |
Patent application number | Description | Published |
20150089695 | Grape plant named 'ARRATWENTYSEVEN' - A new distinct variety of grapevine named ARRATWENTYSEVEN abundantly forms attractive large crisp, meaty & juicy berries with a small seed trace and with a blue/black skin coloration; in large clusters which display a naturally sweet flavor. The fruit commonly is ready for harvesting during August in San Joaquin Valley of Central California, U.S.A, and displays good eating qualities as a table grape. The fruit firmness renders the fruit well amenable for handling, shipping, and storage | 03-26-2015 |
20150181785 | Grape plant named 'ARRATWENTYEIGHT' - A new distinct variety of grapevine named ‘ARRATWENTYEIGHT’ abundantly forms attractive large firm and meaty seedless berries with a red skin coloration; in medium-to-large clusters which display natural flavor. The fruit commonly is ready for harvesting during October in San Joaquin Valley of Central California, U.S.A, and displays good eating qualities as a table grape. The fruit firmness renders the fruit well amenable for handling, shipping, and storage. | 06-25-2015 |
20150181786 | Grape plant named 'ARRATWENTYNINE' - A new distinct variety of grapevine named ‘ARRATWENTYNINE’ abundantly forms attractive large firm and meaty seedless berries with a red skin coloration; in medium-large clusters which display a sweet apple flavor. The fruit commonly is ready for harvesting during June in San Joaquin Valley of Central California, U.S.A, and displays good eating qualities as a table grape. The fruit firmness renders the fruit well amenable for handling, shipping, and storage. | 06-25-2015 |
20150181787 | Grape plant named 'ARRATWENTYFIVE' - A new distinct variety of grapevine named ‘ARRATWENTYFIVE’ abundantly forms attractive medium firm and meaty seedless berries with a yellow/green skin coloration; in medium-to-large clusters which display a sweet Muscat flavor. The fruit commonly is ready for harvesting during October in San Joaquin Valley of Central California, U.S.A, and displays good eating qualities as a table grape. The fruit firmness renders the fruit well amenable for handling, shipping, and storage. | 06-25-2015 |
20150271972 | Grape plant named 'ARRATWENTYTWO' - A new distinct variety of grapevine named ‘ARRATWENTYTWO’ abundantly forms attractive small berries having a very small rudiment and a red skin coloration in medium clusters. The fruit displays a natural flavor and is crispy & meaty in texture. The fruit commonly is ready for harvesting during August in San Joaquin Valley of Central California, U.S.A, and displays good eating qualities as a table grape. The fruit firmness renders the fruit well amenable for handling, shipping, and storage. | 09-24-2015 |
20150271974 | Grape Plant Named 'ARRATHIRTY' - A new distinct variety of grapevine named ‘ARRATHIRTY’ abundantly forms attractive small-to-medium firm and meaty seedless berries with a yellow/green skin coloration; in medium-to-large clusters which display a sweet natural flavor. The fruit commonly is ready for harvesting during June in San Joaquin Valley of Central California, U.S.A, and displays good eating qualities as a table grape. The fruit firmness renders the fruit well amenable for handling, shipping, and storage. | 09-24-2015 |
Patent application number | Description | Published |
20130311746 | SHARED MEMORY ACCESS USING INDEPENDENT MEMORY MAPS - A method includes defining a first mapping, which translates between logical addresses and physical storage locations in a memory with a first mapping unit size, for accessing the memory by a first processing unit. A second mapping is defined, which translates between the logical addresses and the physical storage locations with a second mapping unit size that is different from the first mapping unit size, for accessing the memory by a second processing unit. Data is exchanged between the first and second processing units via the memory, while accessing the memory by the first processing unit using the first mapping and by the second processing unit using the second mapping. | 11-21-2013 |
20140089450 | Look-Ahead Handling of Page Faults in I/O Operations - A method for data transfer includes receiving in an input/output (I/O) operation a first segment of data to be written to a specified virtual address in a host memory. Upon receiving the first segment of the data, it is detected that a first page that contains the specified virtual address is swapped out of the host memory. At least one second page of the host memory is identified, to which a second segment of the data is expected to be written. Responsively to detecting that the first page is swapped out and to identifying the at least one second page, at least the first and second pages are swapped into the host memory. After swapping at least the first and second pages into the host memory, the data are written to the first and second pages. | 03-27-2014 |
20140089451 | Application-assisted handling of page faults in I/O operations - A method for data transfer includes receiving in an operating system of a host computer an instruction initiated by a user application running on the host processor identifying a page of virtual memory of the host computer that is to be used in receiving data in a message that is to be transmitted over a network to the host computer but has not yet been received by the host computer. In response to the instruction, the page is loaded into the memory, and upon receiving the message, the data are written to the loaded page. | 03-27-2014 |
20140089528 | Use of free pages in handling of page faults - A method for data transfer includes receiving in an input/output (I/O) operation data to be written to a specified virtual address in a host memory. Upon receiving the data, it is detected that a first page that contains the specified virtual address is swapped out of the host memory. Responsively to detecting that the first page is swapped out, the received data are written to a second, free page in the host memory, and the specified virtual address is remapped to the free page. | 03-27-2014 |
20140122828 | Sharing address translation between CPU and peripheral devices - A method for memory access includes maintaining in a host memory, under control of a host operating system running on a central processing unit (CPU), respective address translation tables for multiple processes executed by the CPU. Upon receiving, in a peripheral device, a work item that is associated with a given process, having a respective address translation table in the host memory, and specifies a virtual memory address, the peripheral device translates the virtual memory address into a physical memory address by accessing the respective address translation table of the given process in the host memory. The work item is executed in the peripheral device by accessing data at the physical memory address in the host memory. | 05-01-2014 |
20140269271 | METHODS AND SYSTEMS FOR NETWORK CONGESTION MANAGEMENT - Methods and systems are disclosed for network congestion management. The methods and systems receive a first packet complying with a first network protocol comprising a first congestion indicator representative of a presence or absence of network congestion and further comprising a first set of data associated with a second network protocol, and provide an indication of the presence or absence of network congestion generated based, at least in part, on the first congestion indicator. The methods and systems also receive a first packet complying with a first network protocol comprising a first set of data associated with a second network protocol, and output a second packet complying with the first network protocol comprising a first congestion indicator representative of a presence of network congestion. | 09-18-2014 |
20150029853 | CONGESTION CONTROL ENFORCEMENT IN A VIRTUALIZED ENVIRONMENT - In a data network congestion control in a virtualized environment is enforced in packet flows to and from virtual machines in a host. A hypervisor and network interface hardware in the host are trusted components. Enforcement comprises estimating congestion states in the data network attributable to respective packet flows, recognizing a new packet that belongs to one of the data packet flows, and using one or more of the trusted components and to make a determination based on the congestion states that the new packet belongs to a congestion-producing packet flow. A congestion-control policy is applied by one or more of the trusted components to the new packet responsively to the determination. | 01-29-2015 |
20150288624 | LOW-LATENCY PROCESSING IN A NETWORK NODE - A method in a network node that includes a host and an accelerator, includes holding a work queue that stores work elements, a notifications queue that stores notifications of the work elements, and control indices for adding and removing the work elements and the notifications to and from the work queue and the notifications queue, respectively. The notifications queue resides on the accelerator, and at least some of the control indices reside on the host. Messages are exchanged between a network and the network node using the work queue, the notifications queue and the control indices. | 10-08-2015 |
20150293881 | NETWORK-ATTACHED MEMORY - A method for memory access is applied in a cluster of computers linked by a network. For a given computer, a respective physical memory range is defined including a local memory range within the local RAM of the given computer and a remote memory range allocated to the given compute within the local RAM of at least one other computer in the cluster, which is accessible via the network using the network interface controllers of the computers. When a memory operation is requested at a given address in the respective physical memory range, the operation is executed on the data in the local RAM of the given computer when the data at the given address are valid in the local memory range. Otherwise the data are fetched from the given address in the remote memory range to the local memory range before executing the operation on the data. | 10-15-2015 |
Patent application number | Description | Published |
20100251144 | THIRD-PARTY-SECURED ZONES ON WEB PAGES - A computer-implemented method is provided, including storing, in an authentication server system, unique identification codes assigned to respective entities. Secure zone HTML code elements are provided for placement on a web page in association with respective identifiers of the entities, the HTML code elements specifying (a) respective ones of the codes for the respective associated identifiers of the entities, and (b) creation of respective inline frames on the page. Upon opening of the page, execution of a server-side program is triggered at the system, which program receives the codes specified by the code elements. The received codes are authenticated by comparing the received codes to the codes stored in the system. For each match found between one of the received codes and one of the stored codes, the system delivers web content to or via the one of the inline frames associated with the one of the received codes. | 09-30-2010 |
20120030732 | THIRD-PARTY-SECURED ZONES ON WEB PAGES - There is provided a method that includes storing a plurality of image elements of a seal media object in respective files in an authentication server system, each of the image elements is selected from the group consisting of: a layer of the seal media object, a still image portion of the seal media object, and a moving image portion of the seal media object. Authenticating at least a portion of a web page, upon opening of the web page in a browser, by the authentication server system. Delivering to the browser, by the authentication server system, files for assembly and display of the image elements on the web page as the seal media object upon authenticating. | 02-02-2012 |