Abstract: A method, apparatus, and system are directed toward overlaying a cluster of nodes over peers in a peer-to-peer network using a peer identification and communication mechanism. A string based name for a resource in a peer-to-peer network is received and is used to generate a unique identifier using a secure hash algorithm. An advertisement specifying at least one address associated with the resource is associated with the unique identifier. The advertisement is broadcasted. The unique identifier and/or the resource in the peer-to-peer network is associated with a resource in the cluster. A network packet may be addressed to the resource in the cluster by the unique identifier. The network packet may be routed to the address associated with the resource in the cluster using an Open System Interconnection (OSI) Level 2 or above protocol.

Abstract: A method, apparatus, and system are directed toward managing cluster membership through a discovery process that enables selection of a master for the cluster. If a node on a network is the first to initiate the discovery process, it assumes the master role. Where two or more nodes enter the discovery process at the same time, or where a cluster is disjointed, views of the potential members to the cluster are shared among the nodes. Each node coalesces and sorts the views. The master may then be determined from the sorted views. In one embodiment, the master is that node in the results having a highest unique identifier. The identified master sends an assertion of its role to the other nodes. If no assertion is received, or multiple assertions are received, updated views are again shared and sorted. In one embodiment, the nodes may be within a peer-to-peer network.

Abstract: A system and method for establishing communications channels between and among peers in a peer-to-peer networking environment. Pipes may be used as communication channels for sending and receiving messages and other data between services or applications over input and output endpoints. Pipes may be asynchronous, unidirectional, stateless and unreliable. Bidirectional pipes may also be supported. Pipes may have ends that may be moved around and bound to different peers at different times. Point-to-point and propagate pipes may be supported. Pipes may connect peers that have a direct physical link and peers that do not have a direct link. Peers may communicate through pipes without knowing on which peer a pipe endpoint is bound. A message is sent to all peer endpoints currently connected (listening) to the pipe. The set of connected endpoints may be obtained from a pipe service using a pipe binding protocol.

Abstract: The present invention provides a means to support new and modified platforms without the need to modify the system software kernel. The invention uses an approach referred to as Platform Service Agents (PSAs). The PSA works with the bus manager of the system software for that platform variant and modifies the system resources as needed. The PSA isolates specifics of the platform, so that the bus manager need not be modified. Because the PSAs themselves are outside of the kernel, are downloadable, and easily created for platform variants, new platforms can be supported without modification or re-release of the system software kernel.

Abstract: A computer-implemented method for allocating securely memory resources to a platform-independent device driver is described. In one embodiment, a device driver generates a request for memory allocation in terms of an abstract memory address space. The driver forwards the request to the bus manager. An inner class representation of the bus manager is generated and the identity of the driver is determined. The inner class representation handles the request from the device driver using the same procedures as the bus manager, and appears to the driver as the bus manager itself. Thus, a memory request from a platform-independent device driver can be made in a secure manner.

Abstract: A computer-implemented method for allocating memory resources to a device driver is described. In one embodiment, a device driver generates a request for memory allocation in terms of an abstract memory address space. This abstract memory address space is also used by a bus manager to manage the allocation of memory. The driver forwards the request to the bus manager which can then allocate memory or translate the request to a second abstract memory address space used by a second bus manager. When the request is passed to a platform manager, real memory is allocated and the requested memory is passed back to the driver. Thus, by making a memory request in terms of a bus manager's abstract memory address space, the necessity of coding the driver to request real addresses (a platform-specific operation) is avoided.

Abstract: Methods, apparatus, and software for endianness checking for platform-independent device drivers is described. According to one embodiment, the method of the invention includes generating a memory allocation request from a platform-independent device driver. The driver instantiates a memory constraints object that is configured to report the endianness of the driver. The request is received by a bus manger that is configured to process memory allocation requests from the device driver and has an endianness independent of the device driver. If the endianness of the bus manager and device driver is inconsistent, then the memory constraints object is transformed to be consistent with the bus manager's endianness.