Patent classifications
H04L2012/5681
METHODS, SYSTEMS, AND COMPUTER READABLE MEDIA FOR CAPTURING DROPPED PACKETS AT A SWITCHING FABRIC EMULATOR
One example method occurs at a switching fabric emulator providing an emulated switching fabric comprising emulated switching elements and associated packet queues, wherein the switching fabric emulator comprises at least one switching application-specific integrated circuit (ASIC) or programmable switching chip, the method comprising: during a test session: receiving, via at least a first physical port of the switching fabric emulator, packets from or to a system under test (SUT); detecting an occurrence of a dropped packet that happens while the packet is traversing the emulated switching fabric; encapsulating dropped packet data associated with the dropped packet, wherein the encapsulated dropped packet data indicates an emulated switching element or packet queue contributing to the occurrence of the dropped packet; and providing the encapsulated dropped packet data to an analyzer.
ACCESS NODE FOR DATA CENTERS
An access node that can be configured and optimized to perform input and output (I/O) tasks, such as storage and retrieval of data to and from network devices (such as solid state drives), networking, data processing, and the like. For example, the access node may be configured to receive data to be processed, wherein the access node includes a plurality of processing cores, a data network fabric, and a control network fabric; receive, over the control network fabric, a work unit message indicating a processing task to be performed a processing core; and process the work unit message, wherein processing the work unit message includes retrieving data associated with the work unit message over the data network fabric.
METHOD AND APPARATUS FOR ORDER ENTRY IN AN ELECTRONIC TRADING SYSTEM
Orders received by an electronic trading system are processed in batches based on the instrument to which an order relates. An incoming order is assigned to a queue of a queue set that makes up the batch according to a random process. Where orders are received from related trading parties, they are assigned to the same queue set according to their time of receipt. The batch has a random duration within defined minimum and maximum durations and at the end of the batch, the orders held in the queues are transferred to a matching thread of the trading system sequentially with one order being removed from each queue and a number of passes of the queues completed until orders have been removed.
Access node integrated circuit for data centers which includes a networking unit, a plurality of host units, processing clusters, a data network fabric, and a control network fabric
A highly-programmable access node is described that can be configured and optimized to perform input and output (I/O) tasks, such as storage and retrieval of data to and from storage devices (such as solid state drives), networking, data processing, and the like. For example, the access node may be configured to execute a large number of data I/O processing tasks relative to a number of instructions that are processed. The access node may be highly programmable such that the access node may expose hardware primitives for selecting and programmatically configuring data processing operations. As one example, the access node may be used to provide high-speed connectivity and I/O operations between and on behalf of computing devices and storage components of a network, such as for providing interconnectivity between those devices and a switch fabric of a data center.
Method and apparatus for order entry in an electronic trading system
Orders received by an electronic trading system are processed in batches based on the instrument to which an order relates. An incoming order is assigned to a queue of a queue set that makes up the batch according to a random process. Where orders are received from related trading parties they are assigned to the same queue set according to their time of receipt. The batch has a random duration within defined minimum and maximum durations and at the end of the batch, the orders held in the queues are transferred to a matching thread of the trading system sequentially with one order being removed from each queue and a number of passes of the queues completed until orders have been removed.
TECHNOLOGIES FOR JITTER-ADAPTIVE LOW-LATENCY, LOW POWER DATA STREAMING BETWEEN DEVICE COMPONENTS
Technologies for low-latency data streaming include a computing device having a processor that includes a producer and a consumer. The producer generates a data item, and in a local buffer producer mode adds the data item to a local buffer, and in a remote buffer producer mode adds the data item to a remote buffer. When the local buffer is full, the producer switches to the remote buffer producer mode, and when the remote buffer is below a predetermined low threshold, the producer switches to the local buffer producer mode. The consumer reads the data item from the local buffer while operating in a local buffer consumer mode and reads the data item from the remote buffer while operating in a remote buffer consumer mode. When the local buffer is above a predetermined high threshold, the consumer may switch to a catch-up operating mode. Other embodiments are described and claimed.
BUS CONVERTER
A device for coupling a fieldbus to a local bus for connection to at least one data bus subscriber, the device comprising a first unit that is connectable to the fieldbus and is adapted for sending and receiving data via the fieldbus; a second unit that is connectable to the local bus and is adapted for sending and receiving data via the local bus in at least one data packet; a data management unit that is connected to the first unit and the second unit, wherein the data management unit is adapted for transferring first symbols from data received via said first unit to said second unit in a sequence-dependent manner; and wherein the second unit is adapted to send at least one data packet including the first symbols on the local bus. In addition, a corresponding method for transferring data is described.
Prioritization for a set of data signals based on skew requirements
Examples herein disclose an identification of a set of skew requirements corresponding to a set of data signals. Based on the set of skew requirements, the examples prioritize an order of transmission for the set of data signals. The example queue the set of data signals in accordance with the prioritized order.
Using e-mail message characteristics for prioritization
Message prioritization may be provided. First, a message may be received and a priority level may be calculated for the message. If the message is not rejected for having a priority lower than a predetermined threshold, the message may be placed in a first priority queue. Next, the message may be de-queued from the first priority queue based upon the calculated priority level for the message. Distribution group recipients corresponding to the message may then be expanded and the priority level for the message may be re-calculated based upon the expanded distribution group recipients. Next, the message may be placed in a second priority queue. The message may then be de-queued from the second priority queue based upon the re-calculated priority level for the message and delivered.
Data processing method and device
Embodiments of the present disclosure provide a data processing method and a device. The method includes: determining, by a controller, a data packet filtering rule and a data forwarding path; sending, by the controller, the data packet filtering rule and configuration information carrying the data forwarding path to a first node, where the filtering rule is used to match configuration information corresponding to a data packet of the first node, the configuration information includes routing information corresponding to each node in the data forwarding path, routing information includes a queue identifier which is used to identify a transmission queue to which the data packet belongs; forwarding, by the first node and a remaining node, the data packet.