Abstract: The present disclosure describes garbage collection that provides prompt reclamation of large objects. A heap space is divided into Young regions, Old regions, and Humongous regions. A remembered set is created and maintained, during the execution of one or more programs, for each region that specifies where there are references from outside the region to inside the region. A garbage collection list is generated specifying regions to perform garbage collection on. All Young regions and at least one Humongous region are included in the garbage collection list. If it is determined to include Old regions, the Old regions are selected and included in the garbage collection list. Then, a garbage collection is performed on the regions specified in the garbage collection list. During the garbage collection, the indication for each region is utilized to determine reachable objects in the region, ensuring that reachable objects are not deallocated.

Abstract: One embodiment of the invention provides a method for performing a service operation on a computer system. The method includes submitting a request for performing a service operation on the computer system and providing an estimated duration of the service operation. The service operation is expected to render one or more resources of the computer system unavailable for the duration of the service operation. It is therefore determined whether or not to accept the requested service operation based on planned usage of the one or more resources for the duration of the service operation.

Abstract: A virtual installation map, and method involving installing a software functionality using the same, the virtual installation map including a first software installation map including a plurality of software elements representative of a related software file, the software elements also including at least one dependency to another software element. The virtual installation map further including a second software installation map also including a second plurality of software elements representative of related software file along with related dependencies. The first and second software installation maps may be hosted in separate databases and may relate to software products provided by different vendors. One or both software installation maps may include a pointer or other reference to the other installation map thereby providing a virtual installation map, in one example.

Abstract: A virtual installation map, and method involving installing a software functionality using the same, the virtual installation map including a first software installation map including a plurality of software elements representative of a related software file, the software elements also including at least one dependency to another software element. The virtual installation map further including a second software installation map also including a second plurality of software elements representative of related software file along with related dependencies. The first and second software installation maps may be hosted in separate databases and may relate to software products provided by different vendors. One or both software installation maps may include a pointer or other reference to the other installation map thereby providing a virtual installation map, in one example.

Abstract: A method for encoding a video frame. The method including obtaining a current frame from a video stream, where the video stream includes a number of frames, determining a first base QP value for the current frame, and sending the first base QP value for the current frame to a decoder. The method also includes obtaining a first macroblock from the current frame, where the first macroblock includes a first image on the current frame, determining a first actual quantization parameter (QP) value for the first macroblock, and determining a first reference block for the first macroblock. The method also includes determining a first predicted QP value for the first macroblock using the first reference block, calculating a first ?QP value for the first macroblock, and sending the first ?QP value, a first prediction mode, and a first reference vector to the decoder.

Abstract: A method and apparatus are described for recovering a fully consistent file system stored in a cluster file system with multiple metadata servers using an epoch of undo records. The epoch consists of (i) a virtual instantaneous snapshot marking a consistent and valid file system image and (ii) a set of undo records that enable the file servers to roll-back to this fully consistent image associated with the file system. The file system is recovered by rolling back file transactions associated with undo records subsequent to the undo records associated with the epoch snapshot. In addition, the undo records are maintained by advancing the epoch value and purging unneeded undo records.

Abstract: An integrated circuit (IC) having an on-die data network is disclosed. The IC includes a first bus and second buses configured to convey signals in first and second directions, respectively, along a first axis. The second direction is opposite the first. The IC further includes third and fourth buses configured to convey signals in third and fourth directions, respectively, along a second axis perpendicular to the first axis. The fourth direction is opposite the third. Each bus is N-bits wide and unidirectional. Signal lines of two different buses having equal bit significance and opposite direction are arranged adjacent to one another. A crossbar unit having N crossbar switching circuits is configured to couple signal lines of a selected one of the buses to a corresponding signal line of another selected one of the buses. The signal lines of the buses are implemented on different metal layers than the crossbar switching circuits.

Abstract: Providing an intermediate isolate, referred to as a dispenser, to handle resource requests allows for monitoring and controlling of resource consumption separate from an operating system. Resources are characterized with a set of common attributes, separate from their specific implementation. The dispenser invokes computations that provide policy decisions corresponding to a resource request. The dispenser provides the requesting isolate a response based at least in part on the policy decisions. Separating management of resources from the operating system facilitates implementation of a dispenser in a safe language and management of a broad range of resources by the dispenser.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention provide for managing offerings in a data processing system having offering platform programs operatively connected to a distributed offering network. At least one is deployed offering via an offering platform program. A topology of offerings is created. It is determined whether there is an association between two or more of the offerings. When there is an association between two or more of the offerings, the association is included in the topology.

Abstract: A method for overflow detection using partial evaluations. The method includes obtaining a section of code from a source code file stored on a storage device, analyzing the section of code to identify a buffer with an index, determining a plurality of statements that are statically-computable and dependent on the index of the buffer, and generating a code segment including the plurality of statements. The method further includes replacing an access statement of the plurality of statements with a conditional statement returning true when bounds of the buffer are exceeded, where the access statement uses the index to access the buffer, adding an unconditional statement returning false to the code segment, and executing the code segment on a computer processor to obtain a determination of whether the bounds of the buffer are exceeded.

