Efficient algorithm for functional scheduling in hardware/software co-design

2006 IEEE International Conference on Field Programmable Technology Pub Date : 2006-12-01 DOI:10.1109/FPT.2006.270296

W. Jigang, T. Srikanthan, Tao Jiao

{"title":"Efficient algorithm for functional scheduling in hardware/software co-design","authors":"W. Jigang, T. Srikanthan, Tao Jiao","doi":"10.1109/FPT.2006.270296","DOIUrl":null,"url":null,"abstract":"Task scheduling is one of the crucial steps during functional hardware/software co-design. Due to the possibly concurrent execution of the tasks implemented in hardware, the NP-hard scheduling problem becomes more difficult to solve optimally. In this paper an efficient algorithm is proposed for task scheduling in functional hadware/software co-design. The proposed algorithm assigns the priority for each task combining the information both in the communication penalty and the hardware-only critical path, to enhance the parallelism of the tasks. A large body of experimental results confirm that the proposed algorithm is superior to the most widely used approaches first-come first-schedule(FCFS) and level-by-level schedule (LBLS) in hardware/software scheduling, both for random graphs and some realistic application graphs, without large increase in running time. The improvement over FCFS and LBLS is up to 10% for some random graphs, and it is more significant for FFT application graphs, according to the simulation results on the same types of graphs (under the same assumptions) as in the literature where LBLS is employed","PeriodicalId":354940,"journal":{"name":"2006 IEEE International Conference on Field Programmable Technology","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Field Programmable Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FPT.2006.270296","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

Task scheduling is one of the crucial steps during functional hardware/software co-design. Due to the possibly concurrent execution of the tasks implemented in hardware, the NP-hard scheduling problem becomes more difficult to solve optimally. In this paper an efficient algorithm is proposed for task scheduling in functional hadware/software co-design. The proposed algorithm assigns the priority for each task combining the information both in the communication penalty and the hardware-only critical path, to enhance the parallelism of the tasks. A large body of experimental results confirm that the proposed algorithm is superior to the most widely used approaches first-come first-schedule(FCFS) and level-by-level schedule (LBLS) in hardware/software scheduling, both for random graphs and some realistic application graphs, without large increase in running time. The improvement over FCFS and LBLS is up to 10% for some random graphs, and it is more significant for FFT application graphs, according to the simulation results on the same types of graphs (under the same assumptions) as in the literature where LBLS is employed

查看原文本刊更多论文

硬件/软件协同设计中高效的功能调度算法

任务调度是功能软硬件协同设计的关键步骤之一。由于在硬件中实现的任务可能并发执行，NP-hard调度问题变得更加难以最优解决。本文提出了一种高效的软硬件协同设计任务调度算法。该算法结合通信惩罚信息和纯硬件关键路径信息为每个任务分配优先级，以提高任务的并行性。大量的实验结果表明，该算法在硬件/软件调度方面优于最常用的先到先调度(FCFS)和逐级调度(LBLS)方法，无论对于随机图还是一些实际应用图，都不会增加大量的运行时间。根据与文献中使用LBLS的相同类型的图(在相同的假设下)的仿真结果，对于某些随机图，相对于FCFS和LBLS的改进可达10%，并且对于FFT应用图的改进更为显著

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2006 IEEE International Conference on Field Programmable Technology

自引率

0.00%

发文量