A computer-implemented method on a device. The device has hardware including storage. The method includes obtaining log event data from at least one component or service on the device that is to be delivered to a component or service on a distinct device. Each log event data item has a priority. If a connection to an external location is lost, at least some of the log event data items are selectively stored in the storage, wherein the storing is based on priority of the log event data items. Otherwise, if the connection is not lost, at least some of the log event data items are sent to the at least one external location.

A system for using staging buffers in broadcast or multicast operations is disclosed. In some embodiments, the system comprises a server fabric adapter (SFA) communicatively coupled to a plurality of accelerators. The system is configured to provide a memory tier that is accessed by the plurality of accelerators; receive data in a send queue of the memory tier; establish an association between buffers of the send queue and one or more receive queues based on a pattern of sharing defined by one or more of the plurality of accelerators; and transmit the data to the one or more accelerators by sending the data from the send queue to the one or more receive queues based on the association.

Systems and techniques are disclosed for a buffer management system that dynamically and automatically adjusts operational buffers in resources based on resource utilization based on buffer parameters. Buffer parameters for a resource can include a target utilization, a buffer capacity, a minimum buffer capacity, and a maximum buffer capacity. The buffer management detects changes in utilization, such as a number of operations performed in a time period and determines whether a candidate buffer capacity determined using the buffer capacity parameter and the current utilization is between the minimum buffer capacity and the maximum buffer capacity. If so, the buffer management system sets the buffer capacity to the candidate buffer capacity, otherwise the buffer management system sets the buffer capacity to the minimum or maximum buffer capacity as applicable.

Streaming media, such as audio or video files, is sent via the Internet. The media are immediately played on a user's computer. Audio/video data is transmitted from the server under control of a transport mechanism. A server buffer is prefilled with a predetermined amount of the audio/video data. When the transport mechanism causes data to be sent to the user's computer, it is sent more rapidly than it is played out by the user system. The audio/video data in the user buffer accumulates; and interruptions in playback as well as temporary modem delays are avoided.

Streaming media, such as audio or video files, is sent via the Internet. The media are immediately played on a user's computer. Audio/video data is transmitted from the server under control of a transport mechanism. A server buffer is prefilled with a predetermined amount of the audio/video data. When the transport mechanism causes data to be sent to the user's computer, it is sent more rapidly than it is played out by the user system. The audio/video data in the user buffer accumulates; and interruptions in playback as well as temporary modem delays are avoided.

Methods for modifying a B-tree are disclosed. According to an implementation, a computing device receives requests for updates to a B-tree, groups two or more of the requests into a batch that are destined for a particular node on the B-tree, but refrains from modifying the node until a buffer of a node above it is full (or will be full with this batch of requests). Once the buffer is full, the computing device provides the requests to that particular node. The techniques described herein may result in the computing device carrying out fewer of reads from and writes to storage than existing B-tree maintenance techniques, thereby saving time and bandwidth. Reducing the number of reads and writes also saves money, particularly when the storage is controlled by a third party SaaS provider that charges according to the number of transactions.

Methods for modifying a B-tree are disclosed. According to an implementation, a computing device receives requests for updates to a B-tree, groups two or more of the requests into a batch that are destined for a particular node on the B-tree, but refrains from modifying the node until a buffer of a node above it is full (or will be full with this batch of requests). Once the buffer is full, the computing device provides the requests to that particular node. The techniques described herein may result in the computing device carrying out fewer of reads from and writes to storage than existing B-tree maintenance techniques, thereby saving time and bandwidth. Reducing the number of reads and writes also saves money, particularly when the storage is controlled by a third party SaaS provider that charges according to the number of transactions.

The subject technology relates to the management of a shared buffer memory in a network switch. Systems, methods, and machine readable media are provided for receiving a data packet at a first network queue from among a plurality of network queues, determining if a fill level of a queue in a shared buffer of the network switch exceeds a dynamic queue threshold, and in an event that the fill level of the shared buffer exceeds the dynamic queue threshold, determining if a fill level of the first network queue is less than a static queue minimum threshold.

The present disclosure generally discloses a data plane configured for processing function scalability. The processing functions for which scalability is supported may include charging functions, monitoring functions, security functions, or the like.

A write preference determination unit (30A) compares a reception rate of packets received from the lines of a first network (NW1) with a reception rate threshold for write preference determination, and in a case where the reception rate exceeds the reception rate threshold, determines that preference of a write operation is necessary. A write preference control unit (30B) increases, out of a total access bandwidth of a packet buffer (BUF), a write bandwidth for a packet write operation to the packet buffer (BUF) as compared to a read bandwidth for a packet read operation from the packet buffer (BUF) in a case where the write preference determination unit (30A) determines that the preference is necessary, thereby preferentially executing the packet write operation to the packet buffer. This suppresses occurrence of linked discard of reception packets caused by a shortage of the write bandwidth.