片上网络端到端任务截止期规划问题的研究
发布时间：2018-08-19 17:08
【摘要】：片上网络是解决大规模片上多处理器系统中片上通信问题的有效途径。与基于总线的方式相比,片上网络使用网络互连的方式进行通信,这有效的降低了通信功耗、缓解了带宽争夺、提高了通信的可靠性、简化了硬件体系结构,具有良好的可伸缩性。虫洞交换网络是片上网络系统中非常常见的通信机制。虫洞交换由于自身的传输机制,对缓存的需求量非常小,因此它非常适合受成本、功耗、面积等方面严格限制的片上网络系统。本课题主要研究了基于虫洞交换的片上网络系统端到端任务截止期规划的问题。 在片上网络系统中,有些任务需要芯片内多核和片上网络相互协同合作,才能完成该任务的执行,这些任务可能需要若干个核和若干个通信按照一定的顺序协同地工作来完成,这些任务被称作端到端任务。由于片上网络实时性研究起步较晚,至今没有关于片上网络中端到端任务实时性的研究,随着多媒体业务和实时业务的不断涌现,这将是片上网络研究领域中亟待解决的问题之一。 端到端任务的实时性研究常见问题有端到端各子任务的截止期分配、各子任务的同步问题、任务优先级分配问题等。本文将针对片上网络中端到端任务中各子任务的截止期分配问题进行研究。本文采用两种不同的基于时间片的调度算法分别对片上网络中端到端任务中计算子任务和通信子任务进行调度,然后提出了三种启发式算法来为系统中各个端到端任务中的各个子任务确定截止期,从而使系统中各个资源的利用率满足基于时间片调度算法的约束条件。 本文实验部分分析了影响算法接收率的四个因子,然后分别对这四个因子做了相关实验,每部分实验都将文中提出的截止期分配算法与已有的经典PD算法进行比较,实验结果表明本文提出的算法能更加有效地满足实时性约束。
[Abstract]:On-chip network is an effective way to solve the problem of communication on-chip in large-scale multi-processor system. Compared with the bus based mode, the on-chip network uses the network interconnection mode to communicate, which effectively reduces the communication power consumption, alleviates the bandwidth contention, improves the reliability of the communication, and simplifies the hardware architecture. Good scalability. Wormhole switching network is a very common communication mechanism in on-chip network systems. Due to its own transmission mechanism, wormhole exchange has a very small demand for cache, so it is very suitable for the on-chip network system which is strictly limited by cost, power consumption, area and so on. In this paper, the problem of end-to-end task deadline planning based on wormhole switching is studied. In the on-chip network system, some tasks require the cooperation of multi-core and on-chip network in order to complete the task. These tasks may require several cores and several communications to work together in a certain order. These tasks are called end-to-end tasks. Due to the late start of real-time research on on-chip network, there has been no research on real-time end-to-end tasks in on-chip network. With the continuous emergence of multimedia services and real-time services, This will be one of the problems to be solved in the field of on-chip network research. Research on End-to-End tasks Real-Time problems include deadline assignment of end-to-end subtasks, synchronization of sub-tasks, priority assignment of tasks, and so on. In this paper, the deadline assignment problem of end-to-end tasks in on-chip network is studied. In this paper, two different scheduling algorithms based on time slice are used to schedule computing subtasks and communication subtasks in on-chip network end-to-end tasks, respectively. Then, three heuristic algorithms are proposed to determine the deadline for each sub-task in each end-to-end task of the system, so that the utilization rate of each resource in the system meets the constraints of the time-slice scheduling algorithm. In the experiment part, we analyze the four factors that affect the rate of the algorithm, and then do some experiments on the four factors. Each part of the experiment compares the proposed deadline assignment algorithm with the classical PD algorithm. Experimental results show that the proposed algorithm can meet the real-time constraints more effectively.
【学位授予单位】：东北大学
【学位级别】：硕士
【学位授予年份】：2012
【分类号】：TP332
本文编号：2192289
[Abstract]:On-chip network is an effective way to solve the problem of communication on-chip in large-scale multi-processor system. Compared with the bus based mode, the on-chip network uses the network interconnection mode to communicate, which effectively reduces the communication power consumption, alleviates the bandwidth contention, improves the reliability of the communication, and simplifies the hardware architecture. Good scalability. Wormhole switching network is a very common communication mechanism in on-chip network systems. Due to its own transmission mechanism, wormhole exchange has a very small demand for cache, so it is very suitable for the on-chip network system which is strictly limited by cost, power consumption, area and so on. In this paper, the problem of end-to-end task deadline planning based on wormhole switching is studied. In the on-chip network system, some tasks require the cooperation of multi-core and on-chip network in order to complete the task. These tasks may require several cores and several communications to work together in a certain order. These tasks are called end-to-end tasks. Due to the late start of real-time research on on-chip network, there has been no research on real-time end-to-end tasks in on-chip network. With the continuous emergence of multimedia services and real-time services, This will be one of the problems to be solved in the field of on-chip network research. Research on End-to-End tasks Real-Time problems include deadline assignment of end-to-end subtasks, synchronization of sub-tasks, priority assignment of tasks, and so on. In this paper, the deadline assignment problem of end-to-end tasks in on-chip network is studied. In this paper, two different scheduling algorithms based on time slice are used to schedule computing subtasks and communication subtasks in on-chip network end-to-end tasks, respectively. Then, three heuristic algorithms are proposed to determine the deadline for each sub-task in each end-to-end task of the system, so that the utilization rate of each resource in the system meets the constraints of the time-slice scheduling algorithm. In the experiment part, we analyze the four factors that affect the rate of the algorithm, and then do some experiments on the four factors. Each part of the experiment compares the proposed deadline assignment algorithm with the classical PD algorithm. Experimental results show that the proposed algorithm can meet the real-time constraints more effectively.
【学位授予单位】：东北大学
【学位级别】：硕士
【学位授予年份】：2012
【分类号】：TP332
【参考文献】
相关期刊论文 前2条
1 朱运航;李雪东;;基于IP核复用的SoC设计技术探讨[J];微计算机信息;2006年08期
2 王芳莉;杜慧敏;;片上网络路由算法综述[J];西安邮电学院学报;2011年01期
，本文编号：2192289
本文链接：https://www.wllwen.com/kejilunwen/jisuanjikexuelunwen/2192289.html
