Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment use a requested address for an intent seize and a processor associated with the intent seize to determine a hash table entry. If the requested address is not found in the hash table, all hash tables for all processors are updated to anchor to the requested address. Non-intent seizes use a hash table associated with a designated processor, regardless of whether the designated processor initiated the non-intent seize. In this way, in an embodiment modified, cache line interventions may eliminated for intent seizes.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment determine when to switch between containers based on whether the current fill rate of the container is within a threshold of the slowest fill rate of the container and whether a current size of the container is between a soft threshold and a hard threshold. In this way, the switching of the container is based on a history of how fast the container is filling and how busy the system is in order to diminish the performance effect of switching on the application that is generating data to fill the container.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment dynamically allocate and/or deallocate data structures on demand to respective partitions in a logically-partitioned electronic device. The data structures are associated with an adapter, and the partitions may use the data structures to access the adapter and, in an embodiment, to send and/or receive messages across a network.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment select a subset of transmission line models based on bounding electrical criteria. The bounding electrical criteria may include combinations of maximum and minimum values and in an embodiment may also include nominal values. Models that meet the bounding electrical criteria may be used in modeling the transmission line while models that do not meet the bounding electrical criteria are not used.

Abstract: A compiler comprises a lexical scanner with a dynamic character identification table that accommodates different standards for encoding characters in source and target characters. The scanner is associated with data files that enable conversion of the character identification table and also source code to conform to different standard character set representations. The scanner compares the character sets associated with the source and target codes. The source code is loaded into a buffer, and if a discrepancy in character sets exists, the buffered source code is converted to the target character set. The scanner also compares the character sets associated with the target code and the character identification table. If a mismatch exists, the scanner converts the character identification table to conform to the target character set. The lexical scanner provides greater flexibility in reading and generating program code.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment pre-register buffers remotely and create tokens locally that represent the buffers prior to a data transfer operation that uses the tokens to access the buffers. In an embodiment, the buffers are pre-registered via a translation table, and the tokens are used as an offset into the translation table. In an embodiment, the pre-registration verifies that the buffer is within memory allocated to a logical partition, which protects against the risk of address corruption.

Abstract: A method, apparatus, system, and signal-bearing medium are provided that in an embodiment receive a command at an adapter from an initiator that requests a transfer of data, transfer the data from the initiator to the adapter, and respond with a notification to the initiator that the command completed successfully after transferring the data to the adapter and prior to the adapter completing a process based on the command.

Abstract: A method, system, and program product for optimizing compilation. In the preferred embodiment, a compiler compiles a source-code file twice; once to gather register-pressure data, and a second time to apply the data. Thus, the compiler saves register-pressure data during the first compilation and uses it during the second compilation to make informed inlining decisions. The compiler saves two kinds of data during the first compilation: (1) the maximum register-pressure occurring in each procedure; and (2) within each procedure, the register pressure at each call site that is a potential inlining candidate. This data is then fed into the compiler during the second compilation. The compiler uses the data during the second compilation in two ways. First, when deciding whether to inline a child procedure into a parent procedure, the compiler determines whether the sum of the maximum register-pressure and the site register-pressure exceeds the number of available, physical registers.

Abstract: A method, apparatus, system, and signal-bearing medium that in an embodiment associate a persistent indicator with allocated memory and determine whether to preserve the contents of the allocated memory during an IPL (Initial Program Load) based on the persistent indicator. If the persistent indicator associated with the memory is on, the contents of that memory are preserved, and if the persistent indicator is off, the contents of that memory are discarded.

Abstract: A method for processing a multidimensional array object in which a multidimensional array is implemented by an array of array objects. The multidimensional array object comprises array objects which constitute the multidimensional array. Flags representing that it is possible to optimize a process for elements of the multidimensional array object are added as additional information. The flags are stored in a storage device (main memory for instance). Then, a machine code corresponding to a state of the flags is executed.

Abstract: A procedure for the automatic generation of a textual expression from a semantic representation by a computer-system is described. With the procedure, a statistical model is determined by the computer-system on a plurality of pre-determined pairs of semantic representations and associated expressions and stored. A semantic representation, from which an associated expression is determined by the computer system by means of the statistical model, is presented to the computer system. These steps are repeated by the computer system for further semantic representations if necessary.

