Abstract: One embodiment of the present invention provides a method and an apparatus that facilitates transparent failovers from a primary copy of an object on a first server to a secondary copy of the object on a second server when the first server fails, or otherwise becomes unresponsive. The method includes detecting the failure of the first server; selecting the second server; and reconfiguring the second server to act as a new primary server for the object. Additionally, the method includes transparently retrying uncompleted invocations to the object to the second server, without requiring explicit retry commands from a client application program. A variation on this embodiment further includes winding up active invocations to the object before reconfiguring the second server to act as the new primary server. This winding up process may include causing invocations to unresponsive nodes to unblock and complete.

Abstract: One embodiment of the present invention provides a portable computing device comprising a housing including a keyboard. The embodiment also includes a first pointing device coupled to the housing, as well as a second pointing device coupled to the housing between the keyboard and a first edge of the housing. The embodiment additionally includes a plurality of buttons disposed on the housing so that at least one button is located between the first pointing device and the second pointing device, and at least one button is located between the glide point and the first edge of the housing. In another embodiment, the plurality of buttons is movably disposed on the housing so that when buttons are located in a first position, at least one button is located between the first pointing device and the second pointing device, and when buttons are located in a second position, at least one button is located between the second pointing device and the first edge of the housing.

Abstract: Apparatus, methods, and computer program products are disclosed for improving the performance of subsequent compilations of a source program. The initial compilation of the source program journals computationally expensive intermediate compilation data. Subsequent compilations, instead of recomputing this data, uses the intermediate compilation data from the journal. Thus the compiler has improved performance during subsequent compilations of the source program. One aspect of the invention applies to dynamic compilers to reduce the startup delay caused by compiling the source program when the program is invoked.

Abstract: One embodiment of the present invention provides a system for skipping a track on a disc in a disc player. Unlike current systems, this system does not rely on identifying tracks to be skipped based upon which slot a disc is located in. Instead, one embodiment of the present invention identifies discs based upon identification data read from discs in the disc player. Thus, one embodiment of the present invention provides an apparatus for playing discs that skips a track on a disc. The apparatus includes a disc player including a sequencing mechanism that generates a sequence of tracks from discs in the disc player. The disc player also includes an identification mechanism within the disc player that reads identification information from discs in the disc player and determines from the identification information if a specific disc is in the disc player.

Abstract: One embodiment of the present invention provides a system for generating an alarm in a portable computer system. In this embodiment, when an owner of a portable computer system determines that the portable computer system is either stolen or missing, the owner activates a remote transmitter. This remote transmitter sends an activation signal to a receiver in the portable computer system. In response to the activation signal, the portable computer system takes at least one theft deterrence action, such as generating an audio alarm. In one embodiment of the present invention, the theft deterrence action includes erasing at least part of the contents of a data storage device in the portable computer system. In another embodiment, the theft deterrence action includes disabling power for the portable computer system. In yet another embodiment, the theft deterrence action includes dialing a telephone number through a mobile telephone coupled with the portable computer system.

Abstract: One embodiment of the present invention provides a method for skipping a track on a disc in a disc player. Unlike current methods, this method does not rely on identifying tracks to be skipped based upon which slot a disc is located in. Instead, one embodiment of the present invention identifies discs based upon identification data read from discs in the disc player. Thus, this embodiment of the present invention provides a method for skipping a track on a disc in a disc player that operates by identifying discs contained in the disc player. The method receives track identification data from a track sequencer. The method also reads track identification data for tracks to be skipped from a memory storage device. The method then compares the track identification data for the tracks to be skipped with the track identification data from the track sequencer.

Abstract: One embodiment of the present invention provides a portable computing device comprising a housing including a keyboard. The embodiment also includes a first pointing device coupled to the housing, as well as a second pointing device coupled to the housing between the keyboard and a first edge of the housing. The embodiment additionally includes a plurality of buttons disposed on the housing so that at least one button is located between the first pointing device and the second pointing device, and at least one button is located between the glide point and the first edge of the housing. In another embodiment, the plurality of buttons is movably disposed on the housing so that when buttons are located in a first position, at least one button is located between the first pointing device and the second pointing device, and when buttons are located in a second position, at least one button is located between the second pointing device and the first edge of the housing.

Abstract: One embodiment of the present invention provides a method for securing a printed circuit board to a chassis and electrically coupling the printed circuit board to a reference voltage, such as ground. This is accomplished without using screws, and without requiring contacts to be soldered to the printed circuit board. This embodiment includes a chassis, including conductive material at the reference voltage. A mount extends from the chassis and includes a fastener for fastening to the printed circuit board. This embodiment also includes a contact surface on the printed circuit board, for electrically coupling the printed circuit board to the chassis. Additionally, this embodiment includes a contacting element, including an electrically conductive material, which exerts a restoring force when deformed. This contacting element can be located so that it is compressed between the contact surface and the chassis when the printed circuit board is fastened to the mount.

Abstract: The present invention is a system and method for a "debugger Run-Time-Checking for valid memory accesses for multi-threaded application programs" (hereinafter "RTC/MT") wherein a run-time process which includes multiple threads running either serially or concurrently, may be monitored by a debugger program and memory access errors detected and correctly attributed to the process thread encountering the error. The RTC/MT system of the present invention also provides an apparatus and method which monitors and reports memory leaks as required for multi-threaded target programs.

