Abstract: A peer-to-peer IT (Information Technology) backbone. The system includes at least one IT server and a plurality of client computers arranged in a peer-to-peer IT backbone. Each of the client computers includes an in-band processor, an out-of-band (OOB) microcontroller, and a storage device coupled to the in-band processor and OOB microcontroller. The storage device includes a reserved area for the OOB microcontroller to enable an IT-administration to push IT payloads from the at least one IT server onto the reserved area of at least one of the plurality of client computers. The IT payloads are disseminated throughout the peer-to-peer IT backbone by the OOB microcontroller of the client computers.

Abstract: A web page architecture is provided for enabling a user browse the web within an inline frame embedded in a web page and drag and drop content rendered in the inline frame into a receiving panel in the web page for transmission to the user's mobile device. The delivery mechanism to receive such content on the user's mobile device may be either through SMS messaging or through communicating with a client application on the user's mobile device.

Abstract: The present invention allows a structure of an entire system including various peripheral devices to be visually confirmable, allows a user to easily grasp or see the entire system, and allows the entire system to be effectively used. Thus, a CPU acquires a resource information structure and a status of each peripheral device by communicating with these devices, and a virtual system configuration display unit causes a display unit to display a system configuration based on the acquired resource information structure and each peripheral device status such that specific icons capable of being discriminated for respective functions are displayed to be connected on a virtual network path.

Abstract: Methods and Systems for determining a user state for a member of a social network are described. According to one embodiment, a method comprising receiving in a network of associated users user state information for a first user, wherein the network of associated users comprises user established relationships between users, determining a current user state for the first user; and outputting to a second user the user state information based at least in part on the current user state and a relationship based permission status is set forth.

Abstract: In one embodiment, a method comprises receiving a request to modify a subscriber connection to a network element. The method also includes modifying attributes of the subscriber connection, within a memory of the network element, without disconnecting the subscriber connection from the network element.

Abstract: The present invention relates to a system and methodology to enable a variety of information associated with one or more notification sources to be directed to one or more notification sinks via a notification platform architecture. The architecture includes a context analyzer for determining a user's state such as location and attentional focus, wherein the user's state is employed by a notification manager to make decisions regarding what, when and how information generated by the notification sources should be forwarded to the notification sinks, for example. These decisions can include a cost benefit analysis wherein considerations are given as to whether the benefits of notifying the user are outweighed by the costs of disrupting the user. Decision-theoretic policies and/or somewhat less formal heuristic policies can be employed to enable the decision-making process within the notification manager.

Abstract: A method and system are provided for processing large amounts of data associated with messages and other transmissions that are routed through a data communications system. A distributed system is used to process the data in parallel. The system includes a master processor and at least one additional processor. The master processor is responsible for obtaining the data and routine the data to the additional processors. The additional processors filter the data for information pertaining to the data and the filter results are combined. An on-demand filter can be run in parallel from a web server which allows dynamic filtering of information that is of interest at a particular time.

Abstract: Described herein are embodiments that facilitate the streaming of content over an Internet Protocol (IP) network, transparently, in a Network Address Translation (NAT) environment or a non-NAT environment.

Abstract: Techniques for associating one or more real-time sessions, which are each signaled separately, into one logical conversation without a centralized control, are provided. Some techniques share a conversation identifier that uniquely identifies a logical conversation across the real-time sessions that belong to the logical conversation. The conversation identifier is generated before the first real-time session belonging to the logical conversation is signaled, and distributed to the other participants in the logical conversation via the signaling channel. A called participant can use the conversation identifier for associating the previous real-time sessions belonging to the logical conversation, and for making new invitations for other real-time sessions that are associated with the same logical conversation.

Abstract: The present invention discloses a method allowing dynamically integrating remote portlets into each Portal by providing local portlets as remote portlet Web-Services by providing, to each Portal-Server, a publishing functionality allowing electronic creation of a service description for each single local portlet and publishing it into a Central-Registry and a find/binding functionality to find remote portlet Web-Services via the Central-Registry and bind them using the service description for accessing the remote portlet. Preferably, each Portal-Server includes a Portlet-Registry component as well as a Portlet-Proxy. The Portlet-Registry provides service description to the Portlet-Proxy that establishes a SOAP-communication with a remote Portal-Server providing the remote portlet Web-Service to be selected. The main advantage of the present invention is that local portlets become available for all Portal-Server without requiring local installation of the portlet code itself.

