Abstract: A method, system, and program for efficient parallel bitwise sweeps of larger objects during garbage collection are provided. During a bitwise sweep, a helper thread scans a mark vector looking for a consecutive sequence of unmarked bits of a sufficient length following a marked bit. Once a consecutive sequence of unmarked bits of a sufficient length following a marked bit is detected, the helper thread fetches the size of a marked object corresponding to the marked bit. If the size of the marked object exceeds a size represented by the consecutive sequence of unmarked bits, the remainder of the bits representing the marked object are skipped, such that once a marked object is identified as potentially exceeding an object fetch threshold the helper thread efficiently skips the remainder of the bits represents the marked object and continues scanning for a number of consecutive zeroes indicating free space.

Abstract: A method, system, and program for improving free item distribution among multiple free lists during garbage collection for more efficient object allocation are provided. A garbage collector predicts future allocation requirements and then distributes free items to multiple subpool free lists and a TLH free list during the sweep phase according to the future allocation requirements. The sizes of subpools and number of free items in subpools are predicted as the most likely to match future allocation requests. In particular, once a subpool free list is filled with the number of free items needed according to the future allocation requirements, any additional free items designated for the subpool free list can be divided into multiple TLH sized free items and placed on the TLH free list. Allocation threads are enabled to acquire free items from the TLH free list and to replenish a current TLH without acquiring heap lock.

Abstract: A method, system, and program for efficient parallel bitwise sweeps of larger objects during garbage collection are provided. During a bitwise sweep, a helper thread scans a mark vector looking for a consecutive sequence of unmarked bits of a sufficient length following a marked bit. Once a consecutive sequence of unmarked bits of a sufficient length following a marked bit is detected, the helper thread fetches the size of a marked object corresponding to the marked bit. If the size of the marked object exceeds a size represented by the consecutive sequence of unmarked bits, the remainder of the bits representing the marked object are skipped, such that once a marked object is identified as potentially exceeding an object fetch threshold the helper thread efficiently skips the remainder of the bits represents the marked object and continues scanning for a number of consecutive zeroes indicating free space.

Abstract: A method, system, and program for improving free item distribution among multiple free lists during garbage collection for more efficient object allocation are provided. A garbage collector predicts future allocation requirements and then distributes free items to multiple subpool free lists and a TLH free list during the sweep phase according to the future allocation requirements. The sizes of subpools and number of free items in subpools are predicted as the most likely to match future allocation requests. In particular, once a subpool free list is filled with the number of free items needed according to the future allocation requirements, any additional free items designated for the subpool free list can be divided into multiple TLH sized free items and placed on the TLH free list. Allocation threads are enabled to acquire free items from the TLH free list and to replenish a current TLH without acquiring heap lock.

Abstract: Provided are methods of identifying oligonucleotides having transcriptional or translational activity by integrating ilie oligonucleotide into a eukaryotic cell genome such that the oligonucleotide is operatively linked to an expressible polynucleotide, and detecting a change in expression of the expressible polynucleotide due to the operatively linked oligonucleotide. Also provided are vectors useful for identifying an oligonucleotide having transcriptional or translational regulatory activity according to a method of the invention. In addition, isolated synthetic transcriptional or translational regulatory elements identified according to a method of the invention are provided, as are kits, which contain a vector useful for identifying a transcriptional or translational regulatory element, or an isolated synthetic transcriptional or translational regulatory element or plurality of such elements. Also provided are isolated transcriptional regulatory elements.

Abstract: Topical otic pharmaceutical compositions comprising moxifloxacin or a pharmaceutically useful hydrate or salt thereof and a proteolytic enzyme. The compositions facilitate trans-tympanic delivery of a therapeutic level of the moxifloxacin.

Abstract: Provided are methods of identifying oligonucleotides having transcriptional or translational activity by integrating the oligonucleotide into a eukaryotic cell genome such that the oligonucleotide is operatively linked to an expressible polynucleotide, and detecting a change in expression of the expressible polynucleotide due to the operatively linked oligonucleotide. Also provided are vectors useful for identifying an oligonucleotide having transcriptional or translational regulatory activity according to a method of the invention. In addition, isolated synthetic transcriptional or translational regulatory elements identified according to a method of the invention are provided, as are kits, which contain a vector useful for identifying a transcriptional or translational regulatory element, or an isolated synthetic transcriptional or translational regulatory element or plurality of such elements. Also provided are isolated transcriptional regulatory elements.

Abstract: A method, system, and program for improving free item distribution among multiple free lists during garbage collection for more efficient object allocation are provided. A garbage collector predicts future allocation requirements and then distributes free items to multiple subpool free lists and a TLH free list during the sweep phase according to the future allocation requirements. The sizes of subpools and number of free items in subpools are predicted as the most likely to match future allocation requests. In particular, once a subpool free list is filled with the number of free items needed according to the future allocation requirements, any additional free items designated for the subpool free list can be divided into multiple TLH sized free items and placed on the TLH free list. Allocation threads are enabled to acquire free items from the TLH free list and to replenish a current TLH without acquiring heap lock.

Abstract: A method, system, and program for assigning sections within a memory heap for efficient garbage collection of large objects are provided. A first portion of a memory heap is distributed among a first number of sections from among multiple sections, wherein the first number of sections correspond to a number of helper threads allocable for bitwise sweeping of the memory heap during garbage collection. A section portion of the memory heap is distribution among a second number of sections, wherein a size of the memory heap distribution of the second number of sections progressively decreases, such that the total number of sections within the memory is minimized, but any disparity between each of the helper threads completing sweeps of all the sections is reduced.

Abstract: Topical aqueous suspension compositions of sparingly soluble ophthalmic drugs are disclosed. The compositions comprise a combination of a poloxamine nonionic surfactant and a glycol tonicity-adjusting agent such as propylene glycol.

Abstract: Topical aqueous suspension compositions of sparingly soluble ophthalmic drugs are disclosed. The compositions comprise a combination of a poloxamer or meroxapol surfactant and a glycol tonicity-adjusting agent such as propylene glycol.

Abstract: The invention relates to pharmaceutical or veterinary compositions for the treatment of surface wounds; pharmaceutical or veterinary compositions for the treatment of gastrointestinal injuries, diseases or ulcers; methods of treating surface wounds in animals, including humans; and methods for the treatment of gastrointestinal injuries, diseases or ulcers which compositions and methods include compositions of milk product extracts including growth factors with basic to approximately neutral isoelectric points.

Abstract: A system and method for incrementally compacting a computer system heap is presented. A heap, such as a garbage-collected heap in a Java environment, is divided into logical regions. When the heap is becoming fragmented, an incremental compaction cycle is commenced. During a first time period, the first region of the heap is compacted, with subsequent regions being compacted during subsequent time periods. A time period commences when a garbage collection event occurs. In a multiprocessor environment the regions can be divided into a number of sections which are each compacted using a different processor. One or more break tables are constructed indicating how far contiguous groups of moveable objects should be moved to better group objects and eliminate interspersed free spaces. References throughout the heap that point to objects within the compacted region are then adjusted so that the references point to the new object locations.

Abstract: An apparatus and method for implementing a switch instruction in the IA64 architecture is provided. With the apparatus and method, a first register is used to identify whether a low is either 0, 1 or some other value, and a second register is used to identify a shift amount. The first register is then shifted by the shift amount in the second register. The first register value is then moved to the predicate register set in the IA64 architecture, thereby identifying which branch is to be taken. If the first register is shifted outside the predicate registers, a default address is provided.

Abstract: A new method of evaluating the ability of drug molecules to penetrate the cornea is described. The permeation rate of the drug molecules in MDCK cells is utilized to predict the ability of the molecules to penetrate the cornea. The method is useful for in vitro screening of potential new ophthalmic drugs, as well as in the design of new drug molecules for topical ocular administration.

Abstract: An apparatus and method for creating instruction groups for explicitly parallel architectures is provided. The apparatus and method accept instruction groups as input and determine a number of each possible type of instruction in the instruction group. Based on the number of each possible type of instruction in the instruction group, instruction bundling is performed such that the instructions in the instruction group are bundled into efficiently executed bundles. The instruction bundling further accommodates intra-bundle stop bundles in the event that more efficient bundles are not possible. The instruction bundling is performed based on a most restrictive instruction type placement first and proceeds to less restrictive instruction type placement.

Abstract: An apparatus and method are provided for detecting and handling exceptions. Instructions that are executed only when there is an exception pending are qualified by a first predicate register in a predicate register pair. Instructions that are executed only when there is no exception pending are qualified based on a second predicate register in the predicate register pair. When an exception is thrown, a determination is made as to whether or not the instruction that threw the exception is in a try block, or range, of the method that threw the exception. If not, the first predicate register predicated instruction to branch to a return stub for the method is generated. If the instruction that threw the exception is in a try block of the method, the first predicate register predicated instruction to branch to a snippet associated with the method is generated.

Abstract: An apparatus and method for avoiding deadlocks in a multithreaded environment is provided. The apparatus and method provide a mechanism by which multiple threads are allowed to call a method virtually simultaneously without experiencing the problems regarding multiple compilations of the same method or a lock being held by one thread while other threads wait on the lock. With the apparatus and method, the first thread to call a method is the thread that causes the method to be compiled. Subsequent calls to the method, during a period of time in which the method is being compiled, are redirected to the JVM interpreter, thereby avoiding any deadlock situation.

Abstract: An apparatus and method for creating instruction groups for explicitly parallel architectures is provided. The apparatus and method gather information about the underlying architecture for use in an instruction group creation phase. The information gathered includes the number of each type of execution unit available and the number of bundles that can be dispatched concurrently by the architecture. The instruction group creation of the present invention includes three phases: a first phase for performing initial grouping, a second phase for hosting instructions from further down in the program instruction order if the instruction is not able to be added during the initial grouping phase, and a third optional phase for counting the number of bundles formed to thereby inform a Just-In-Time compiler of the amount of space need to be allocated in a code buffer.

Abstract: A method and apparatus provides a process in a data processing system for executing a method having a plurality of paths. The data processing system executes native machine code. A path is identified within the method that is being executed, wherein a plurality of bytecodes are associated with the path. Bytecodes are compiled for the path being executed, wherein the bytecodes are compiled into native machine code, wherein bytecodes for unexecuted paths remain uncompiled.