Abstract: A tee for use with a golf ball. It includes a first leg, a second leg, and a third leg, joined at a hub, each leg having an end that is coplanar to form a terrain plane with the ends of corresponding legs. It also has a first ball support; a second ball support; and a third ball support, extending from the hub, wherein each ball support has an end that is coplanar to the ends of the corresponding ball supports in a ball support plane The ball support plane may be within a few degrees of parallel to the terrain plane.

Abstract: A computer implemented method for writing to a software bound ring buffer. A network adapter may determine that data is available to write to the software bound ring buffer. The network adapter determines that a read index is not equal to a write index, responsive to a determination that data is available to write to the software bound ring buffer. The network adapter writes the data to memory referenced by the hardware write index, wherein memory referenced by the write index is offset according to an offset, and the memory contents comprise a data portion and a valid bit. The network adapter writes an epoch value of the write index to the valid bit. The network adapter increments the write index, responsive to writing the data to memory referenced by the write index. Further disclosed is method to access a hardware bound ring buffer.

Abstract: The present invention provides a computer implemented method, data processing system, and computer program product for mapping and dispatching virtual processors in a data processing system having at least a first partition and a second partition. The data processing system runs a first partition on a virtual processor during a first timeslice. The data processing system identifies an at least one physical page used by the first partition and the second partition. The data processing system maps the at least one physical page to the first partition and the second partition. The data processing system determines a fitness value based on the mapping. The data processing system dispatches the Virtual processor to the second partition on a second timeslice based on the fitness value, wherein the second timeslice immediately succeeds after the first timeslice, whereby the at least one physical page remains in cache during at least the first timeslice and the second timeslice.

Abstract: The present invention provides a computer implemented method and apparatus to revising logical unit ownership in a host. A host receives an error message from a storage subsystem having at least two storage controllers and at least one logical unit coupled to at least one of the storage controllers. The host suspends I/O from the host to the storage subsystem. The host transmits a verification of logical unit ownership query to the storage subsystem. The host determines that ownership between a host and a logical unit on the at least one of the storage controllers has changed from a mapping table of the host. Responsive to a determination that ownership has changed, the host updates ownership in a mapping table of the host to reflect the ownership between the host and the logical unit. The host resumes I/O from the host to the storage subsystem, wherein the host routinely exchanges I/O with the storage subsystem.

Abstract: To associate an email with a tag, an email client may receive a tag corresponding to an email attribute, wherein the email attribute is an historical email tag. The email client stores the tag to a record keyed by the email attribute, and receives an email tag request, the email tag request having a word attribute, and looks up at least one record based on the word attribute to find the tag. The email client presents the tag of the at least one record to a user. The email client receives a user selection of the tag to form a selected tag, and sends an email having the selected tag as part of the email header, wherein the email comprises the email tag request.

Abstract: The present invention provides a computer implemented method for resolving a universal resource identifier (URI). The client computer receives the universal resource identifier, which is comprised of a domain name. The client computer looks up a row corresponding to the domain name in a domain specific domain name service (DNS) server list. The row includes at least a first internet protocol address. The client computer transmits a domain name service (DNS) query addressed to the first internet protocol address responsive to looking up the row. Upon receiving a valid response in at least one packet, wherein the at least one packet is from the first internet protocol address, the client computer resolves the universal resource identifier to a second internet protocol address.

Abstract: Disclosed is a computer implemented method and computer program product for transmitting a resource record to a requesting computer. An authoritative domain name server receives a DNS query from a requesting computer at a name server. The authoritative domain name server looks up the resource record based on the DNS query, wherein the resource record is associated with an epochal time and a time to live. The authoritative domain name server transmits the resource record response based on the epochal time.

Abstract: The present invention provides a mobile station implemented method for managing a requested name and phone record. The method comprises steps of the requester associated device receiving a user's identification from a mobile station phonebook owner and a search term. The requester associated device transmits the user identification of the mobile station phonebook owner and the search term. Receiving at least one matching name and phone record, the requester associated device presents the at least one matching name and phone record to a user. The requester associated device receives a user management command to perform an action on the name and phone record. The method may complete when the requester associated device performs the action on the name and phone record.

Abstract: A method and system for reducing processing overhead during execution of a code block in a high efficiency compilation framework. The method identifies second code blocks within the code block and separates them out from the first code block during compilation. Further, during compilation, the system converts the second code blocks to kernel program modules, in a form recognizable by the system kernel. The compilation is followed by execution of the first code block, with the compiled object code of the first code block being executed in user mode and the kernel program modules being executed in kernel mode.

