Abstract: A concurrent FIFO queue is implemented as an “optimistic” doubly-linked list. Nodes of the optimistic doubly-linked list are allocated dynamically and links between the nodes are updated optimistically, i.e., assuming that threads concurrently accessing the FIFO queue will not interfere with each other, using a simple store operation. Concurrent, linearizable, and non-blocking enqueue and dequeue operations on the two ends of the doubly-linked list proceed independently, i.e., disjointly. These operations require only one successful single-word synchronization operation on the tail pointer and the head pointer of the doubly-linked list. If a bad ordering of operations on the optimistic FIFO queue by concurrently executing threads creates inconsistencies in the links between the nodes of the doubly-linked list, a fix-up process is invoked to correct the inconsistencies.

Abstract: A telematics system is provided. The system includes a telematics client framework having an interface to client applications and being integrated with a client communications framework. The client communications framework has a client stream manager, a client data pump, a client policy manager, and a client channel monitor. The channel monitor detects availability of channels for communication with a telematics server framework. The telematics server framework includes an interface to server applications and is integrated with a server communications framework. The client channel monitor is configured to communicate availability of channels to connection objects of the client data pump. Switching between channels is triggered based on information obtained from the client policy manager.

Abstract: A method for handling events in aggregate descendants including creating a process contract by a first process, executing a first operation in the first process, wherein a second process created by the first operation is added to the process contract, receiving a first event affecting the second process in the process contract, handling the first event in the first process, and killing the second process, if the first event is a fatal event.

Abstract: A method of defining a trace point, including defining a trace point representation in a program source code, compiling the program source code to generate an instrumented program comprising the trace point corresponding to the trace point representation, and associating the trace point with a placeholder function configured to produce a minimal disabled probe effect.

Abstract: In some embodiments, techniques for controlling inter-process communications in a single kernel instance operating system partitioned into a global zone and one or more non-global zones. In one embodiment, a method is provided. The method can include establishing a non-global zone for isolating processes from processes in other non-global zones in a global operating system environment controlled by a single kernel instance. The method can include, responsive to a first request, creating a communications object having a unique identifier corresponding to the non-global zone of a process making the first request. The method may include, responsive to a second request, initiating a communications using the communications object for a process making the second request, if the process making the second request is determined to be associated with the non-global zone having a unique identifier matching the unique identifier of the communications object.

Abstract: One embodiment of the present invention provides a system that facilitates selectively unmarking load-marked cache lines during transactional program execution, wherein load-marked cache lines are monitored during transactional execution to detect interfering accesses from other threads. During operation, the system encounters a release instruction during transactional execution of a block of instructions. In response to the release instruction, the system modifies the state of cache lines, which are specially load-marked to indicate they can be released from monitoring, to account for the release instruction being encountered. In doing so, the system can potentially cause the specially load-marked cache lines to become unmarked. In a variation on this embodiment, upon encountering a commit-and-start-new-transaction instruction, the system modifies load-marked cache lines to account for the commit-and-start-new-transaction instruction being encountered.

Abstract: An instruction stream having variable length instructions with embedded constants (e.g. immediate values and displacements) is translated into a stream of operations and a corresponding stream of bit fields, enabling advantageous compact storage of the embedded constants. The operations and the compact constants are optionally stored in entries in a trace cache and/or processed by execution pipelines. The compact constants are optionally formulated as a small constant field, a pointer, or both. The pointer of a particular one of the operations optionally references one of the bit fields within a window of the operations associated with the particular operation. A full-sized constant is constructed from one or more contiguous ones of the bit fields, starting with the referenced bit field, by unpacking and uncompressing information from the contiguous bit fields. An operation optionally includes a plurality of small constant fields and pointers to specify a respective plurality of constants.

Abstract: An Adaptive Computing Ensemble (ACE) includes a plurality of flexible computation units as well as an execution controller to allocate the units to Computing Ensembles (CEs) and to assign threads to the CEs. The units may be any combination of ACE-enabled units, including instruction fetch and decode units, integer execution and pipeline control units, floating-point execution units, segmentation units, special-purpose units, reconfigurable units, and memory units. Some of the units may be replicated, e.g. there may be a plurality of integer execution and pipeline control units. Some of the units may be present in a plurality of implementations, varying by performance, power usage, or both. The execution controller dynamically alters the allocation of units to threads in response to changing performance and power consumption observed behaviors and requirements.

Abstract: Pulses generated from servo stripes of a servo tape system are narrowed by using non-linear gain enabling precise position of the read head. Non-linear gain based on the amplitude of each pulse is applied to each pulse to reduce jitter and distortion so as to more accurately position the read head. A non-linear gain device comprising multipliers apply a non-linear gain to a normal servo pulse signal prior, in one embodiment, to the signal being applied to a qualifier. The non-linear gain device further comprises a limiter so as to limit the gain beyond a certain threshold to 1.0. The limitation of the gain to 1.0 renders the actual amplitude of the pulse unchanged while narrowing the pulse and flattening the baseline. The resulting pulse possesses less jitter and less distortion qualities rendering the positioning of the read head more precise.

Abstract: A computer system (for example a blade server system) includes a connection framework for receiving at least two replaceable units (e.g., service processor units). Where a first replaceable unit is provided in the connection framework, the first replaceable unit can, on a second replaceable unit being received in the framework, allow restricted use of a default admin user login without a password for up to the end of predetermined period following receipt of the second replaceable unit. On receipt of an admin login with a configured password during the period, or on expiry of the period, the system can revert to normal operation.

