Abstract: A method for enhanced privacy protection in identification in a data communications network includes enrolling for a service on the data communications network, receiving a randomized identifier (ID) in response to the enrolling, storing the randomized ID and using the randomized ID to obtain services on the data communications network. An apparatus for obtaining a service on a data communications network includes an enrollment authority configured to accept an enrollment request. The enrollment authority is further configured to return enrollment results in response to the enrollment request. The enrollment results include user data and the enrollment results may be used obtaining a service from a service provider.

Abstract: Provided are a method, system, and program for managing access to a device. An I/O request directed toward the device is received and a determination is made of a device object for the device associated with at least one path object. A determination is made of a queue object associated with the device object, wherein the queue object corresponds to one queue. A determination is made of a queue status from the determined queue object and the I/O request is transmitted on a path indicated in the path object that is associated with the determined device object if the queue status is set to a state indicating to transmit I/O requests.

Abstract: Embodiments of a decentralized, distributed trust mechanism that may be used in various networking platforms including peer-to-peer platforms, to implement trust relationships between and among peers and to implement trust relationships between peers and content and data (codat). Protocols and methods may be provided for determining, disseminating and updating trust. For participating peers, trust may be biased towards data relevance. Trust may have multiple components or factors, which may include peer confidence, codat confidence and risk components, and embodiments may provide for the inclusion of factors of trust based on a peer group's interests and/or group content relevance. Embodiments may be used for a variety of applications in which trust may be based on the norm for social interaction between participating peers.

Abstract: Optimized loading of program data on a device comprises receiving a program including multiple program units, at least one of which is a main program unit. A use graph of the program is obtained, where the root node of the use graph represents the joining of the root node to one or more nodes representing the at least one main program unit. The multiple program units are ordered based at least in part on a depth-first traversal of the use graph and the ordered program is communicated to the device.

Abstract: An incremental collector that employs remembered sets to identify the locations where a mutator has modified references to objects in respective heap regions employs a thread operating concurrently with the mutator to update the remembered sets in accordance with reference mutation. Specifically, when the mutator modifies a reference in one of a plurality of “cards” into which the collector treats the heap as divided, the concurrent thread ordinarily searches the card for references in accordance with which it updates the remembered set. But it selects certain cards, in which it has observed particularly high mutation activity, as ones in which reference mutation will not cause concurrent remembered-set updating. Remembered-set updating in response to those cards' references occurs only when all mutator threads have been suspended.

Abstract: A dynamic session redirector provides the ability to receive requests for network accessible storage resources and redirect them to the appropriate resources as needed while providing a single system image to the system requesting access to the resources. The redirector provides an ability to reconfigure the network storage resources without altering the system image presented by the redirector to the clients on the network. This may be used to provide for dynamic reallocation of the resources in order to improve efficiency and reliability of the storage system, as well to provide support for a wide variety of protocols to be redirected, including stateful protocols.

Abstract: A method of providing software metrics attribute feedback involves setting a metrics attribute threshold value for a software component, generating a plurality of undesirable metrics attribute values using the metrics attribute threshold value, compiling the software component using a development tool, measuring a metrics attribute value of the software component, and displaying a metrics feedback icon if the metrics attribute value equals at least one of the plurality of undesirable metrics attribute values.

Abstract: A system and method for providing a name service in a peer-to-peer environment is described. A peer group name server may be a standalone name server that may be used in peer-to-peer applications and environments. A network computing platform may be used as a basis for establishing and operating a peer-to-peer network. A peer group name server may cache information about peers, peer groups and other entities. Peers may discover other peers, peer groups and other entities through the peer group name server. A peer group name server may serve as a reverse lookup provider. A peer group name server may act as a registrar for named entities (e.g. peers) in the peer-to-peer networking environment. In one embodiment, peer group name servers may maintain information about other peer group name servers, thus making a network of decentralized peer group name servers.

Abstract: A mechanism is disclosed for migrating large data sets for product upgrades. In one embodiment, an identifier is received as a parameter of a first method of an API. In response to the receipt of the identifier as a parameter of the first method, a utility is invoked. The utility exports, as one or more transportable tablespaces, one or more database objects that are associated with the identifier in a database. The identifier is also received as a parameter of a second method of the same API. In response to the receipt of the identifier as a parameter of the second method of the API, a utility is also invoked. The utility imports, into the database, database objects that are contained in the one or more transportable tablespaces. The utility also associates, with the identifier, the database objects that are contained in the one or more transportable tablespaces.

Abstract: Factored assert chains allow for improved tracking of implicit information in a computer program. The compiler may generate assert statements at various points in the program where there is implicit information. The dominator tree for the program or section of program may then be constructed. Then ?-nodes may be inserted throughout a control flow graph. Following that, for each statement in the program or section of program, an assert chain may be constructed from each use to the most recent available assert statement for the variable. Then, if the statement is an assert statement, each use may be kept track of as a mapping to an assertion, otherwise a mapping of any reference to an assert statement for each definition may be deleted. This may then iterate through the dominator tree. At the end, a series of factored assert chains remains, which may be utilized by the compiler to improve the efficiency of generated code.

Abstract: A rackmount server has dual-redundant hot-swappable fans for uniformly providing air flow to a plurality of CPU modules housed in the rackmount server. Air flow generated by the fans may also be provided to I/O circuitry disposed in the rackmount server. An airflow zone in which air flow is provided by the fans is separate, however, from an airflow zone in which air flow is provided to at least one power supply and/or disk drive housed in the rackmount server.

Abstract: In general, in one aspect, the invention relates to a method for deploying an operating system on a client. The method includes downloading a boot configuration file, downloading a boot kernel and boot loader specified in the boot configuration file, booting the boot kernel on the client, executing the boot loader, by the kernel, to download of a ramdisk image, and mounting the ramdisk image in memory on the client, where the ramdisk image comprises the operating system.

Abstract: A method for virtual computing that includes receiving a virtual computer specification, wherein the virtual computer specification defines a plurality of hardware and software configuration requirements for a virtual computer and a duration requirement for use of the virtual computer, requisitioning a plurality of computing resources based on the plurality of hardware and software configuration requirements, provisioning the plurality of computing resources from a pool of computing resources to obtain a provisioned virtual computer, and scheduling the plurality of computing resources of the provisioned virtual computer for use based on the duration requirement.

Abstract: A method for user interface customization in a portal server that includes receiving a selection of a skin, wherein the skin comprises a plurality of files, customizing representation of content in each of a plurality of channels by using the plurality of files to obtain a customized user interface, wherein the content in each of the plurality of channels is obtained by the portal server, and outputting the customized user interface of the portal server.

Abstract: A system and method for previewing a reboot. In one embodiment the method comprises modifying a configuration of a computer system and previewing a reboot, wherein previewing the reboot comprises comparing a current configuration of the computer system to a predicted configuration of the computer system. In an additional embodiment, the method may further comprise determining errors in the current configuration of the computer system by comparing the current configuration of the computer system to the predicted configuration of the computer system. The system incorporates the idea of a “preview” boot mode for both the operating system and it resource scripts and resources. Application of this method allows the risks associated with boot processes to be safely determined a priori. The method also allows an “instantaneous” reboot by swapping actual data structures and resources with predicted data structures and resources of the live system.

Abstract: One embodiment of the present invention provides a system and method for determining a cache optimized ordering of cells in an unstructured graph. Cells bounding a region defined along a portion of a stored logically-defined grid are identified and each cell is added into an element of a level set array block in order of traversal through the region along the boundary. The level set array block is reordered for each additional cell in the data object that is contiguous to at least one such cell added previously to the level set array block. Each such additional cell is added into an element of the level set array block. Each cell remaining in the data object independent of any element in the level set array block is iteratively added.

Abstract: One embodiment of the present invention provides a system that selectively monitors store instructions to support transactional execution of a process, wherein changes made during the transactional execution are not committed to the architectural state of a processor until the transactional execution successfully completes. Upon encountering a store instruction during transactional execution of a block of instructions, the system determines whether the store instruction is a monitored store instruction or an unmonitored store instruction. If the store instruction is a monitored store instruction, the system performs the store operation, and store-marks a cache line associated with the store instruction to facilitate subsequent detection of an interfering data access to the cache line from another process. If the store instruction is an unmonitored store instruction, the system performs the store operation without store-marking the cache line.

Abstract: Embodiments of the present invention provide for multi-data receiving and processing by a network communication protocol. The present invention aggregates multiple data packets destined for the same application. The present invention also provides for header/payload splitting. The present invention also provides for the separate processing of aggregated headers and aggregated payloads. As a result, per-packet processing costs are reduced and data locality is increased.

Abstract: An object cache stores objects in a cyclic buffer to provide highly efficient creation of cache entries. The cache efficiently manages storage of a large number of small objects because the cache does not write objects into a file system as individual files, rather the cache utilizes cyclical buffers in which to store objects as they are added to the cache. Because of the use of a cyclic buffer, the high-overhead process of purging cache entries never needs to be performed. Cache entries are automatically purged as they are overwritten when the cyclic buffer becomes full and the input pointer wraps around from the end of a cyclic buffer to the beginning of a cyclic buffer. Additionally, in the event of a system crash or disk subsystem malfunction, inspect and repair time is independent of the size of the cache, as opposed to conventional file systems in which the time is proportional to the size of the file system.

Abstract: Embodiments of the present invention relate to a scriptable plug-in API. According to the invention, all of the interfaces in a conventional, non-scriptable plug-in API are mapped to similar interfaces in a scriptable plug-in API. There is no need to change the existing plug-in APIs. In one embodiment, a set of interfaces and a set of wrappers are used to bind the new, scriptable plug-in API to the old one. In another embodiment, C++ wrappers are written to bridge new API to the old one. Inter-threading calls for plug-ins are also made possible using a proxy that functions with scriptable interfaces. In another embodiment, the plug-in is written for a Mozilla™/Netscape™ 6.x browser. In another embodiment, the scripting languages used to develop the plug-in include Python, JavaScript, and Perl.