Abstract: Disclosed herein is a method for scheduling computing jobs for a compute farm. The method includes: receiving a plurality of computing jobs at a scheduler; assigning a signature to each computing job based on at least one computing resource requirement of the computing job; storing each computing job in a signature classification corresponding to the signature of the computing job; and scheduling at least one of the plurality of computing jobs for processing in the compute farm as a function of the signature classification.

Abstract: Methods and systems facilitating a programmer to program parts of a program in data flow programming to produce directed acyclic graphs (“DAGs”), and then merge the graphs at runtime for efficiency and scalability. Large merged DAG can typically be processed with greater efficiency than the collection of smaller DAGs. As a result, smaller DAGs may be created while the execution of the program realizes the increased efficiency of executing a larger DAG based on the merging of the smaller DAGs. In accordance with methods and systems consistent with the present invention, a programmer creates individual data flow directed acyclic graphs in a program.

Abstract: Techniques and structures are disclosed for a processor supporting checkpointing to operate effectively in scouting mode while a maximum number of supported checkpoints are active. Operation in scouting mode may include using bypass logic and a set of register storage locations to store and/or forward in-flight instruction results that were calculated during scouting mode. These forwarded results may be used during scouting mode to calculate memory load addresses for yet other in-flight instructions, and the processor may accordingly cause data to be prefetched from these calculated memory load addresses. The set of register storage locations may comprise a working register file or an active portion of a multiported register file.

Abstract: Example embodiments herein include an audio manager that identifies at least one user in a social environment (e.g., multiplayer gaming environment). Each user in the social environment has a respective user music profile that contains audio attributes for various types of audio. The audio manager combines the user music profile from each user to form a group music profile. The audio manager further identifies a selection of audio segments to be rendered in the social environment that match the group music profile. Additionally, the audio manager processes the selection of audio segments against the audio attributes of at least one user to determine an audio segment to be rendered in the social environment. In one embodiment, the audio manager processes the selection of audio segments in accordance with a social value metric. In turn, the audio manager renders the audio segment in the social environment in accordance with the social value metric.

Abstract: A system for managing storage accesses for rate guaranteed continuous data streams and non-rate-guaranteed storage requests may include a plurality of rate guaranteed requestors for data streams and one or more non-rate guaranteed requestors. A disk scheduler for the system may have a guaranteed rate queue for queuing storage requests from the rate guaranteed requestors and a non-rate-guaranteed queue for queuing requests from the non-rate-guaranteed requesters. The disk scheduler may include a bandwidth allocator coupled to the guaranteed rate queue and the non-rate-guaranteed queue. The bandwidth allocator may be configured to allocate bandwidth of a storage system between the guaranteed rate queue and the non-rate-guaranteed queue according to a predetermined ratio. The rate guaranteed requestors may be limited so that an aggregate of maximum stream rates guaranteed for each rate guaranteed requestor does not exceed the portion of the bandwidth allocated to the guaranteed rate queue.

Abstract: One embodiment of the present invention provides a system that uses observed object patterns to dynamically tune a virtual machine for responsiveness and/or throughput. The system first analyzes a memory region containing a set of objects to identify objects in the memory region that indicate the need for responsiveness and/or throughput. The system gathers statistics based on the identified and unidentified objects in the set of objects, and then uses these statistics to dynamically tune a virtual machine.

Abstract: A virtual installation map, and method involving installing a software functionality using the same, the virtual installation map including a first software installation map including a plurality of software elements representative of a related software file, the software elements also including at least one dependency to another software element. The virtual installation map further including a second software installation map also including a second plurality of software elements representative of related software file along with related dependencies. The first and second software installation maps may be hosted in separate databases and may relate to software products provided by different vendors. One or both software installation maps may include a pointer or other reference to the other installation map thereby providing a virtual installation map, in one example.

Abstract: In embodiments, prior to compilation into machine code, a preprocessor generates directives by processing a source code and/or bytecode representation of a program and/or selecting default directives. The preprocessor embeds the directives in a bytecode representation of the program or a separate stream associated with the bytecode representation of the program. A just-in-time compiler may compile the bytecode representation into machine code directed by the embedded directives in one pass and/or a bytecode interpreter may interpret the bytecode representation of the program. In some embodiments, a computing device generates bytecodes during execution of a program, selects default directives, and embeds the default directives in the bytecodes or a separate stream associated with the bytecodes prior to compilation of the bytecodes into machine code.

Abstract: Embodiments of a synchronization circuit are described. This synchronization circuit includes multiple selectively coupled synchronization stages which are configurable to synchronize data and control signals between a first time domain and a second time domain, where the synchronization can be performed based on asynchronous or synchronous events associated with either the first time domain or the second time domain. Additionally, the synchronization circuit includes control logic, coupled to the synchronization stages, which is configured to adapt a number of synchronization stages used to synchronize the data and the control signals based on an estimate of a probability of metastability persisting to an output of the synchronization circuit during the synchronization.

Abstract: A system and method for automatically parallelizing a computer program for multi-threaded execution. A compiler identifies and parallelizes non-DOALL parallel regions, such as loops, within a computer program. The compiler determines enhanced helper thread instructions based upon the main body instructions of the non-DOALL region. These helper thread instructions are inserted ahead of the main body instructions within each of the plurality of threads, rather than within a single main thread. Next, synchronization instructions are inserted in one or more threads such that the main body of work of each thread is performed in a pipelined manner. The helper thread instructions within each thread may reduce the total execution time of each thread.