earticle

논문검색

A New Static Data Flow Clustering Algorithm for Task Scheduling of Irregular Mesh in NoCs Based on Complex Networks

초록

영어

The majority of recent embedded systems are based on MPSoCs (Multi-Processors System on Chip) architectures. The topologies and the interconnections inside multi processors almost adopt NoCs (Networks on Chip) whose topology and task scheduling algorithm have a direct impact on its performances. In this paper, by using static data flow, a task scheduling algorithm which would automatically assign the application tasks onto different processors is proposed based on complex network. The goal of our algorithm is to replace the static data flow subnetwork by a single dynamic data flow actor such that the global performance in terms of latency and throughput is optimized. Through complex network, it greatly enhances the power of our algorithm in terms of avoiding deadlock, saving energy and providing for integration with more general models of computation. Experimental results show up to 60% performance improvement for real-world examples.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Methodology and Problem Definition
 4. Static Data Flow Clustering Algorithm Based on Complex Network
 5. Results
 6. Conclusion
 References

저자정보

  • Yue Liu Institute of Information Engineering, Kaifeng University, Kaifeng 475004, China
  • MengMeng Cao Institute of Information Engineering, Kaifeng University, Kaifeng 475004, China
  • Kong Jie Naval Academy of Armament, Beijing 100091, China

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.