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

A data-dependent thread grouping mapping method for many-core systems

A technology of data correlation and mapping method, applied in the direction of resource allocation, multi-programming device, etc., can solve the problems of limited versatility, inability to objectively reflect the characteristics of data correlation, and inability to meet the high-performance computing requirements of many-core systems, etc. To achieve the effect of reducing access conflicts, reducing data transmission overhead, and minimizing data dependencies

Active Publication Date: 2019-10-18
XI AN JIAOTONG UNIV
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Regardless of the characteristics of the physical architecture of the operating platform, directly mapping threads to processing cores cannot objectively reflect the data correlation characteristics of different threads running on specific operating platforms
The existing research work on dynamic thread mapping according to the locality characteristics of program runtime mainly realizes the mapping from threads to processing cores through dynamic segmentation and migration, but dynamic segmentation and migration of threads will introduce additional runtime overhead, and some Also requires specific hardware support, limiting its versatility
On a many-core system with a large number of processing cores and a complex storage structure, the above thread mapping method cannot meet the high-performance computing requirements of many-core systems because the computing performance and the overall energy consumption of the system must be considered at the same time.
[0004] In view of the above existing problems, there is currently no one that can combine the architectural features of the many-core system with the inherent data correlation characteristics between application threads, and realize the mapping from threads to processing cores by grouping application threads, so as to improve the overall calculation of the many-core system. efficient method

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 data-dependent thread grouping mapping method for many-core systems
  • A data-dependent thread grouping mapping method for many-core systems
  • A data-dependent thread grouping mapping method for many-core systems

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The present invention is described in further detail below in conjunction with accompanying drawing:

[0032] see figure 1 , the present invention comprises the following steps:

[0033] 1) According to the maximum number of hardware threads supported by the many-core processor, the application program is divided into a corresponding number of logical threads;

[0034] 2) Use the Intel Pin API to write the Pin tool, and count the storage access data of each thread in parallel;

[0035] 3) The statistics of thread data access information is realized by inserting nodes in the binary tree. The insertion of data nodes adopts a balanced binary tree mid-order insertion algorithm with data timestamps (timestamps representing the order in which data is accessed) as the primary key.

[0036] 4) When inserting a node, record the relevant data item information in the data structure of the node. The node data structure is defined as follows: Node(TS; Element; Frequency; Weight; ...

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 thread data dependency group mapping method for a many-core system. The method comprises the steps that application program thread internal data locality is analyzed by calculating data reuse distances, and data dependencies among different threads are measured with a thread dependency matrix; according to characteristics of the data dependencies of application programs and many-core processor construction, application threads are divided into data dependency logical groups capable of reflecting different threads by means of a minimal spanning tree. Reasonable mapping from the threads to different processing core hardware threads of a specific processor is finally achieved, shared storage access conflicts among the threads are reduced, additional transmission overhead is reduced, and an effective solution is provided for fully utilizing many-core system computing resources and promoting the program calculation performance.

Description

【Technical field】 [0001] The invention belongs to the field of computer system structure and relates to a thread grouping mapping method, in particular to a thread grouping mapping method based on data correlation for many-core systems. 【Background technique】 [0002] How to make full use of the high computing power of many-core processors and reduce system energy consumption is a key issue faced by many-core systems. With the development of multi-core / many-core technology, more and more processor cores are integrated in many-core processors, which further intensifies the contention among multiple processing cores for on-chip shared computing resources (such as shared cache and shared bandwidth). At the same time, since the many-core processor adopts a multi-level hierarchical storage structure, its storage access is more complicated. If the task allocation is unreasonable during the running of the program, allocating the threads with frequent information interaction to the...

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): G06F9/50
Inventor 董小社巨涛张兴军陈衡党博超吴树森
Owner XI AN JIAOTONG 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