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

Multiple-priority level and optimal dynamic threshold buffer storage managing algorithm

A multi-priority, cache management technology, applied in the direction of electrical digital data processing, instruments, etc., can solve the problem of insufficient cache utilization

Inactive Publication Date: 2003-01-08
TSINGHUA UNIV
View PDF0 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0016] The above multi-priority DT algorithm is based on the DT algorithm, and there is also the problem of insufficient cache utilization

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
  • Multiple-priority level and optimal dynamic threshold buffer storage managing algorithm
  • Multiple-priority level and optimal dynamic threshold buffer storage managing algorithm
  • Multiple-priority level and optimal dynamic threshold buffer storage managing algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0036] figure 2 Flowchart for the computer that loops through each arrival. In order to determine whether to receive the arriving packet, we must first modify the current queue field value according to the algorithm (t).

[0037] This algorithm has been implemented by hardware in high-end routers, and it can also be implemented by software in low-end routers.

[0038] Now give an example pair figure 2 The flow chart is described.

[0039] Initial conditions: The system has two port queues called ports 0 and 1, the corresponding priorities are 0 and 1, the maximum priority is 0, and the initial length of the two port queues is 0; assuming the maximum size is 1.5KB, the initial When , the domain value of the two queues is 1.5KB. Cache size B=10,000KB, control factor α=0.9, available cache resource α*B=9,000KB.

[0040] At some point after the system reaches stability: the queue length of port 0 is 5,000KB, the queue length of port 1 is 3,000KB, Q(t)=Q 0 (t)+Q 1 (t)=8,...

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 buffer management algorithm of multipriority optimum dynamic threshold value is characterized in that when the lengths of all queues are less than the buffer resources, the threshold value of the quene with priority i is the max. of the sum of queues in each port with priority less than or equal to i, making the threshold of the queue with higher priority larger than the threshold of the queue with lower priority. When lengths of all queues are equal to or longer than the buffer resources, the threshold will be reduced according to the speed of the packet. The invention provides the features of taking full advantage of buffer resources, reducing the loss of the packets, allocating the resources according to the priority. Comparing with the dynamic threshold algorithm in prior art, the invention possesses better integrity.

Description

technical field [0001] The multi-priority optimal dynamic threshold cache management algorithm belongs to the field of cache management in network interconnection routers. Background technique [0002] The globalization of the Internet has gradually shifted data traffic from within the subnet to the inter-network. At the same time, the speed of the underlying communication data link is also developing rapidly with the advancement of technology, thus pushing the core equipment on the Internet-routers to network technology. focus position. [0003] In the router's forwarding process, there are three main bottlenecks: switching, lookup, and output scheduling. With the rapid growth of multimedia data flow requirements, output scheduling and buffer management issues have become important bottlenecks for the further development of routers, especially high-performance routers. [0004] Cache allocation determines how each output port of the router uses the entire cache space. Fr...

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
Patent Type & Authority Applications(China)
IPC IPC(8): G06F13/30
Inventor 徐恪李锁钢
Owner TSINGHUA UNIV
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