Institutional Repository
| static scheduling of synchronous data flow onto multiprocessors for embedded dsp systems | |
| Liu Guoxin; He Yeping; Guo Liang; Qi Fang | |
| 2011 | |
| 会议名称 | 3rd International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2011 |
| 会议录名称 | Proceedings - 3rd International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2011 |
| 页码 | 338-341 |
| 会议日期 | January 6, |
| 会议地点 | Shanghai, China |
| 收录类别 | EI |
| 出版地 | United States |
| ISBN | 9780769542966 |
| 部门归属 | (1) Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China |
| 摘要 | A method of scheduling onto multiprocessors for embedded DSP system applications is proposed. This method basing on SDF (Synchronous Data Flow) performs all of the scheduling at compile time by methods of periodic schedules. And it uses a Hierarchical Priority Scheduling algorithm, which first schedules the module of highest priority, to solve the problem, static scheduling of SDF onto Multiprocessors. Compared to other algorithms, it has better Time and Space Complexity because the conversion from SDF to APG (Acyclic Precedence Graphs) is unnecessary. Experimental results prove the validity of the proposed method. © 2011 IEEE. |
| 关键词 | Data Transfer Embedded Software Embedded Systems Mechatronics Multiprocessing Systems Response Time (Computer Systems) Scheduling Algorithms |
| 主办者 | IEEE Instrumentation and Measurement Society; Shanghai University of Engineering Science; City University of Hongkong; Changsha University of Science and Technology; Hunan University of Science and Technology |
| 内容类型 | 会议论文 |
| URI标识 | http://ir.iscas.ac.cn/handle/311060/14219 |
| 专题 | 基础软件国家工程研究中心 |
| 推荐引用方式 GB/T 7714 | Liu Guoxin,He Yeping,Guo Liang,et al. static scheduling of synchronous data flow onto multiprocessors for embedded dsp systems[C]. United States,2011:338-341. |
| 条目包含的文件 | ||||||
| 文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 | ||
| Static Scheduling of(304KB) | 开放获取 | -- | 请求全文 | |||
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论