Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Scheduling method and device for first in first out queue

A first-in-first-out queue and scheduling method technology, applied in the field of first-in-first-out queue scheduling methods and devices, can solve the problems of high overhead of adding and unlocking, poor multi-core concurrent processing performance, etc., and achieve the effect of improving scheduling efficiency

Active Publication Date: 2014-11-26
NEW H3C TECH CO LTD
View PDF7 Cites 17 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0006] In view of this, one of the purposes of the embodiments of the present invention is to propose a queue scheduling method, which is used to solve the counting problem of high adding and unlocking overhead and poor multi-core concurrent processing performance when multi-core devices use spin locks to implement FIFO queue scheduling

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Scheduling method and device for first in first out queue
  • Scheduling method and device for first in first out queue
  • Scheduling method and device for first in first out queue

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0038] The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some, not all, embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without creative efforts fall within the protection scope of the present invention.

[0039] It should be noted that, in the case of no conflict, the embodiments of the present invention and the features in the embodiments can be combined with each other.

[0040] Below in conjunction with accompanying drawing, each preferred embodiment of the present invention is described further:

[0041] figure 1It is a schematic diagram of the queue data structure used by the FIFO queue scheduling method supporting multiple producers and multiple consumers wit...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a scheduling method and device for a first in first out (FIFO) queue. According to the scheme, no spin lock is used, a current head count H and a current tail count T of the FIFO queue are read through atomic operation, and whether other cores execute enqueuing or dequeuing operation and count operation of an actual enqueuing or dequeuing count is judged in an atomic comparing exchange function. According to the scheduling method and device for the first in first out queue, the range needing a protection code segment of multi-core mutual exclusion operation is very small, expenditure for multi-core locking and unlocking is avoided, and the scheduling efficiency of multi-core equipment for the FIFO queue can be improved.

Description

technical field [0001] The present invention relates to the field of data communication, in particular to a first-in-first-out (First In First Out, FIFO) queue scheduling method and device. Background technique [0002] FIFO queue is the most basic queue form supported by data communication equipment. It adopts the form of a single queue and can cache multiple data packets. The queue length is usually configurable, and data packets are queued in a first-in-first-out manner. [0003] At present, when implementing FIFO queues in existing multi-core systems, the scheduling of entering and exiting queues is usually completed in the form of spin locks. Executing queue entry and exit. Take enqueue as an example. When a core executes an enqueue operation, it will try to lock the enqueue operation. If the lock is successful, it will wait until the message enqueue is completed after the lock is successful. During the entire process, other cores cannot execute the enqueue operation c...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04L12/863
Inventor 董君
Owner NEW H3C TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com