Abstract: Systems and methods for matching orders across a plurality of input ports are disclosed herein. A system may include a plurality of input ports, a processor, and a storage medium. The processor may be configured to receive a plurality of data packets from the input ports, defining a first message and a second message, wherein the first and second messages have a message type. The processor may be configured to sequence the first and second messages into a sequence of record based on one or more arbitration rules; evaluate the first message and the second message based on the sequence of record to generate matching information; and publish, over the network interface, the matching information. The processor may be further configured to perform immediate publication of the sequence of record.

Abstract: A networked system for processing event response pairs across multiple locations includes a memory storing a plurality of event response pairs, each comprising an event predicate and an associated underlying order; a network interface receiving a continuous stream of trigger information entries from internal and external sources; and a processor coupled to the memory and network interface. The processor evaluates each received trigger information entry against the stored event predicates to identify one or more matches, prepares the associated underlying orders for transmission to specified destinations, sequences the prepared underlying orders based on a multi-response handling algorithm, and transmits the sequenced underlying orders via the network interface to the specified destinations.

Abstract: High-throughput BPF map manipulations with uprobes are disclosed. A method for manipulating a Berkeley Packet Filter (BPF) map comprises running a user program in a user space of a computing environment. The user program includes a trigger function. A corresponding kernel BPF probe is installed by the user program on the trigger function. The kernel BPF probe is triggered by reaching a memory address of the trigger function in the user space. The trigger function includes one or more arguments that the BPF map agent interprets as operation parameters. The BPF map agent performs one or more operations to manipulate a BPF map in the kernel space based on the operation parameters.

Abstract: High-throughput BPF map manipulations with uprobes are disclosed. A method for manipulating a Berkeley Packet Filter (BPF) map comprises running a user program in a user space of a computing environment. The user program includes a trigger function. A corresponding kernel BPF probe is installed by the user program on the trigger function. The kernel BPF probe is triggered by reaching a memory address of the trigger function in the user space. The trigger function includes one or more arguments that the BPF map agent interprets as operation parameters. The BPF map agent performs one or more operations to manipulate a BPF map in the kernel space based on the operation parameters.

Abstract: Processing circuitry for computer memory management includes memory reduction circuitry to implement a memory reduction technique; and reference count information collection circuitry to: access a memory region, the memory region subject to the memory reduction technique; obtain an indication of memory reduction of the memory region; calculate metrics based on the indication of memory reduction of cache lines associated with the memory region; and provide the metrics to a system software component for use in memory management mechanisms.

Abstract: Processing circuitry for computer memory management includes memory reduction circuitry to implement a memory reduction technique; and reference count information collection circuitry to: access a memory region, the memory region subject to the memory reduction technique; obtain an indication of memory reduction of the memory region; calculate metrics based on the indication of memory reduction of cache lines associated with the memory region; and provide the metrics to a system software component for use in memory management mechanisms.