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

筛选
英文 中文
A graph theoretic approach for design and synthesis of multiplierless FIR filters 无乘法器FIR滤波器设计与合成的图论方法
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814266
K. Muhammad, K. Roy
{"title":"A graph theoretic approach for design and synthesis of multiplierless FIR filters","authors":"K. Muhammad, K. Roy","doi":"10.1109/ISSS.1999.814266","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814266","url":null,"abstract":"We present a novel approach which can be used to obtain multiplierless implementations of finite impulse response (FIR) digital filters. The main idea is to reorder filter coefficients such that an implementation based on differential coefficients requires only a few adders. We represent this problem using a graph in which vertices represent the coefficients and edges represent the resources required when the differential coefficient corresponding to the edge is used in a computation. We also present a graph model for an implementation based on second-order coefficient differences. The optimal solution to the coefficient reordering problem is the well known problem of finding the Hamiltonian path of smallest weight in this graph. We use two approaches to find the smallest weight Hamiltonian cycle; a greedy approach, and the heuristic algorithm proposed by Lin and Kernighan. The power and potential of this approach is demonstrated by presenting results for large filters (lengths up to >300) which show that, in general, for 18-bit coefficients, the total number of adders required per coefficient is less than 2. Hence, high performance and/or low power filters can be designed and synthesized using the proposed approach.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"38 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":"121792833","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}
引用次数: 7
RTGEN: an algorithm for automatic generation of reservation tables from architectural descriptions RTGEN:一种从体系结构描述自动生成预订表的算法
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814259
P. Grun, A. Halambi, N. Dutt, A. Nicolau
{"title":"RTGEN: an algorithm for automatic generation of reservation tables from architectural descriptions","authors":"P. Grun, A. Halambi, N. Dutt, A. Nicolau","doi":"10.1109/ISSS.1999.814259","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814259","url":null,"abstract":"Reservation tables (RTs) have long been used to detect conflicts between operations that simultaneously access the same architectural resource. Traditional these RTs have been specified explicitly by the designer. However, the increasing complexity of modern processors makes the manual specification of RTs cumbersome and error-prone. Furthermore, manual specification of such conflict information is infeasible for supporting rapid architectural exploration. We present an algorithm to automatically generate RTs from a high-level processor description, with the goal of avoiding manual specification of RTs, resulting in more concise architectural specifications and also supporting faster turn-around time in design space exploration. We demonstrate the utility of our approach on a set of experiments using the TI C6201 VLIW DSP and DLX processor architectures, and a suite of multimedia and scientific applications.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"7 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":"129934328","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}
引用次数: 50
Automatic architectural synthesis of VLIW and EPIC processors VLIW和EPIC处理器的自动体系结构综合
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814268
Shail Aditya, B. R. Rau, V. Kathail
{"title":"Automatic architectural synthesis of VLIW and EPIC processors","authors":"Shail Aditya, B. R. Rau, V. Kathail","doi":"10.1109/ISSS.1999.814268","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814268","url":null,"abstract":"The paper describes a mechanism for automatic design and synthesis of very long instruction word (VLIW), and its generalization, explicitly parallel instruction computing (EPIC) processor architectures starting from an abstract specification of their desired functionality. The process of architecture design makes concrete decisions regarding the number and types of functional units, number of read/write ports on register files, the datapath interconnect, the instruction format, its decoding hardware, and the instruction unit datapath. The processor design is then automatically synthesized into a detailed RTL-level structural model in VHDL, along with an estimate of its area. The system also generates the corresponding detailed machine description and instruction format description that can be used to retarget a compiler and an assembler respectively. All this is part of an overall design system, called Program-In-Chip Out (PICO), which has the ability to perform automatic exploration of the architectural design space while customizing the architecture to a given application and making intelligent, quantitative, cost-performance tradeoffs.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"20 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":"126534313","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}
引用次数: 76
System synthesis of synchronous multimedia applications 系统综合同步多媒体应用
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814271
G. Qu, M. Mesarina, M. Potkonjak
{"title":"System synthesis of synchronous multimedia applications","authors":"G. Qu, M. Mesarina, M. Potkonjak","doi":"10.1109/ISSS.1999.814271","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814271","url":null,"abstract":"Modern system design is being increasingly driven by applications such as multimedia and wireless sensing and communications, which all have intrinsic quality of service (QoS) requirements, such as throughput, error-rate, and resolution. One of the most crucial QoS guarantees that the system has to provide is the timing constraints among the interacting media (synchronization) and within each media (latency). We have developed the first framework for systems design with timing QoS guarantees, latency and synchronization. In particular we address how to design system-on-chip with minimal silicon area to meet timing constraints. We propose the two-phase design methodology. In the first phase, we select an architecture which facilitates the needs of synchronous low latency applications well. In the second phase, for a given processor configuration, we use our new scheduler in such a way that storage requirements are minimized. We have developed scheduling algorithms that solve the problem optimally for a-priori specified applications. The algorithms have been implemented and their effectiveness demonstrated on a set of simulated MPEG streams from popular movies.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"36 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":"114226487","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
A framework for scheduling and context allocation in reconfigurable computing 可重构计算中的调度和上下文分配框架
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814272
R. Maestre, Milagros Fernández, R. Hermida, N. Bagherzadeh
{"title":"A framework for scheduling and context allocation in reconfigurable computing","authors":"R. Maestre, Milagros Fernández, R. Hermida, N. Bagherzadeh","doi":"10.1109/ISSS.1999.814272","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814272","url":null,"abstract":"Reconfigurable computing is emerging as a viable design alternative to implement a wide range of computationally intensive applications. The scheduling problem becomes a really critical issue in achieving the high performance that these kind of applications demand. The paper describes the different aspects regarding the scheduling problem in a reconfigurable architecture. We also propose a general strategy in order to perform at compilation time a scheduling that includes all possible optimizations regarding context (configuration) and data transfers. In particular, we focus especially on the methodology and mechanisms to solve the context scheduling. Some experimental results are presented to validate our assumptions. Finally, the problem of data transfers is formulated, to be addressed in future work.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"14 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":"122898089","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
Path-based edge activation for dynamic run-time scheduling 动态运行时调度的基于路径的边缘激活
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814257
V. Mooney
{"title":"Path-based edge activation for dynamic run-time scheduling","authors":"V. Mooney","doi":"10.1109/ISSS.1999.814257","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814257","url":null,"abstract":"We present a tool that performs real time analysis and dynamic execution of software tasks in a mixed hardware-software system with a custom run time scheduler. The tasks in hardware and software have control flow constraints (precedence and alternative execution), resource constraints, relative timing constraints, and a rate constraint. The custom run time scheduler dynamically executes tasks in different orders, based on the conditional execution path, such that a hard real time rate constraint can be predictably met. We describe the task modelling, run time scheduler implementation, and real time analysis. We introduce the concept of path based edge activation utilizing conditional edges. We show how our approach fits into an overall tool flow and target architecture. Finally, we conclude with a sample application of the system to a design example.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"28 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":"131215845","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}
引用次数: 3
Exploration and synthesis of dynamic data sets in telecom network applications 电信网络应用中动态数据集的探索与综合
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814265
C. Ykman-Couvreur, Jurgen Lambrecht, D. Verkest, F. Catthoor, H. Man
{"title":"Exploration and synthesis of dynamic data sets in telecom network applications","authors":"C. Ykman-Couvreur, Jurgen Lambrecht, D. Verkest, F. Catthoor, H. Man","doi":"10.1109/ISSS.1999.814265","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814265","url":null,"abstract":"We present a novel exploration and optimization method to select customized implementations for dynamic data sets, as encountered in telecom network, database and multimedia applications. Our method fits in the context of embedded system synthesis for such applications, and enables us to further raise the abstraction level of the initial specification, where dynamic data sets can be specified without low-level details. Our method is suited for hardware and software implementations. It mainly aims at minimizing the memory power consumption, although it can also be driven by other cost functions such as area or performance. Compared with existing methods, it can save up to 2/3 of the memory power consumption and 3/4 of the memory area.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"85 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":"122636583","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}
引用次数: 12
Pre-fetching for improved core interfacing 预取改进的核心接口
Proceedings 12th International Symposium on System Synthesis Pub Date : 1999-11-01 DOI: 10.1109/ISSS.1999.814260
Roman L. Lysecky, F. Vahid, Rilesh Patel, T. Givargis
{"title":"Pre-fetching for improved core interfacing","authors":"Roman L. Lysecky, F. Vahid, Rilesh Patel, T. Givargis","doi":"10.1109/ISSS.1999.814260","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814260","url":null,"abstract":"Reuse of cores can reduce design time for systems-on-a-chip. Such reuse is dependent on being able to easily interface a core to any bus. To enable such interfacing, many propose separating a core's interface from its internals. However, this separation can lead to a performance penalty when reading a core's internal registers. We introduce pre-fetching, which is analogous to caching, as a technique to reduce or eliminate this performance penalty, involving a tradeoff with power and size. We describe the pre-fetching technique, classify different types of registers, describe our initial pre-fetching architectures and heuristics for certain classes of registers, and highlight experiments demonstrating the performance improvements and size/power tradeoffs.","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":"132127759","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}
引用次数: 9
Real-time task scheduling for a variable voltage processor 可变电压处理器的实时任务调度
Proceedings 12th International Symposium on System Synthesis Pub Date : 1998-12-11 DOI: 10.1109/ISSS.1999.814256
T. Okuma, T. Ishihara, H. Yasuura
{"title":"Real-time task scheduling for a variable voltage processor","authors":"T. Okuma, T. Ishihara, H. Yasuura","doi":"10.1109/ISSS.1999.814256","DOIUrl":"https://doi.org/10.1109/ISSS.1999.814256","url":null,"abstract":"The paper presents a real time task scheduling technique with a variable voltage processor which can vary its supply voltage dynamically. Using such a processor, running tasks with a low supply voltage leads to drastic power reduction. However, reducing the supply voltage may violate real time constraints. We propose a scheduling technique which simultaneously assigns both CPU time and a supply voltage to each task so as to minimize total energy consumption while satisfying all real time constraints. Experimental results demonstrate effectiveness of the proposed technique.","PeriodicalId":185946,"journal":{"name":"Proceedings 12th International Symposium on System Synthesis","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133555848","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}
引用次数: 99
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学术官方微信
小红书