Abstract: A system provides a task scheduler to define a priority queue with at least one window and a queue-window key. Each window is an ordered collection of tasks in a task pool of the priority queue and is identified by the queue-window key. The task scheduler sets a task-window key equal to a user-window key when the user-window key is greater than the minimum queue-window key. The task scheduler can further set the task-window key equal to the minimum queue-window key when the user-window key is less than the minimum queue-window key. A maximum task limit per user for each window and a priority increment for the user-window key are further applied to ensure fair scheduling.

Abstract: One embodiment of the present invention provides a system that uses versioned pointers to facilitate reusing memory without having to reclaim the objects solely through garbage collection. The system operates by first receiving a request to allocate an object. Next, the system obtains the object from a pool of free objects, and sets an allocated/free flag in the object to indicate that the object is allocated. The system also increments a version number in the object, and also encodes the version number into a pointer for the object. The system then returns the pointer, which includes the encoded version number. In this way, subsequent accesses to the object through the pointer can compare the version number encoded in the pointer with the version number in the object to determine whether the object has been reused since the pointer was generated.

Abstract: One embodiment of the present invention provides a system that uses versioned pointers to facilitate reusing memory without having to reclaim the objects solely through garbage collection. The system operates by first receiving a request to allocate an object. Next, the system obtains the object from a pool of free objects, and sets an allocated/free flag within the object to indicate that the object is allocated. The system also increments a version number within the object, and also encodes the version number into a pointer for the object. The system then returns the pointer, which includes the encoded version number. In this way, subsequent accesses to the object through the pointer can compare the version number encoded in the pointer with the version number within the object to determine whether the object has been reused since the pointer was generated.

Abstract: In general, in one aspect, the invention relates to a method for integrating dimensional analysis in a program comprising defining a specific dimension class within the program, wherein the specific dimension class is an instance of the dimension meta-class, defining an instantiation of a unit class within the program, wherein the instantiation of the unit class comprises the specific dimension class as a type parameter associated with the instantiation of the unit class, defining a method within the program using the instantiation of the unit class and the specific dimension class, and compiling the program to generate an executable code corresponding to the program, wherein the program is written in an object-oriented language.

Abstract: A system provides a task scheduler to define a priority queue with at least one window and a queue-window key. Each window is an ordered collection of tasks in a task pool of the priority queue and is identified by the queue-window key. The task scheduler sets a task-window key equal to a user-window key when the user-window key is greater than the minimum queue-window key. The task scheduler can further set the task-window key equal to the minimum queue-window key when the user-window key is less than the minimum queue-window key. A maximum task limit per user for each window and a priority increment for the user-window key are further applied to ensure fair scheduling.

Abstract: A deque of a local process in a memory work-stealing implementation may use one or more data structures to perform work. If the local process attempts to add a new value to its deque's circular array when the data structure is full (i.e., an overflow condition occurs), the contents of the data structure are copied to a larger allocated circular array (e.g., a circular array of greater size than the original circular array). The entries in the original, smaller-sized circular array are copied to positions in the now-active, larger-sized circular array, and the system is configured to work with the newly activated circular array. By this technique, the local process is thus provided with space to add the new value.

Abstract: A self-tuning variable impedance circuit provides improved performance. A variation in the power applied to the variable impedance circuit causes a corresponding change in the impedance of the circuit, resulting in improved performance. For example, the variable impedance circuit may be a matching circuit that “follows” the output power of a power amplifier, thereby increasing the power efficiency of the power amplifier.

Abstract: A virtual machine system residing on a native machine comprises application code in a virtual machine specific format, native methods in a native machine specific format, and a plurality of execution entities that execute the application code and the native methods in parallel. An execution entity manager assigns a native method to an execution entity for execution. Based on an evaluation of the potential behavior of the native method, the execution entity manager assigns the native method to an execution entity optimized for the needs of the native method and the virtual machine system. This allows native methods that execute correctly in parallel to be assigned to an execution entity optimized to minimize system resources. Native methods that interfere with the parallel execution of other execution entities are assigned to an execution entity optimized to ensure correct native method operation.

Abstract: A virtual machine system residing on a native machine comprises application code in a virtual machine specific format, native methods in a native machine specific format, and a plurality of execution entities that execute the application code and the native methods in parallel. An execution entity manager assigns a native method to an execution entity for execution. Based on an evaluation of the potential behavior of the native method, the execution entity manager assigns the native method to an execution entity optimized for the needs of the native method and the virtual machine system. This allows native methods that execute correctly in parallel to be assigned to an execution entity optimized to minimize system resources. Native methods that interfere with the parallel execution of other execution entities are assigned to an execution entity optimized to ensure correct native method operation.

Abstract: Device mounting apparatuses suitable for coupling to a cable ladder of a cell-site, and to house a device or devices within the cell-site are provided. In one embodiment, the apparatus includes a plurality of first brackets capable of being coupled to the cable ladder, and a plurality of second brackets capable of being coupled to both the first brackets and to the device or devices. The first bracket is a substantially Z-shaped bracket, and the second bracket is a substantially U-shaped bracket. In another embodiment, a device mounting apparatus a plurality of vertical members and horizontal members coupled to at least two vertical members. The apparatus is configured to accept and secure a device within the space defined by the vertical members, the horizontal members, and the rails of the cable ladder. Methods for mounting a device inside a cell-site using the apparatuses of the present invention are also provided.

Abstract: An improved HTSC filter system design. An improved HTSC filter system comprises a cryocooler and dewar assembly, a heat dissipation assembly and at least one heat pipe providing a thermal coupling between said heat dissipation assembly and said cryocooler and dewar assembly. In a preferred embodiment, the cryocooler and dewar assembly is environmentally sealed within a double-walled aluminum canister, and the heat pipes are formed from stainless steel tubes having a predetermined amount of ammonia provided therein.

Abstract: Systems and methods for regulating, for example, the temperature of high temperature superconducting (HTSC) thin film filters used in connection with a Stirling cycle cryocooler. The system employs a digital signal processor-based control system. The system includes a cryocooler drive control loop for controlling the cryocooler drive in response to a measured cryocooler driving current and a cryocooler driving current set point. The system also includes a temperature control loop for generating the cryocooler driving current set point in response to either a cooldown profile algorithm or a comparison between a measured temperature and a set point temperature stored in DSP memory.

Abstract: An improved HTSC filter system design. An improved HTSC filter system comprises a cryocooler and dewar assembly, a heat dissipation assembly and at least one heat pipe providing a thermal coupling between said heat dissipation assembly and said cryocooler and dewar assembly. In a preferred embodiment, the cryocooler and dewar assembly is environmentally sealed within a double-walled aluminum canister, and the heat pipes are formed from stainless steel tubes having a predetermined amount of ammonia provided therein.

Abstract: A programming language processor performs link-time and run-time error checking of a program written in C, C++, or a combination of both. The link-time error checking diagnoses violations of the C++ One Definition Rule, and its equivalent in C. As the program runs, the run-time error checking examines accesses to computer memory to determine that the addresses accessed contain values of che type expected by the program. To add instrumentation to a C or C++ program, pre-expressions, post-expressions and clone-expressions are used to annotate an abstract syntax tree, the annotated tree is then canonicalized into a more traditional syntax tree before a back-end generates code for the program.