Abstract: The present invention provides a method and system for achieving high availability in networked computer systems. The computer system includes a client node, two server nodes, and a secondary storage device. One server node includes a primary replica, and the other server node includes a secondary replica. In order for the client node to request a service that involves the secondary storage device, the client node sends a request for the service to the primary replica. The primary replica performs an intention phase of the service and sends a checkpoint message to the secondary replica. The secondary replica updates the state of the secondary replica and sends an acknowledgement message to the primary replica. The primary replica performs the service, sends a reply message to the client node, and forgets about the request. The client node resumes execution and asynchronously sends a forget message to the secondary replica. Upon receiving the forget message, the secondary replica forgets about the request.

Abstract: One embodiment of the present invention provides a method and an apparatus for predicting the target of a branch instruction. This method and apparatus operate by using a translation lookaside buffer (TLB) to store page numbers for predicted branch target addresses. In this embodiment, a branch target address table stores a small index to a location in the translation lookaside buffer, and this index is used retrieve a page number from the location in the translation lookaside buffer. This page number is used as the page number portion of a predicted branch target address. Thus, a small index into a translation lookaside buffer can be stored in a predicted branch target address table instead of a larger page number for the predicted branch target address. This technique effectively reduces the size of a predicted branch target table by eliminating much of the space that is presently wasted storing redundant page numbers.

Abstract: One embodiment of the present invention provides a system for generating an alarm in a portable computer system. In this embodiment, when an owner of a portable computer system determines that the portable computer system is either stolen or missing, the owner activates a remote transmitter. This remote transmitter sends an activation signal to a receiver in the portable computer system. In response to the activation signal, the portable computer system takes at least one theft deterrence action, such as generating an audio alarm. In one embodiment of the present invention, the theft deterrence action includes erasing at least part of the contents of a data storage device in the portable computer system. In another embodiment, the theft deterrence action includes disabling power for the portable computer system. In yet another embodiment, the theft deterrence action includes dialing a telephone number through a mobile telephone coupled with the portable computer system.

Abstract: One embodiment of the present invention presents a method and apparatus for efficiently performing garbage collection on objects defined within an object-oriented programming system. Garbage collection typically involves following pointers to determine which objects are presently being referenced so that other objects, that are not being referenced, can be removed. To this end, the present invention maintains a bitmap for each object that indicates which variables in the object are pointer variables and which variables are non-pointer variables. A garbage collection process examines the bitmap, and on the basis of the pattern contained in the bitmap jumps to a particular routine that is tailored to garbage collect the particular pattern of pointer and non-pointer values in the object. Note that the system includes a routine tailored for each possible bitmap pattern.

Abstract: Apparatus, methods, systems, and computer program products are disclosed that use a link to access nodes in a generational garbage collected heap. The creation area of the heap is associated with a validation variable that is dependent on the number of scavenge operations performed on the creation area. The link comprises the value of the validation variable when the node was allocated and the index of the created node within the creation area. When the node is copied from the creation area an entry is made in a link-to-pointer translation table. Accesses to the node using the link succeed regardless of whether the node is in the creation area. Thus, not all references to the node need to be updated when the node is copied from the creation area allowing the copying process to be interrupted when resolving links to the copied node.

Abstract: Apparatus, methods, systems and computer program products are disclosed that optimize a programmed loop that stores pointer variables in an array in a card-marked heap. These methods also optimize garbage collection operations on these pointer variables. Instead of implementing a write-barrier in the body of a programmed loop, the loop is parameterized. This parameterization is associated with the pointer array stored in the heap. This parameterization specifies the first and last modified elements in the array. It further specifies the stride (which indicates how many elements are skipped to reach the next modified element of the array). The parameterization is modified by successive loops that access the array. During a garbage collection operation, the array's parameterization is used to optimize the process of locating modified elements in the array.

Abstract: Apparatus, methods, systems and computer program products are disclosed describing a data structure and associated processes that optimize garbage collection techniques. The disclosed data structure can be used as an instantiated object in an object-oriented programming environment. The data structure uses a data structure header to separate the portion of the data structure that contains pointer values from the portion of the data structure that contains non-pointer values. The contents of the first word of the data structure header is distinguishable from any pointer value. Thus, a garbage collection procedure can more rapidly locate the pointer values in the data structure. Another advantage of this data structure organization, when applied to instantiated objects, is that the position of an instance variable (with respect to the object header structure) remains constant for all instantiated objects including those based on subclasses of the original class.

Abstract: One embodiment of the present invention provides a memory system that allows more than one cycle of memory latency for accesses to a synchronously accessed memory. In this embodiment, the memory system includes a memory with a clocked interface and a corresponding clock input. It also includes an output register for storing data outputted from the memory during a read operation. The output register and the memory are coupled together by a data path, for transferring data between the memory and the output register. In this embodiment, the memory system further includes a clock signal coupled to the clocked interface of the memory. The clock signal feeds through a delay element into a clock input of the output register. This causes the output register to receive a delayed clock signal, thereby providing more than one clock cycle of time for data to be read from the memory and latched in the output register.