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: In one aspect the invention relates to an apparatus for analyzing the presence of a single molecule using total internal reflection. In one embodiment an apparatus for single molecule analysis includes a support having a sample located thereon; two sources of light at distinct wavelengths, a collimator for directing the light onto the sample through a total internal reflection objective; a receiver for receiving a fluorescent emission produced by a single molecule in the sample in response to the light; and a detector for detecting each of the wavelengths in the fluorescent emission. In another embodiment the apparatus further comprises a focusing laser for maintaining focus of the objective on the sample.

Abstract: In one aspect the invention relates to an apparatus for analyzing the presence of a single molecule using total internal reflection. In one embodiment an apparatus for single molecule analysis includes a support having a sample located thereon; two sources of light at distinct wavelengths, a collimator for directing the light onto the sample through a total internal reflection objective; a receiver for receiving a fluorescent emission produced by a single molecule in the sample in response to the light; and a detector for detecting each of the wavelengths in the fluorescent emission. In another embodiment the apparatus further comprises a focusing laser for maintaining focus of the objective on the sample.

Abstract: An apparatus, system, and method are provided for maintaining task prioritization and load balancing of I/O tasks on servers coupled by a plurality of communication channels. The apparatus includes a task controller for maintaining system resources on a failed target channel while resubmitting an unsuccessful task to a different channel. Also, the apparatus includes an upgrade module for upgrading a task prioritization level of a failed I/O task. Additionally, a load module is provided for balancing I/O tasks evenly across the plurality of communication channels according to a prioritization algorithm. The system includes the task controller and a device controller configured to interface with the task controller. The method includes a computer readable medium with computer readable code for selecting a channel, upgrading the prioritization level of a failed task, and maintaining resources on the failed channel while resubmitting the failed I/O task on a different channel.

Abstract: Various technologies and techniques are disclosed for providing software accessible metadata on a cache of a central processing unit. A multiprocessor has at least one central processing unit. The central processing unit has a cache with cache lines that are augmented by cache metadata. The cache metadata includes software-controlled metadata identifiers that allow multiple logical processors to share the cache metadata. The metadata identifiers and cache metadata can then be used to accelerate various operations. For example, parallel computations can be accelerated using cache metadata and metadata identifiers. As another example, nested computations can be accelerated using metadata identifiers and cache metadata. As yet another example, transactional memory applications that include parallelism within transactions or that include nested transactions can be also accelerated using cache metadata and metadata identifiers.

Abstract: Coupons which are displayed as a text message on a mobile telecommunication device and include a code uniquely identifying the coupon are provided for. Systems for generating coupons on demand are also provided for. The system comprises an agency computer having access to a coupon database. The coupon database comprises information on offers and a location value assigned to each offer. The agency computer is connectable to a mobile communications network or other network for transmitting electronic mail. It receives requests for coupons from consumers that are transmitted via the network. Preferably, the requests originate from cells phones or other mobile telecommunication devices and are transmitted to the agency computer via a mobile communications network. The request is a text message that includes information identifying the consumer's location.

Abstract: A stringed instrument tuning device is disclosed that is enhanced over the prior art by an included mechanism that enables the tuning knob to be positioned freely in any rotational position after a string has been tensioned or tuned. A worm gear drive tuning assembly typical of prior art tuning devices is employed. In one approach, the tuning device includes a common ratchet mechanism that enables free rotation of the tuning knob with respect to the tuning mechanism. In other embodiments disclosed, a spline shaft engagement mechanism is employed with a shuttle that releasably engages the tuning knob to the worm gear drive tuning assembly.

Abstract: The invention provides methods for improving the accuracy of a sequencing-by-synthesis reaction by sequencing at least a portion of a template and at least a portion of template complementary sequence.

Abstract: Various technologies and techniques are disclosed for providing a hardware accelerated software transactional memory application. The software transactional memory application has access to metadata in a cache of a central processing unit that can be used to improve the operation of the STM system. For example, open read barrier filtering is provided that uses an opened-for-read bit that is contained in the metadata to avoid redundant open read processing. Similarly, redundant read log validation can be avoided using the metadata. For example, upon entering commit processing for a particular transaction, a get-evictions instruction in an instruction set architecture of the central processing unit is invoked. A retry operation can be optimized using the metadata. The particular transaction is aborted at a current point and put to sleep. The corresponding cache line metadata in the metadata are marked appropriately to efficiently detect a write by another CPU.

Abstract: Various technologies and techniques are disclosed for providing a bounded transactional memory application that accesses cache metadata in a cache of a central processing unit. When performing a transactional read from the bounded transactional memory application, a cache line metadata transaction-read bit is set. When performing a transactional write from the bounded transactional memory application, a cache line metadata transaction-write bit is set and a conditional store is performed. At commit time, if any lines marked with the transaction-read bit or the transaction-write bit were evicted or invalidated, all speculatively written lines are discarded. The application can also interrogate a cache line metadata eviction summary to determine whether a transaction is doomed and then take an appropriate action.

Abstract: Various technologies and techniques are disclosed for providing software accessible metadata on a cache of a central processing unit. The metadata can include at least some bits for each virtual address, at least some bits for each cache line, and at least some bits for the cache overall. An instruction set architecture on the central processing unit is provided that includes additional instructions for interacting with the metadata. New side effects that are introduced into an operation of the central processing unit by a presence of the metadata and the additional instructions. The metadata can be accessed by at least one software program to facilitate an operation of the software program.

Abstract: A system and method of translating a set of transmission parameters related to a first transmission protocol from said first transmission protocol to a second transmission protocol for a data element being sent on a connection from a first communication network utilizing the first transmission protocol to a second communication network utilizing the second transmission protocol is provided. The method includes mapping a first parameter from the set of transmission parameters to a class of service value for the connection and mapping the class of service value and a second parameter from the set of transmission parameters to another parameter for the second transmission protocol.

Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

Abstract: A software transactional memory system is described which utilizes decomposed software transactional memory instructions as well as runtime optimizations to achieve efficient performance. The decomposed instructions allow a compiler with knowledge of the instruction semantics to perform optimizations which would be unavailable on traditional software transactional memory systems. Additionally, high-level software transactional memory optimizations are performed such as code movement around procedure calls, addition of operations to provide strong atomicity, removal of unnecessary read-to-update upgrades, and removal of operations for newly-allocated objects. During execution, multi-use header words for objects are extended to provide for per-object housekeeping, as well as fast snapshots which illustrate changes to objects. Additionally, entries to software transactional memory logs are filtered using an associative table during execution, preventing needless writes to the logs.

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.