Abstract: A method that enables application instances to pass block mode storage requests directly to a physical I/O adapter without run-time involvement from the local operating system or hypervisor is provided. In one aspect of the method, a mechanism is provided for handling user space creation and deletion operations for creating and deleting allocations of linear block addresses of a physical storage device to application instances. For creation, it is determined if there are sufficient available resources for creation of the allocation. For deletion, it is determined if there are any I/O transactions active on the allocation before performing the deletion. Allocation may be performed only if there are sufficient available resources and deletion may be performed only if there are no active I/O transactions on the allocation being deleted.

Abstract: A computer architecture and programming model for high speed processing over broadband networks are provided. The architecture employs a consistent modular structure, a common computing module and uniform software cells. The common computing module includes a control processor, a plurality of processing units, a plurality of local memories from which the processing units process programs, a direct memory access controller and a shared main memory. A processing system is provided for processing programs and data. The processing system has a processing unit and multiple sub-processing units. Each sub-processing unit includes a dedicated local memory for storing programs and data. The dedicated local memory of each respective sub-processing unit is not a cache memory. In an alternative, multiple computing devices may connect to one another via a communications network, and each computing device may include at least one processing element having the processing unit and sub-processing units.

Abstract: Each node in the network broadcasts it unique identifier to the other nodes. Each node assigns a different network address to each of the nodes based on the unique identifier received from the node. However, each node assigns the network addresses in a common predetermined manner. Thus, each node arrives at the same assignment of network addresses. In a preferred embodiment, the assignment of network addresses is maintained as an address table at each node.

Abstract: In a multi-threaded processor, thread priority variables are set up in memory. The actual assignment of thread priority is based on the expiration of a thread precedence counter. To further augment, the effectiveness of the thread precedence counters, starting counters are associated with each thread that serve as a multiplier for the value to be used in the thread precedence counter. The value in the starting counters are manipulated so as to prevent one thread from getting undue priority to the resources of the multi-threaded processor.

Abstract: Described are methods and systems that allow partial speculation (e.g., speculation within constraints). With partial speculation, after a fault is detected for example, speculation remains enabled for processor registers and other memories private to a microprocessor, while speculation normally permitted for certain other operations is suspended. Accordingly, while the fault is dispatched, some speculation is permitted as opposed to suspending all speculation. As such, microcode that makes use of speculation can be written.

Abstract: A storage control device 2A includes a host interface control unit 3, a storage control firmware A, and electrically rewritable non-volatile memory 7 and, using non-volatile memory 7, stores necessary information during exchange of an activation program of the storage control firmware A, and using the information exchanges the activation program without disconnection to a host 1 and without erroneous response to a command from the host 1.

Abstract: A method and system for managing global queues is provided. In one example, a method for implementing a global queue is provided. The queue has a head pointer, a tail pointer, and zero or more elements. The method comprises one or more functions for managing the queue, such as an “add to end” function, an “add to front” function, an “empty queue” function, a “remove from front” function, a “remove specific” function and/or a “lock queue” function. In some examples, the method enables an element to be added to the queue even when the queue is in a locked state.

Abstract: A multithreaded architecture is disclosed for managing external memory updates for fault detection in redundant multithreading systems using speculative memory support. In particular, a method provides input replication of load values on a SRT processor by using speculative memory support to isolate redundant threads form external updates. This method thus avoids the need for dedicated structures to provide input replication.

Abstract: A computer system with enhanced integrated debug facilities is described. According to one aspect, step-by-step execution of an instruction sequence is implemented where each instruction is guarded. If, after guard resolution, the instruction is committed, a divert routine is executed. If the instruction is not committed, the next instruction in the sequence is executed. According to another aspect, a stall state can be set at the decode unit either by reading stall attributes associated with debug instructions, or responsive to a stall command from an on-chip emulation unit.

Abstract: An apparatus and method for maximizing buffer utilization in an I/O controller using credit management logic contained within the I/O controller. The credit management logic keeps track of the number of memory credits available in the I/O controller and communicates to a chipset connected to the I/O controller the amount of available memory credits. The chipset may then send an amount of data to the I/O controller equivalent to or less than the communicated available amount of memory credits to reduce the occurrence of a “retry” event. The amount of available memory credits is determined by comparing the available memory in each buffer within the I/O controller and designating that the “available” amount of memory for the I/O controller is an amount equivalent to the amount of memory contained in the buffer with the least amount of available memory. This “available” amount of I/O controller memory may then be converted into memory credits and communicated to the chipset.