Proceedings 12th International Symposium on System Synthesis最新文献

筛选
英文 中文
A buffer merging technique for reducing memory requirements of synchronous dataflow specifications 一种缓冲区合并技术,用于减少同步数据流规范的内存需求
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814264
P. Murthy, S. Bhattacharyya
{"title":"A buffer merging technique for reducing memory requirements of synchronous dataflow specifications","authors":"P. Murthy, S. Bhattacharyya","doi":"10.1109/ISSS.1999.814264","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814264","url":null,"abstract":"Synchronous Dataflow, a subset of dataflow has proven to be a good match for specifying DSP programs. Because of the limited amount of memory in embedded DSPs, a key problem during software synthesis from SDF specifications is the minimization of the memory used by the target code. We develop a powerful formal technique called buffer merging that attempts to overlay buffers in the SDF graph systematically, in order to drastically reduce data buffering requirements. We give a polynomial-time algorithm based on this formalism, and show that code synthesized using this technique results in more than a 60% reduction of the buffering memory consumption compared to existing techniques.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132694729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Catalyst: a DSIP design flow development in industry 催化剂:DSIP设计流程在工业上的发展
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814270
W. D. Rammelaere, K. Eckert, T. Lawell, R. McGarity, F. Steininger, P. L. Moenner, E. Hilkens
{"title":"Catalyst: a DSIP design flow development in industry","authors":"W. D. Rammelaere, K. Eckert, T. Lawell, R. McGarity, F. Steininger, P. L. Moenner, E. Hilkens","doi":"10.1109/ISSS.1999.814270","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814270","url":null,"abstract":"The Motorola System on Chip Design Technologies (SoCDT) team aims at providing a system design environment for its customers. The Toulouse branch concentrates on design efforts incorporating DSP functionality. This is referred to as the Catalyst methodology. We found that in current systems, very often the software development cycle is longer than that of the silicon development. To ease the software burden, we have changed the silicon architecture and its flow to permit the DSP software to be written in the C language instead of assembler code, as is normally done. The resulting architecture is domain specific; it is smaller, has a reduced design cycle and is simpler to implement because it is tuned to the application software we are providing. The paper describes the methodology which we are developing to create domain specific architectures, it shows one example architecture and aspects which are critical for industry acceptance.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115486559","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Loop alignment for memory accesses optimization 内存访问优化的循环对齐
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814263
A. Fraboulet, Guillaume Huard, A. Mignotte
{"title":"Loop alignment for memory accesses optimization","authors":"A. Fraboulet, Guillaume Huard, A. Mignotte","doi":"10.1109/ISSS.1999.814263","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814263","url":null,"abstract":"Portable or embedded systems allow more and more complex applications like multimedia today. These applications and submicronic technologies have made the power consumption criterium crucial. We propose new techniques thanks to which we can optimize the behavioral description of an integrated system before the hardware/software partitioning (codedesign). These transformations are performed on \"for\" loops that constitute the main parts of the multimedia code which handle the arrays. We present two new (polynomial) techniques for minimizing memory accesses in loop nests by data temporal locality optimization.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 60
Compressed code execution on DSP architectures 在DSP架构上压缩代码执行
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814261
P. Centoducatte, Ricardo Pannain, G. Araújo
{"title":"Compressed code execution on DSP architectures","authors":"P. Centoducatte, Ricardo Pannain, G. Araújo","doi":"10.1109/ISSS.1999.814261","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814261","url":null,"abstract":"Decreasing the program size has become an important goal in the design of embedded systems targeted to mass production. This problem has led to a number of efforts aimed at designing processors with shorter instruction formats (e.g. ARM Thumb and MIPS16), or that can execute compressed code (e.g. IBM CodePack PowerPC). Much of this work has been directed towards RISC architectures though. This paper proposes a solution to the problem of executing compressed code on embedded DSPs. The experimental results reveal an average compression ratio of 75% for typical DSP programs running on the TMS320C25 processor. This number includes the size of the decompression engine. Decompression is performed by a state machine that translates codeworks into instruction sequences during program execution. The decompression engine is synthesized using the AMS standard cell library and a 0.6 /spl mu/m 5V technology. Gate level simulation of the decompression engine reveals minimum operation frequencies of 150 MHz.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114865370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 14
Efficient scheduling of DSP code on processors with distributed register files 分布式寄存器文件处理器上DSP代码的高效调度
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814267
B. Mesman, C. A. Pinto, Koen van Eijk
{"title":"Efficient scheduling of DSP code on processors with distributed register files","authors":"B. Mesman, C. A. Pinto, Koen van Eijk","doi":"10.1109/ISSS.1999.814267","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814267","url":null,"abstract":"Code generation methods for digital signal processors are increasingly hampered by the combination of tight timing constraints imposed by the algorithms and the limited capacity of the available register files. Traditional methods that schedule spill code to satisfy storage capacity have difficulty satisfying the timing constraints. The method presented in the paper analyses the combination of limited register file capacity, resource- and timing constraints during scheduling. Value lifetimes are serialized until all capacity constraints are guaranteed to be satisfied after scheduling. Experiments in the FACTS environment show that we efficiently obtain high quality instruction schedules for innermost loops of DSP algorithms.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129022716","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
Event-driven power management of portable systems 便携式系统的事件驱动电源管理
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814255
T. Simunic, G. Micheli, L. Benini
{"title":"Event-driven power management of portable systems","authors":"T. Simunic, G. Micheli, L. Benini","doi":"10.1109/ISSS.1999.814255","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814255","url":null,"abstract":"The policy optimization problem for dynamic power management has received considerable attention in the recent past. We formulate policy optimization as a constrained optimization problem on continuous-time semi-Markov decision processes (SMDP). SMDPs generalize the stochastic optimization approach based on discrete-time Markov decision processes (DTMDP) presented in the earlier work by relaxing two limiting assumptions. In SMDPs, decisions are made at each event occurrence instead of at each discrete time interval as in DTMDP and thus saving power and giving higher performance. In addition, SMDPs can have general inter-state transition time distributions, allowing for greater generality and accuracy in modeling real-life systems where transition times between power states are not geometrically distributed.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133879700","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 77
Bit-width selection for data-path implementations 数据路径实现的位宽选择
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814269
C. Carreras, Juan A. López, O. Nieto-Taladriz
{"title":"Bit-width selection for data-path implementations","authors":"C. Carreras, Juan A. López, O. Nieto-Taladriz","doi":"10.1109/ISSS.1999.814269","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814269","url":null,"abstract":"Specifications of data computations may not necessarily describe the ranges of the intermediate results that can be generated. However, such information is critical to determine the bandwidths of the resources required for a data-path implementation. We present a novel approach based on interval computations that provides, not only guaranteed range estimates that take into account dependencies between variables, but estimates of their probability density functions that can be used when some truncation must be performed due to constraints in the specification. Results show that interval based estimates are obtained in reasonable times and are more accurate than those provided by independent range computation, thus leading to substantial reductions in area and latency of the corresponding data-path implementation.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122358668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 32
Middleware techniques and optimizations for real-time, embedded systems 实时嵌入式系统的中间件技术和优化
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814254
D. Schmidt
{"title":"Middleware techniques and optimizations for real-time, embedded systems","authors":"D. Schmidt","doi":"10.1109/ISSS.1999.814254","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814254","url":null,"abstract":"Due to constraints on footprint, performance, and weight/power consumption, real time, embedded system software development has historically lagged mainstream software development methodologies. As a result, real time, embedded software systems are costly to evolve and maintain. Moreover, they are often so specialized that they cannot adapt readily to meet new market opportunities or technology innovations. To further exacerbate matters, a growing class of real time, embedded systems require end-to-end support for various quality of service (QoS) aspects, such as bandwidth, latency, jitter, and dependability. These applications include telecommunication systems (e.g., call processing and switching), avionics control systems (e.g., operational night programs for fighter aircraft), and multimedia (e.g., Internet streaming video and wireless PDAs). In addition to requiring support for stringent QoS requirements, these systems are often targeted at highly competitive markets, where deregulation and global competition are motivating the need for increased software productivity and quality. Requirements for increased software productivity and quality motivate the use of Distributed Object Computing (DOC) middleware (A. Gokhale and D.C. Schmidt, 1999). Middleware resides between client and server applications and services in complex software systems. The goal of middleware is to integrate reusable software components to decrease the cycle time and effort required to develop high quality real time and embedded applications and services.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127233844","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 16
Optimized system synthesis of complex RT level building blocks from multirate dataflow graphs 从多速率数据流图中优化了复杂RT级构建块的系统合成
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814258
J. Horstmannshoff, H. Meyr
{"title":"Optimized system synthesis of complex RT level building blocks from multirate dataflow graphs","authors":"J. Horstmannshoff, H. Meyr","doi":"10.1109/ISSS.1999.814258","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814258","url":null,"abstract":"In order to cope with the ever increasing complexity of today's application specific integrated circuits, a building block based design methodology is established. The system is composed of high level building blocks, of which some are reused from previous designs while others might have been created by behavioral synthesis. In data flow oriented designs, these blocks usually have complex non-matching interface properties, making it necessary to generate additional interfacing and controlling hardware to integrate them into an operable system. An RTL-HDL code generation from a synchronous data flow representation is introduced, that efficiently automates the generation of the required additional hardware. While existing code generation approaches provide strong limitations concerning the building block interfacing properties, our method enables the integration of components that access their ports periodically with arbitrary patterns. In order to reduce interface register cost, a minimum-area retiming approach is taken to determine optimum building block activation times, which is known to have polynomial time complexity. The code generation methodology is compared to an existing approach using a simple case study.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133119068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
Loop scheduling and partitions for hiding memory latencies 用于隐藏内存延迟的循环调度和分区
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814262
Fei Chen, E. Sha
{"title":"Loop scheduling and partitions for hiding memory latencies","authors":"Fei Chen, E. Sha","doi":"10.1109/ISSS.1999.814262","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814262","url":null,"abstract":"Partition scheduling with prefetching (PSP) is a memory latency hiding technique which combines the loop pipelining technique with data prefetching. In PSP, the iteration space is first divided into regular partitions. Then two parts of the schedule, the ALU part and the memory part, are produced and balanced to produce an overall schedule with high throughput. These two parts are executed simultaneously, and hence the remote memory latency are overlapped. We study the optimal partition shape and size so that a well balanced overall schedule can be obtained. Experiments on DSP benchmarks show that the proposed methodology consistently produces optimal or near optimal solutions.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122295087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书