Co-Optimization of Buffer Requirement and Response Time for SDF Graph
Synchronous Data flow Graph (SDF) is a model ofcomputation that has been widely used in block diagramDigit Signal Processing (DSP) programmingenvironment. Many existing schedule methods of SDFhave been developed to reduce run-time costs includingthe amount of memories used by executing codes andthe response time of the target system. But becausethese methods deal with amount of memories andresponse time independently, they often generatecontradicting results about these two kinds of run-timecosts. For example, these methods reduce the amount ofmemory consumption but increasing response time. Bycontrast, Earliest Deadline First (EDF) reduce theresponse time, without considering the bufferrequirement of the system. However, by adding ajudging condition to EDF, on the one hand, we couldschedule the SDF with an efficient response time, on theother hand, we could schedule the system with anefficient buffer requirement, while keeping the sameresponse time. Hence, our improved EDF effectivelymakes up the deficiencies of SDF and EDF, therebyenhancing the utility of SDF and EDF.
Qi Zhu Hui Lu Baifeng Wu
Fudan University,Shanghai 200433,P.R.China
国际会议
厦门
英文
333-336
2004-05-26（万方平台首次上网日期，不代表论文的发表时间）