Abstract: In a switch system L groups of the line switch elements are connectable to cables that include L links such that each of the L links within a cable connect to a switch element of a respective one of the L groups. Fabric switch elements are connected such that a fabric switch element is connected to the line switch elements of one of the group of line switch elements.

Abstract: An injection/ejection mechanism is provided for mounting and dismounting of a unit in a chassis. The mechanism includes a drive screw that cooperates with a threaded barrel, the threaded barrel being rotatable for engagement and disengagement with at least one chassis component. The drive screw can be rotated in a first rotational direction to urge the threaded barrel in a first longitudinal direction against at least one chassis component for mounting of the unit and can be rotated in an opposite rotational direction to urge the threaded barrel in an opposite longitudinal direction against at least one chassis component for dismounting of the unit.

Abstract: An execution unit adapted to perform at least a portion of the Data Encryption Standard. The execution unit includes a Left Half input; a Key input; and a Table input. The execution unit also includes a first group of transistors configured to receive the Table input, perform a table look-up, and output data. The execution unit further includes a first exclusive-or operator having two inputs and an output. The first exclusive-or operator is configured to receive the Left Half input and the Key input. The execution unit also includes a second exclusive-or operator having two inputs and an output. The second exclusive-or operator is configured to receive the data output by the first group of transistors and to receive the output of the first exclusive-or operator. The execution unit also includes a third exclusive-or operator having two inputs and an output. The third exclusive-or operator is configured to receive the Left Half input and the data output by the first group of transistors.

Abstract: A network trace utility is provided. The network trace utility receives and copies packets in a secure session of (at least) two-way network communication between a client and a server. The network trace utility receives an administrator password, and uses a hash of the administrator password to decrypt the first session key. The network trace utility then decrypts one or more additional session keys, each one using the preceding session key. Then, the network trace utility decrypts the machine key using one of the session keys. A hash of the machine key is used to decrypt additional packets in the secure session. The network trace utility enables the contents of one or more additional packets in the secure session to be displayed to the user.

Abstract: In a system having a cluster of system components interconnected by a cluster interconnect fabric, the system components include out-of-band management network interfaces to an out-of-band management network. The system is configured to use the cluster interconnect fabric and the out-of-band management network interfaces to determine the overall connectivity and status of the cluster.

Abstract: A method of providing switch arbitration for the passing of packets between transmitters and receivers in a switch having a plurality of transmitters and receivers, comprises globally distributing information about buffer contents and packet requests between transmitters and receivers.

Abstract: A computer implemented method and system for filtering incoming electronic messages based on user objectives is disclosed. For example, automated assistance can be provided in realizing a user objective of filtering electronic mail (e-mail) messages associated with a “conversation” thread. The electronic message filtering system can receive an e-mail message, examine attributes or characteristics of the e-mail message, determine if a rule has been established for messages with the characteristics of the incoming message, and if there has been a rule set up, automatically implement an action in accordance with the rule. For example, when electronic messages with particular information in the header (e.g., a particular subject) are received, the messages are automatically moved to a designated trash folder. Additionally, finer granularity of message management can be achieved (e.g., an action is automatically implemented to display a message from a particular sender at the top of a list).

Abstract: A CPU is provided with an ability to modify its operation in accordance with an encryption key. When a program is compiled, the program is modified in order that execution may be performed with the CPU with its operation modified. In order to execute program instructions, the buffer interdependencies must match that expected by the compiler. This makes analysis of the program operation extremely difficult. The instruction buffer on a keyed microprocessor contains logic which is able to route a subset of the instruction bits on the microprocessor. This selects destination logic gates in the microprocessor which eventually reach a programmable instruction decoder and an instruction buffer interdependency checking logic block.

Abstract: One embodiment of the present invention provides a system that facilitates a fast execution restart following speculative execution. During normal operation of the system, a processor executes code on a non-speculative mode. Upon encountering a stall condition, the system checkpoints the state of the processor and executes the code in a speculative mode from the point of the stall. As the processor commences execution in speculative mode, it stores copies of instructions as they are issued into a recovery queue. When the stall condition is ultimately resolved, execution in non-speculative mode is recommenced and the execution units are initially loaded with instructions from the recovery queue, thereby avoiding the delay involved in waiting for instructions to propagate through the fetch and the decode stages of the pipeline. At the same time, the processor begins fetching subsequent instructions following the last instruction in the recovery queue.

Abstract: A method for caching a block, which includes receiving a request to store the block in a cache and determining whether the cache is able to expand. If the cache is not able to expand, then determining whether evictable blocks are present in the cache and, if evictable blocks are present in the cache determining whether a total size of the evictable blocks is greater than or equal to a size of the block, evicting a sufficient number of the evictable blocks from the cache and storing the block in the cache, if the total size of the evictable blocks is greater than or equal to the size of the block, and activating a cache throttle, if the total size of the evictable blocks is less than the size of the block.

Abstract: A method for testing a substrate by using a photoemission microscope is provided which includes providing the substrate and applying a reverse bias voltage to the substrate. The method further includes detecting light emissions from a top surface of the substrate and characterizing viability of the substrate from the detection of the light emissions.

Abstract: A system and method for dynamically calculating margin for a set of computer resources (e.g., processors, disk storage, memory, communications). The headroom of a set of resources is equal to the total capacity of the resources minus a margin. Margin is a portion of the total capacity not to be used, so as to allow for acceptable response times. An initial margin may be selected using a graph plotting total resource utilization level percentage against response time. For a desired or acceptable response time factor, the initial margin is selected as 100% minus the utilization percentage that yields the selected response time factor. Then, as the workload is run, data are collected showing response times for different load levels. A modified curve is generated (e.g., using standard regression) and a new margin selected from that curve.

Abstract: A configuration state of a networked system is automatically adjusted to achieve optimal performance. The networked system is defined by a plurality of data exchange entities having one or more tunable parameters. Networked system performance is monitored and performance metrics are stored to a database. The performance metrics are analyzed along with network and system rules and constraints, and the particular configuration of the networked system. The tunable parameters are automatically adjusted to achieve optimal networked system performance.

Abstract: In one embodiment, a distributed simulation system may include a first node configured to participate in a simulation and a second node configured to transmit a hot pull command designating the first node. The first node does not participate in the simulation responsive to the hot pull command. In another embodiment, A distributed simulation system may include a first node configured to participate in a simulation and a second node configured to transmit a hot plug command designating the first node. The first node does not participate in the simulation prior to the hot plug command. Additionally, the first node begins participation in the simulation responsive to the hot plug command.

Abstract: A serial-write, random-access read, memory addresses applications where the data in the memory may change more frequently than would make a PROM suitable, but that changes much less frequently than would require a RAM. This enables the circuit designer to optimize the memory for fast reads, and enables reads to be pipelined. One embodiment of the present invention provides a system that facilitates a serial-write, random-access read, memory. The system includes a plurality of memory cells and a serial access mechanism for writing data into the plurality of memory cells. The system also includes a parallel random-access mechanism for reading data from the plurality of memory cells.

Abstract: Methods, systems, and articles of manufacture consistent with the present invention improve drawing operations for drawing an object that has object information onto a background image, which has background image information, already displayed on a display device. A sub-region of the object including at least one pixel intersected by a boundary of the object is determined, where the sub-region corresponds to a portion of the background image information. It is determined whether the portion of the background image information corresponding to the sub-region is stored locally with respect to a program or remotely with respect to the program. When it is determined that the portion of the background image information is stored locally, the portion of the background image information is retrieved locally to facilitate generating a redrawn sub-region of the object.

Abstract: A method of tagging a manufactured product with a passive tag includes processing a subset of a plurality of unique combinations of at least two axis ratios, where the subset is determinable by a plurality of parameters that define a portion of a coordinate space, to determine a first particular unique combination of the at least two axis ratios. A gas having the determined particular one unique combination of at least two axis ratios is incorporated into the manufactured product. The product to be tagged may be a first product, characterized by a first particular characteristic, and a second product is characterized by a second particular characteristic different from the first particular characteristic. The unique combination of at least two axis ratios is a first unique combination.

Abstract: System and method for decentralized entity presence are described. Presence services may collaborate to form a presence service view on the network. A node providing an entity on the network may provide an entity advertisement to a presence service to advertise the entity's presence on the network. The presence information may be indexed locally by a presence service, and the indexes may be shared with one or more other presence services within the presence service view. A presence service may accept queries from nodes for a specific entity, and walk the query within the presence service view to locate the target entity. The query may then be forwarded to the node advertising the presence entity. The node providing the entity may respond directly to the querying node without going through the presence service. A presence contract may then be negotiated between the nodes without going through the presence service.

Abstract: Methods and apparatuses are disclosed for transferring a method call from an invoke thread to an event dispatch thread. The invoke thread and the event dispatch thread may execute independent of one another and the event dispatch thread may have an associated queue. The method may include defining a new call on the invoke thread. The new call may include identification of a method, identification of an object, one or more arguments, and a coalescing indicator indicating a type of coalescing for the call. The method may further include sending, during execution of the invoke thread, the new call to the queue, one or more previous calls being stored in the queue, and coalescing the new call with one of the previous calls in the queue according to the type of coalescing indicated by the coalescing indicator.

Abstract: An approach for allocating resources to an apparatus based on resource requirements generally involves a resource allocator receiving a request that specifies resource requirements for the apparatus. A resource allocator determines whether resources are available that satisfy the resource requirements. If resources are available that satisfy a resource requirement, the resource allocator indicates that the resource requirement is fulfilled and the resources are allocated to the apparatus. If resources are not available that satisfy a resource requirement, the resource allocator indicates that the resource requirement is not fulfilled and the resources are not allocated to the apparatus. The apparatus is implemented based on the allocated resources. A resource requirement can be optional so that if the optional resource requirement is not fulfilled, the apparatus can still be implemented.