Method for dispatching shortest-job-first memory requests on basis of fairness consideration

A technology of job prioritization and request scheduling, applied in resource allocation, multi-programming devices, etc., can solve problems such as communication efficiency and resource sharing, and achieve the effect of improving system-wide performance, ensuring throughput rate, and improving system performance

Inactive Publication Date: 2012-07-25
SUZHOU INST FOR ADVANCED STUDY USTC
View PDF0 Cites 33 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0010] The purpose of the present invention is to solve the problems of communication efficiency and resource sharing in modern popular virtual machine 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
  • Method for dispatching shortest-job-first memory requests on basis of fairness consideration
  • Method for dispatching shortest-job-first memory requests on basis of fairness consideration
  • Method for dispatching shortest-job-first memory requests on basis of fairness consideration

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0054] The above solution will be further described below in conjunction with specific embodiments. It should be understood that these examples are used to illustrate the present invention and not to limit the scope of the present invention. The implementation conditions used in the examples can be further adjusted according to the conditions of specific manufacturers, and the implementation conditions not indicated are usually the conditions in routine experiments.

[0055] Example Example of short job priority scheduling based on fairness considerations

[0056] It should be emphasized that the present invention is a memory request scheduling strategy, and the subject of implementing the strategy is the memory controller. The block diagram of the multi-core computer system is as follows: figure 1 , the block diagram of the memory system is shown in figure 2 shown. The on-chip multi-core processor chip is currently a relatively common solution with private first-level ca...

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 method for dispatching shortest-job-first memory requests on the basis of fairness consideration, which is used for a memory controller to dispatch various threading access requests when a chip multicore processor (CMP) accesses share memory resources, takes fairness when multiple threads access the memory, reduces request average waiting time and maintains inherent parallelism of the threads. The method includes: counting waiting time of memory access requests, and setting the threshold value Tmax of the maximum waiting time through testing to guarantee fairness of the threads. According to shortest-job-first strategy, threads with fewer requests can access memory as soon as possible, so that the average waiting time of the threads is shortest. Uniform priority level of the threads in the memory is set among various banks, so that the requests of the same thread on different banks can receive services, and memory level parallelism (MLP) is realized. The method for dispatching shortest-job-first memory guarantees throughput rate of the memory system and the integral performance of the system is improved completely.

Description

technical field [0001] The invention belongs to the technical field of multi-core processor memory controller request scheduling of an information processing system, and specifically relates to a strategy that considers the memory access fairness of each thread, minimizes the average waiting time and maintains the inherent parallelism of the thread itself. Background technique [0002] The development of semiconductor integrated circuits conforms to Moore's Law, that is, the integrated scale of integrated circuits will double every 18 months. However, as processor designs become more and more complex, issues such as heat dissipation and power consumption have become bottlenecks in pursuit of continuous improvement in performance of single-core processors. Therefore, on-chip multi-core processors have become an inevitable trend of development, and have achieved quite good results. [0003] In the computer system structure, the memory system is the most important level of sha...

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): G06F9/50
Inventor 吴俊敏金瑛棋蒋楠赵小雨
Owner SUZHOU INST FOR ADVANCED STUDY USTC
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

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap