摘要:
A match-and-set lock has a locked operating state and an unlocked operating state controlled by the value C. The lock returns a value R=C, to an inquiring user seeking access to the resource. A return value R=0 denotes that the resource is free, and a return value R≠0 denotes that the resource is locked by another user. The lock is responsive to a command in the form (A, B) to B for C if A=C. Thus, the lock may be locked by issuing the command (A, B) where A=C and B≠0; and the lock may be released by issuing the command (A, B) where A=C and B=0. A deadlock condition may be avoided by setting the lock to the value B=P+T*(N+1), where P
摘要:
In general, this disclosure describes techniques for providing dynamic active participants in a real-time visual communication session between two or more participants. When there are more participants in the real-time visual communication session than computing devices connected to the communication session can support visual data from, a subset of the participants are chosen to be active participants. Visual data of the active participants are displayed by one or more of the computing devices. The active participants are chosen based on participation properties. Active participants may become passive and passive participants may become active based on the participation properties. The quality of visual data associated with active participants (e.g., compression rate, output display size, etc.) may be iteratively reduced as one or more of the passive participants become active.
摘要:
Aspects of the invention pertain to transmitting packet data across a computer network. The packets may be sent via one or more distinct routes from a source to a destination. Each route may employ multiple routers disposed along the network. Non-colliding routes are determined by transmitting pairs of probe packets along the routes. A first probe packet has a maximal length, and a second probe packet has a minimal length. Depending on the order of arrival of the probe packets, the system determines whether two transport layer ports at the destination device collide. If there is a collision, then the system searches for a set of non-colliding ports. Once the non-colliding ports are determined, application data may be sent as packets along the different routes to those ports.
摘要:
In general, one aspect of the subject matter described in this specification can be embodied in a method that includes receiving at a first device a first request for a physical address of a second device different from the first device, wherein the first request specifies a network address of the second device, and determining that a set of pending requests has a maximum number of requests, wherein the set of pending requests is ordered based on when the requests were received by the first device. The method can further include removing an oldest request from the pending requests and adding the first request to the pending requests, and processing a newest request in the pending requests by sending a message to the second device and receiving the physical address responsive to the message.
摘要:
A method for managing flow of packets comprises inputting a plurality of flow rules of various priorities to a router having a plurality of hardware resources, the plurality of hardware resources having varying levels of capability relative to each other. A first rule, for example a rule having a lowest priority, may be selected from among the plurality of flow rules, and it may be determined whether the first rule conflicts with any lower priority rules stored in the hardware resource with a highest capability. If the first rule conflicts with a lower priority rule in the hardware resource with the highest capability, the first rule may be stored in the resource with the highest capability. If the first rule does not conflict with a lower priority rule in the hardware resource with the highest capability, the first rule may be processed to identify the hardware resource with a lowest capability that can support the first rule, and the first rule may be stored in the identified resource.
摘要:
A method for metadata management for scalable processes, involving creating a process by a first home processor, wherein the process is associated with a process identification (ID), storing the processor ID and information identifying the first home processor in a global process look-up data structure (GPLD), requesting metadata associated with the process, searching the GPLD to obtain the first home processor of the process using the process ID, and retrieving the metadata associated with the process from the first home processor.
摘要:
A system for maintaining routing capabilities in a router having a failed control plane provides an active control plane in the router in communication with at least one external node, the active control plane running at least one routing process. A backup control plane may be interconnected with the active control plane, so that the active control plane may periodically transmit synchronization signals to the backup control plane. The backup control plane may update its state based on these synchronization signals. Moreover, the backup control plane may be programmed to take over the routing process of the active control plane if the active control plane fails.
摘要:
The present invention provides network interface monitoring and management that may be employed with link aggregation technologies. Multiple network interfaces may be aggregated into a single bond and data may be transferred to and from a backbone network via this aggregated bond. A link aggregation monitor employs a heartbeat generator, sniffer and data store to keep track of health and availability of network interfaces. The heartbeat generator sends heartbeats to the network interfaces, which pass the heartbeats around in a token ring configuration. If a network interface fails or otherwise goes offline, detection of this condition causes the monitor and heartbeat generator to prepare new or modified heartbeats so that data may be efficiently and accurately routed around the token ring and health of all remaining alive interfaces can be monitored properly. If a network interface re-enters or is added to the aggregate bond, new/modified heartbeats are then employed.
摘要:
A biological sample containment system and method are provided that include a container for storing the biological sample and an indicator affixed to the container for displaying at least one measured characteristics of the container or sample, wherein measurement of the characteristic is commenced by activation of the indicator. In another embodiment of the invention, a biological sample containment system and method are provided that include a container for storing the biological sample and a colored scale affixed to the container, wherein the colored scale facilitates identification of at least one characteristic of the biological sample. In yet another embodiment of the invention, a biological sample containment system and method are provided that include a container for collecting a biological sample and a label affixed to the container, wherein information relating to the biological sample or container is situated on the label.
摘要:
An approach is provided for performing software fault injection code testing in a framework that allows testers to place flexible tracing and monitoring actions into algorithmic scripts which provide instructions for dynamically switching called software program functions to corresponding fault injected functions during program execution and that allows testers to perform fault injection testing without requiring modification or access to the underlying source code of the software program being tested. The framework suspends execution of the software program when certain conditions are met, removes any existing linking to called functions, changes the software program's runtime dynamic linking, performs any other instructions provided by the algorithmic script, and then resumes the software program's execution until execution of the program is complete or until the framework is again instructed to change the software program's runtime dynamic linking.