Techniques are provided for tracking application programming interface (API) requests in a cloud computing environment. For example, a method for tracking API requests is implemented by an API gateway. The API gateway receives an API request which comprises a given API endpoint to access a target service of a computing system. The API gateway determines if the received API request is valid. In response to determining that the received API request is valid, the API gateway accesses at least one API counter associated with the given API endpoint of the received API request, wherein the at least one API counter is configured to count a number of times that the given API endpoint is accessed. The API gateway increments a count of the at least one API counter by one, and the API gateway routes the API request to the target service for execution.

A computing network includes nodes of different work groups. Nodes of a work group are dedicated to transactions of the work group. If a node of a first work group is predicted to have an idleness window, a second work group may borrow the node to execute a transaction of the second work group. At least a subset of steps of the transaction may be categorized into a step group. Trees of a transaction may be categorized into one or more tree groups. A node is selected for executing a transaction, if the predicted idleness duration of the node is sufficient relative to the predicted runtime of the transaction, the step group, and/or tree group. A credit system is maintained. A first work group transfers a credit to a second work group when borrowing a node of the second work group for executing a transaction of the first work group.

A computing network includes nodes of different work groups. Nodes of a work group are dedicated to transactions of the work group. If a node of a first work group is predicted to have an idleness window, a second work group may borrow the node to execute a transaction of the second work group. At least a subset of steps of the transaction may be categorized into a step group. Trees of a transaction may be categorized into one or more tree groups. A node is selected for executing a transaction, if the predicted idleness duration of the node is sufficient relative to the predicted runtime of the transaction, the step group, and/or tree group. A credit system is maintained. A first work group transfers a credit to a second work group when borrowing a node of the second work group for executing a transaction of the first work group.

Techniques are disclosed relating to methods that include initializing, by a computer in a computer system, an event counter that includes a plurality of sub-counter groups, each plurality of sub-counter groups including at least two sub-counters located on different nodes of a plurality of nodes in the computer system. In response to an occurrence of an event associated with the event counter, the method may include the computer selecting a particular sub-counter group of the plurality of sub-counter groups to update, and sending, to sub-counters corresponding to the particular sub-counter group, a request to update a sub-counter value for the particular sub-counter group. In response to a request for a current count value of the event counter, the method may include outputting, by the computer, a sum of the sub-counter values for the plurality of sub-counter groups as the current count value.

Various implementations described herein are directed to technologies for providing error detection for a disk drive of a digital video recorder (DVR). Access data is measured according to a degree of usage of a disk drive of a DVR. The access data is stored. The stored access data is analyzed to detect performance degradation of the disk drive.

A controller for controlling a nonvolatile memory device comprising: a read count table including a plurality of read count data, wherein each of the read count data includes a read count value for one data storage region; a read count address table including a read count address indicating an address of a memory region where the read count data is stored; a flash translation layer (FTL) configured to control an operation of the nonvolatile memory device, and manage the read count table and the read count address table; and a flash interface layer (FIL) configured to control data communication between the FTL and the nonvolatile memory device, and update the read count value based on the read count address when read operation is performed on the data storage region.

An image processing apparatus includes a connection unit, a first power supply unit, a second power supply unit, and a control device. The connection unit is connected to an electronic apparatus including a controlled device and a communication relay unit. The first power supply unit can supply power to the controlled device. The second power supply unit can supply power to the communication relay unit. The control device is capable of switching a power supply state by the first power supply unit and the second power supply unit between at least a first stop state in which power supply by the first power supply unit is continued and power supply by the second power supply unit is stopped and a second stop state in which power supply by the first power supply unit and the second power supply unit is stopped.

An accelerator circuit including a control interface to receive a stream of instructions, a first memory to store an input data, and an engine circuit including a dispatch circuit to decode an instruction of the stream of instructions into a plurality of commands, a plurality of queue circuits, each of the plurality of queue circuits supporting a queue data structure to store a respective one of the plurality of commands decoded from the instruction, and a plurality of command execution circuits, each of the plurality of command execution circuits to receive and execute a command extracted from a corresponding one of the plurality of queues.

An improved SDK includes a set of APIs and a crash handler registered with the operating system. Each API is an interface accessible by a computer software application. Up on entrance, each API determines the current thread identifier, and inserts it into a list if it is not already in the list. Each thread identifier corresponds to an API call counter, which is incremented by one at the entrance and decremented by one at the exit point of the API. The SDK also records the identifier of the thread it creates for callback functions. When a crash occurs, the crash handler is executed. It determines that the crash is related to a callback interface if the crash thread identifier matches the callback thread identifier. The crash is determined to be caused by the SDK if the API call counter corresponding to the crash thread identifier is greater than zero.

A method, a system, and a computer program product for placement or storage of data structures in memory/storage locations. A type of a data structure for storing data and a type of data access to the data structure are determined. The type of data access includes a first and a second type of data access. A frequency of each type of access to each type of data structure accessed by a query is determined. Using the determined frequency, a number of first type of data accesses to the data structure is compared to a number of second type of accesses to the data structure. The numbers of first and second types of data access are compared to a predetermined threshold percentage of a total number of data accesses to the data structure. Based on the comparisons, a physical memory location for storing data is determined.