Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

2 results about "Queue" patented technology

In computer science, a queue is a collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue. This makes the queue a First-In-First-Out (FIFO) data structure. In a FIFO data structure, the first element added to the queue will be the first one to be removed. This is equivalent to the requirement that once a new element is added, all elements that were added before have to be removed before the new element can be removed. Often a peek or front operation is also entered, returning the value of the front element without dequeuing it. A queue is an example of a linear data structure, or more abstractly a sequential collection.

Queue scheduling method, device and system based on multi-tenant technology

ActiveCN113986497AEasy to understandProgram initiation/switchingComputer clusterMultitenancy
The invention provides a queue scheduling method, device and system based on the multi-tenant technology, and relates to the technical field of big data in a computer technology. The method is applied to a scheduling device in a multi-tenant system, the multi-tenant system comprises the scheduling device and at least one computer cluster, and the method comprises the steps of responding to a task calling request initiated by a target tenant, wherein the task calling request is used for indicating to process a to-be-processed task, determining a task queue corresponding to the to-be-processed task from a preset task queue list, wherein the task queue list is determined according to the queue state information of each task queue under the multi-tenant system, and sending a task processing request to the computer cluster corresponding to the target tenant, wherein the task processing request is used for indicating the task queue corresponding to the to-be-processed task, and the task processing request is used for indicating to process the to-be-processed task by adopting the resources of the task queue corresponding to the to-be-processed task, so that the reasonability and sufficiency of queue scheduling are improved.
Owner:BEIJING BAIDU NETCOM SCI & TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products