Abstract: The present invention provides a computer implemented method and apparatus to assign software threads to a common virtual processor of a data processing system having multiple virtual processors. A data processing system detects cooperation between a first thread and a second thread with respect to a lock associated with a resource of the data processing system. Responsive to detecting cooperation, the data processing system assigns the first thread to the common virtual processor. The data processing system moves the second thread to the common virtual processor, whereby a sleep time associated with the lock experienced by the first thread and the second thread is reduced below a sleep time experienced prior to the detecting cooperation step.

Abstract: Disclosed is a computer implemented method and computer program product to prioritize paging-in pages in a remote paging device. An arrival machine receives checkpoint data from a departure machine. The arrival machine restarts at least one process corresponding to the checkpoint data. The arrival machine determines whether a page associated with the process is pinned. The arrival machine associates the page to the remote paging device, responsive to a determination that the page is pinned. The arrival machine touches the page.

Abstract: Disclosed is a computer implemented method and computer program product to resume a process at an arrival machine that is in an identical state to a frozen process on a departure machine. The arrival machine receives checkpoint data for the process from the departure machine. The arrival machine creates the process. The arrival machine updates a page table, wherein the page table comprises a segment, page number, and offset corresponding to a page of the process available from a remote paging device, wherein the remote paging device is remote from the arrival machine. The arrival machine resumes the process. The arrival machine generates a page fault for the page, responsive to resuming the process. The arrival machine looks up the page in the page table, responsive to the page fault. The arrival machine determines whether the page is absent in the arrival machine. The arrival machine transmits a page-in request to the departure machine, responsive to a determination that the page is absent.

Abstract: The present invention provides a computer implemented method, data processing system, and computer program product for verifying a return address. A computer stores the return address into a stack based on a function call. The computer generates a first hash based on a first stack frame and a second stack frame. The computer stores the first hash in a first canary location, wherein the first canary location is in the first stack frame. The computer executes at least one instruction of a routine referenced by the function call. The computer reads the first canary location to form a first suspect hash. The computer calculates a first verification hash based on the first stack frame and the second stack frame. The computer determines that the first verification hash matches the first suspect hash to form a first positive determination. The computer responsive to the first positive determination, the computer reads a second canary location to form a second suspect hash.

Abstract: Disclosed is a computer implemented method and apparatus for queuing I/O requests to a pending queue. The I/O device driver sets a maximum ordered queue length for an I/O device driver coupled to a storage device then receives an I/O request from an application. The I/O device driver determines whether the pending queue is sorted and responds to a determination that the pending queue is sorted, determining if queued I/O requests exceed the maximum ordered queue length. Responding to a determination that the pending queue exceeds the maximum ordered queue length, the I/O device driver adds the I/O request based on a high pointer, and points the high pointer to the I/O request.

Abstract: Disclosed is a computer implemented method and apparatus to retrieve authentication records required for user validation and creation of authentication credentials from an authentication server to be passed to the user. The method is comprised of the authentication server storing a first authentication record, then generating a first authentication credential based on the first authentication record. The authentication server associates the first authentication record with a first credential expiration time. The authentication server stores a second authentication record. The authentication server generates a second authentication credential based on the second authentication record, wherein the second authentication credential is associated with a second credential expiration time. Next, the authentication server associates the second authentication credential with a second credential expiration time.

Abstract: Provided are method, apparatus and computer program product for managing persistence in a messaging network. A determination of whether to save data relating to a message-based communication to persistent storage at a message server is made with reference to characteristics of at least one messaging client involved in the message-based communication. The characteristics may include, for example, connection reliability information for the client's previous connections to the message server, such as numbers of disconnections within a defined period or average connection duration, for a messaging client to which at least one message is to be transmitted by the message server. The characteristics may represent a number of matching subscribers per publication. These and/or other example characteristics may be captured in a database at the message server and may be evaluated (for example by SQL queries applied to the database) to determine whether a persistent save operation is required or can be omitted.

Abstract: Methods (100), systems (300) and computer program products are disclosed for uninterrupted execution of an application program (110). The method (100) comprises: receiving a write operation call to a native file system from an application program (110) being executed on an operating system; and dynamically allocating (120, 122) free data blocks to the native file system from at least one other file system in a group of file systems until completion of execution of the application program (110) thereby completing the write operation call. The group of file systems is configured to allow sharing of free data blocks amongst the group of file systems.