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

A kind of initialization method and circuit of head and tail pointer linked list memory

A table memory and initialization technology, which is applied in the direction of instruments, electrical digital data processing, data conversion, etc., can solve the problems of long initialization time, inability to meet immediate reset and immediate work, and not suitable for use in safety-critical systems, so as to reduce initialization delay Effect

Active Publication Date: 2017-10-24
西安翔腾微电子科技有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

If there are many storage units, the initialization time is very long, which cannot meet the requirements of immediate reset and immediate work, and is not suitable for use in safety-critical systems

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
  • A kind of initialization method and circuit of head and tail pointer linked list memory

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0035] The technical solutions of the present invention are clearly and completely described below in conjunction with the accompanying drawings and specific embodiments. Obviously, the described embodiments are only a part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without making creative work are all Belong to the protection scope of the present invention.

[0036] Such as figure 1 Shown, a kind of initialization circuit of head and tail pointer linked list storage, including idle queue,

[0037] A plurality of buffer queues, free storage unit counters, linked list initialization counters and linked list update control units; each buffer queue includes buffer head pointer registers, buffer tail pointer registers, buffer queue numbers, and in the linked list memory by the buffer queue head pointer, tail A plurality of buffer frame data linked dyna...

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 present invention relates to a method and circuit for initializing head and tail pointer linked list memory, including idle queue, multiple buffer queues, free storage unit counter, linked list initialization counter and linked list update control unit; wherein the head and tail pointer registers of each buffer queue Both are connected with the linked list update control unit, the head and tail pointers of the free queue are connected with the linked list update control unit, the linked list update control unit is connected with the free storage unit counter, the linked list memory, and the output terminal of the linked list initialization counter, and the counting result output by the linked list initialization counter The two input terminals of the comparator are respectively connected with the parameter D, and the output terminal of the comparator is connected with the enabling terminal of the linked list initialization counter. The initialization method realizes the initialization of the pointer memory of the head and tail of the queue, reduces the initialization delay, and meets the requirement of immediate reset and immediate operation. It adopts parameterized settings, is suitable for many different application environments, and increases the flexibility of configuration.

Description

technical field [0001] The invention belongs to computer hardware technology, and relates to a queue head and tail pointer memory initialization method and circuit. Background technique [0002] In computer communication, as the amount of application data continues to increase, the storage efficiency of the memory is required to be higher and higher, and the method of dynamic memory management is required. The linear linked list is a data structure often used in dynamic memory management. The application of multiple queues through their respective linked list memory is also becoming more and more extensive. The linked list memory includes a plurality of storage units, an address decoding circuit and a read-write control circuit, and each storage unit stores frame control information and a linked list pointer. The initialization method of the linked list memory is as follows: when the linked list memory is powered on, the existing initialization circuit is used to sequential...

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 Patents(China)
IPC IPC(8): G06F5/12
Inventor 李哲张荣华王治杨峰夏大鹏楼晓强
Owner 西安翔腾微电子科技有限公司
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