Abstract: A heap may be marked and compacted while performing only two passes over the objects and object references in the heap. Specifically, objects and object references are traversed once during a marking phase and again during a compaction phase of split-reference, two-pass mark-compaction. Object references are updated in two steps. First, during marking, each object reference may be updated to include the relative offset within its block of the referenced object and-during compaction that offset may be added to the block's destination address resulting in a reference that points to the actual post-compaction location for the referenced object. Objects of a particular block may be rearranged, or permuted, with respect to each other within the block. However, the order between groups of objects in different blocks may be preserved across compaction.

Abstract: A method for testing an implementation of a specification is provided. The method includes providing a security manager capable of being configured to test compliance of an implementation of a specification, and installing the security manager. The method further includes constructing a security policy corresponding to a desired security environment that a test requires. The method also includes executing the test with the security manager using the security policy.

Abstract: A first host system can be configured initially with a first host identity and a second host system can be configured initially with a second host identity. A host identity can belong to only one host system at a time. An administrator system can hold an additional host identity. The administrator system can securely connect to the first host system and can pass the additional host identity to the first host system. The first host system can reconfiguring itself to use the additional host identity and can pass the first host identity to the administrator system. The administrator system can securely connect to the second host system and can pass the first host identity to the second host system. The second host system can then reconfigure itself to use the first host identity and pass the second host identity to the administrator system. In this manner the first host identity can be passed securely from the first to the host system without a risk of duplication.

Abstract: An invention is provided for a context based mobile device display. The context based mobile device display includes a primary service icon representing a service most likely to be utilized by a user within a predefined period of time based on user profile information. The primary service icon is displayed in a primary position on the mobile device display. Also included is a plurality of secondary service icons representing services likely to be utilized by a user within a predefined period of time, however not as likely as the primary service, based on user profile information. The secondary service icons are smaller than the service icon representing the service in the primary position. A plurality of tertiary service icons representing remaining services available to the user are further included in the context based mobile device display. The tertiary service icons are displayed in a tertiary position of the mobile device display.

Abstract: One embodiment of the present invention provides a system that facilitates computer system monitoring. During operation, the system receives monitored signals from a computer system. The system then computes cross-correlation coefficients between the signals. Next, the system groups the signals into clusters based on the cross-correlation coefficients, wherein signals within a cluster are closely correlated. The system also monitors signals within each cluster, and checks cross correlations between signals within each cluster to identify computer system anomalies.

Abstract: One embodiment of the present invention provides a system that facilitates specifying a repository containing authentication information to a plugin in a plugable authentication system. When the system receives a command that requires the repository to be accessed, the system populates a data structure with information including a specifier for the repository. The system passes this data structure into a plugin framework. This enables one or more plugins within the framework to access the specified repository.

Abstract: An editor or software engineering tool may be configured to represent program code as a doubly-linked list of lexical tokens and to maintain, coincident with an operation that modifies contents of the list, an undo object that identifies opposing end nodes of a sublist of one or more lexical tokens corresponding to a substring that is either inserted into or removed from the list by the operation. In this way, lexical tokens corresponding to an inserted substring can be readily and efficiently excised to restore a pre-insertion tokenized list state. Similarly, lexical tokens corresponding to a removed substring can be readily and efficiently reinstated to restore a pre-deletion tokenized list state. Advantageously, undo support once employed to restore a prior tokenized list state is symmetrically available to support redo operations.

Abstract: A mechanism and method for dynamic criteria-based line grouping for generating purchase orders within a software procurement system. The software system includes a data structure containing line items of a requisition. Each line item contains criteria that can be used to sort the line item to a particular purchase order, e.g., the criteria could include (1) information regarding the supplier, (2) the billed-to address, (3) the send-to address and (4) the currency used to purchase the line item. A configuration file (LGU file) contains the criteria by which the line items are sorted into purchase orders. This configuration can be dynamically altered by the user at any time thereby altering the manner in which the line items are sorted into purchase orders. A line_group table indicates which line items are grouped within a particular purchase order based on the dynamic configuration of the LGU file. A order_header table relates a line_group table to a requisition.

Abstract: One embodiment of the present invention provides a system that electronically aligns mini-bars on different semiconductor chips which are situated face-to-face to facilitate communication between the semiconductor chips through capacitive coupling. During operation, the system measures an alignment between a first chip and a second chip. The system then selects a group of transmitter mini-bars on the first chip to form a transmitter bit position based on the measured alignment. In this way, the system allows a data signal to be distributed to and transmitted by the mini-bars that form the transmitter bit position. The system also selects a group of receiver mini-bars on the second chip to form a receiver bit position based on the measured alignment. Next, the system associates transmitter bit positions on the first chip with proximate receiver bit positions on the second chip based on the measured alignment.

Abstract: Computer systems often strive to retrieve and process data from multiple sources. Integration and processing of data from multiple data sources tends to increase processing demands and decrease throughput due to the additional deployment of computational resources for handling multiple sources. An executable entity, such as a bean, which accesses each data source by the location of the data objects, and retrieves data objects corresponding to rows of data, is operable to access a plurality of data sources independently of the storage medium (i.e. DBMS), or format, and aggregate multiple objects from each of the data sources into a set of compound objects, in which each compound object includes associated fields from the accessed objects of the individual data sources.