CORC  > 西安交通大学
A list scheduling heuristic with new node priorities and critical child technique for task scheduling with communication contention
Mu, Pengcheng; Nezan, Jean-François; Raulet, Mickaël
2011
关键词Communication contention Digital communications Directed acyclic graph (DAG) List scheduling heuristics Modern embedded systems Multiple processors Parallel embedded systems Run-time performance
卷号73 LNEE
期号[db:dc_citation_issue]
DOI[db:dc_identifier_doi]
页码217-236
会议录Lecture Notes in Electrical Engineering
URL标识查看原文
ISSN号1876-1100
WOS记录号[DB:DC_IDENTIFIER_WOSID]
内容类型会议论文
URI标识http://www.corc.org.cn/handle/1471x/4495506
专题西安交通大学
推荐引用方式
GB/T 7714
Mu, Pengcheng,Nezan, Jean-François,Raulet, Mickaël. A list scheduling heuristic with new node priorities and critical child technique for task scheduling with communication contention[C]. 见:.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace