Abstract: Provided are a system and program for managing operation requests using different resources. In one embodiment, a first queue is provided for operations which utilize a first resource of a first and second resource. A second queue is provided for operations which utilize the second resource. An operation is queued on the first queue until the first resource is acquired. The first resource is released if the second resource is not also acquired. The operation is queued on the second queue when the first resource is acquired but the second resource is not. In addition, the first resource is released until the operation acquires both the first resource and the second resource.

Abstract: Methods of the invention comprise methods and devices for nucleic acid sequence determination. Generally, the invention relates to preparing a substrate for sequencing a target nucleic acid.

Abstract: A multi-core processor with a shared physical memory is described. In an embodiment a sending core sends a memory write request to a destination core so that the request may be acted upon by the destination core as if it originated from the destination core. In an example, a data structure is configured in the shared physical memory and mapped to be accessible to the sending and destination cores. In an example, the shared data structure is used as a message channel between the sending and destination cores to carry data using the memory write request. In an embodiment a notification mechanism is enabled using the shared physical memory in order to notify the destination core of events by updating a notification data structure. In an example, the notification mechanism triggers a notification process at the destination core to inform a receiving process of a notification.

Abstract: A method of optimizing code which invokes methods on a system across an interface is described. High level information relating to the system is accessed and this information is used in performing code transformations in order to optimize the code.

Abstract: Methods of memory management are described which can accommodate non- maskable failures in pages of physical memory. In an embodiment, when an impending non-maskable failure in a page of memory is identified, a pristine page of physical memory is used to replace the page containing the impending failure and memory mappings are updated to remap virtual pages from the failed page to the pristine page. When a new page of virtual memory is then allocated by a process, the failed page may be reused if the process identifies that it can accommodate failures and the process is provided with location information for impending failures. In another embodiment, a process may expose information on failure-tolerant regions of virtual address space such that a physical page of memory containing failures only in failure-tolerant regions may be used to store the data instead of using a pristine page.

Abstract: A transactional memory system is described for reporting memory access violations which occur when memory accesses made from instructions within a transaction conflict with memory accesses to the same memory location made from a non-transactional instruction. In an embodiment this is achieved by creating two mappings of a physical heap being used by a thread. The thread (which may be part of a multi-threaded process) comprises instructions for both transactional and non-transactional accesses to the physical heap which may execute concurrently as part of that thread. One of the mappings is used for non-transactional memory accesses to the physical heap. The other mapping is used for transactional memory accesses to the physical heap. Access permissions associated with the mappings are controlled to enable attempted memory access violations to be detected and reported.

Abstract: A data transfer application implemented in a computational device receives a request to copy a plurality of storage volumes that form a consistency group. A determination is made that a first storage volume of the plurality of storage volumes is more likely to be written into than a second storage volume of the plurality of storage volumes, in response to receiving the request to copy the plurality of storage volumes. The first storage volume is copied before copying the second storage volume, in response to determining that the first storage volume is more likely to be written into than the second storage volume.

Abstract: The invention provides methods for sequencing a polynucleotide comprising stopping an extension cycle in a sequence by synthesis reaction before the reaction has run to near or full completion.

Abstract: Methods for treating autoimmune disease using one or more inhibitor of STAT3 are provided herein. Also disclosed are methods for diagnosing and monitoring autoimmune disease or the propensity to develop autoimmune disease in a subject. The present invention demonstrates that inhibition of STAT3 prevents development of autoimmune disease in vivo. Based on this finding, Stat3 inhibitors can be used to treat and/or diagnose autoimmune disease in a subject.

Abstract: The invention provides methods for sequencing a polynucleotide comprising stopping an extension cycle in a sequence by synthesis reaction before the reaction has run to near or full completion.

Abstract: The invention provides methods for sequencing a polynucleotide comprising stopping an extension cycle in a sequence by synthesis reaction before the reaction has run to near or full completion.

Abstract: A method, system, and computer program product to preserve data integrity in a mirror and copy environment is disclosed herein. In one embodiment, a method may include receiving a write command and data from a host device. The method may further include writing the data to a primary storage device and attaching a primary sequence number associated with the primary storage device to the write command, thereby providing a numbered write command with a command sequence number. The numbered write command may then be transmitted to a secondary storage device. The method may further include comparing the command sequence number to a secondary sequence number associated with the secondary storage device. If the command sequence number matches the secondary sequence number, then the command may be executed. Otherwise, it may be ignored.

Abstract: The invention provides methods for sequencing a polynucleotide comprising stopping an extension cycle in a sequence by synthesis reaction before the reaction has run to near or fill completion.

Abstract: Methods of the invention comprise methods and devices for nucleic acid sequence determination.

Abstract: A transactional memory system is described for reporting memory access violations which occur when memory accesses made from instructions within a transaction conflict with memory accesses to the same memory location made from a non-transactional instruction. In an embodiment this is achieved by creating two mappings of a physical heap being used by a thread. The thread (which may be part of a multi-threaded process) comprises instructions for both transactional and non-transactional accesses to the physical heap which may execute concurrently as part of that thread. One of the mappings is used for non-transactional memory accesses to the physical heap. The other mapping is used for transactional memory accesses to the physical heap. Access permissions associated with the mappings are controlled to enable attempted memory access violations to be detected and reported.

Abstract: Methods of the invention comprise methods and devices for nucleic acid sequence determination. Generally, the invention relates to preparing a substrate for sequencing a target nucleic acid.

Abstract: The invention provides methods for sequencing a polynucleotide comprising stopping an extension cycle in a sequence by synthesis reaction before the reaction has run to near or fill completion.

Abstract: Provided are a system and program for managing operation requests using different resources. In one embodiment, a first queue is provided for operations which utilize a first resource of a first and second resource. A second queue is provided for operations which utilize the second resource. An operation is queued on the first queue until the first resource is acquired. The first resource is released if the second resource is not also acquired. The operation is queued on the second queue when the first resource is acquired but the second resource is not. In addition, the first resource is released until the operation acquires both the first resource and the second resource.

Abstract: Provided is a method, system and program for managing operation requests using different resources. In one embodiment, a first queue is provided for operations which utilize a first resource of a first and second resource. A second queue is provided for operations which utilize the second resource. An operation is queued on the first queue until the first resource is acquired. The first resource is released if the second resource is not also acquired. The operation is queued on the second queue when the first resource is acquired but the second resource is not. In addition, the first resource is released until the operation acquires both the first resource and the second resource.

Abstract: The invention provides methods for sequencing a polynucleotide comprising stopping an extension cycle in a sequence by synthesis reaction before the reaction has run to near or full completion.