Patents
Literature
Patsnap Eureka AI that helps you search prior art, draft patents, and assess FTO risks, powered by patent and scientific literature data.

2 results about "Matching game" patented technology

Matching games are games that require players to match similar elements. As the name implies, participants need to find a match for a word, picture, or card. For example, students place 30 word cards; composed of 15 pairs, face down in random order. Each person turns over two cards at a time, with the goal of turning over a matching pair, by using their memory. This is also known as the Pelmanism principle, after Christopher Louis Pelman, a British psychologist of the first half of the 20th century.

Toys (matching games)

1. Name of the product in this design: Toy (Matching Game). 2. Purpose of this design: For play. 3. The key design feature of this product is its shape. 4. The image or photograph that best illustrates the design's key points: a 3D model.
Owner:余枞洁

Resource management and task scheduling method for reconfigurable hardware accelerator oriented heterogeneous computing cluster

ActiveCN117785421BComputer hardwareMatch algorithms
This invention discloses a method for resource management and task scheduling of heterogeneous computing clusters for reconfigurable hardware accelerators, comprising: a management control node dividing time into equally spaced scheduling time slots; at each scheduling time slot, the management control node collecting request processing tasks arriving in the previous scheduling time slot and the currently idle computing resources of the heterogeneous computing cluster; the management control node establishing a three-sided matching game framework for request processing tasks, service functions, and heterogeneous computing nodes; the management control node defining the preference criteria of each party based on the optimization objective; the management control node running a three-sided stable matching algorithm for matching; the management control node offloading request processing tasks to the heterogeneous computing nodes where the matching service functions are located for processing based on the matching results; waiting for the next scheduling time slot to arrive, and repeating the above steps. This method can effectively reduce the total task processing latency while maintaining a high task completion rate and task satisfaction.
Owner:NAT UNIV OF DEFENSE TECH