Abstract: A mechanism for recovering from an invalid hyperlink address. In the preferred embodiment, a browser sends a request containing a hyperlink address of a file to a server. When the browser receives a message from the server indicating that the address is invalid, the browser shortens the address to the next highest directory deleting the most narrow portion of the address and retries the request using the new, shortened address. Since many servers have their files organized hierarchically, this recovery strategy provides a good alternative to the original, invalid address.

Abstract: To detect only JITed frames which are frames for codes compiled by a Java Just In Time compiler (JIT compiler) in an environment in which the memory available for use by a Java JIT compiler is limited, and JITed frames and other frames coexist in a thread stack. When the JIT compiler causes short of memory in a specific thread, all the threads are temporarily suspended. Then, each thread is searched for active methods, i.e., in each thread stack JITed code addresses are searched for. When there is no JITed last frame records, each frame is scanned from the position pointed by the current stack pointer SP to the bottom of the stack. When there is a list, it is scanned from the position pointed by the current stack pointer SP to the address of a JITed frame pointed by the latest JITed last frame record in the list. Following this, a frame pointed by a JITed last frame record and a JITed frame that can be traced from the pointed frame are detected. In FIG.

Abstract: A portable computer system has heat transfer mechanisms incorporated therein for transfer of heat to a docking station with active cooling capacity. A portable computer case has openings placed in alignment with mating openings in the docking station to provide additional active cooling capacity. The portable computer system case also has further openings and a defined air flow path to enhance airflow across a processor to cool it more effectively. A fan in the docking station pulls or pushes air from or into the portable computer system case. The mating openings and further openings in the computer system case are positioned to optimize the cooling effectiveness of the air flow with respect to the processor and other heat producing components. Other devices such as refrigeration coils, heat slugs, and heat pipes are also described. A switch detects when the portable computer is connected to the docking station and causes deactivation of processor slowing power management routines.

Abstract: A way to synchronize threads in a multi-threaded program. In the preferred embodiment, a debugger provides a break-point that does not interrupt the user when the first thread reaches it; instead, the debugger halts this thread at the break-point and waits for other threads to accumulate at the break-point before the debugger notifies the user. The user can specify a condition under which this notification should occur; for example, when a specific thread or a certain number of threads have accumulated at the break-point. Once the condition is satisfied, the debugger suspends other threads that have not reached the break-point. The debugger then provides for synchronized stepping or running of the threads that are halted at the break-point.

Abstract: The invention relates to objects within a computer-system said objects comprise object data and the invention relates to a specification of an object-specific, self-reflecting relevance-function associated with the objects. The specification of the relevance-function allows an object-exploiter to evaluate an object-relevance at a certain point in time without inspecting the object-data.

Abstract: A method and object-oriented computing system in which a Java™ implementation of a service is provided dynamically at runtime via a Java™ interface for the service in accordance with the needs of a client computer in one of two varieties: an Enterprise Java Beans™ (EJB) implementation or, alternatively, a non-EJB implementation. Thus, the same service is accessible, without requiring any programming code changes, to both clients operating in an EJB environment and clients operating in a non-EJB environment. The client accesses the service through two non-EJB interfaces, one for the service (object or bean) itself, and the other for an abstract factory class. Both of these client interfaces are non-EJB to avoid dependence upon client access to EJB packages, which may exist for some clients and not for others.

Abstract: A method, system, and program product for generating a window scroll-bar. In the preferred embodiment, a controller displays the window scroll-bar on a display screen. The window scroll-bar contains sections associated with respective windows on the display. The window scroll-bar also contains a slider, which moves within a section and between sections. As the slider moves within a particular section, the window associated with that section moves on the display toward the nearest boundary of the display. Thus, by moving the window scroll-bar slider, the user can move overlapping windows out of the way and find the window of interest.

Abstract: Apparatus and method for PCI bus extension, via a PCI bridge circuit, as well as PCI device function, via a PCI device circuit and I/O connector, all on a single I/O card. Further, the present invention provides for stackable, partial-height PCI cards. Further, provided are stackable, partial-height I/O card mounting plates. In yet another embodiment, a functional PCI extension card also provides one or more right-angle connector sockets in order to allow multiple additional PCI cards at right angles to the functional PCI extension card.

Abstract: A shared bus non-sequential data ordering method and apparatus are provided. A maximum bus width value and a minimum transfer value are identified. A minimum number of sub-transfers is identified responsive to the identified maximum bus width value and the minimum transfer value. A bus unit having a maximum number of chips to receive and/or send data receives data in a predefined order during multiple sub-transfers. During each data sub-transfer, a corresponding predefined word is transferred to each chip of the bus unit.