首页 > 最新文献

Proceedings Design, Automation and Test in Europe最新文献

英文 中文
Energy-delay efficient data storage and transfer architectures: circuit technology versus design methodology solutions 能量延迟高效数据存储和传输架构:电路技术与设计方法解决方案
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655936
F. Catthoor
Both in custom and programmable instruction-set processors for data-dominated multi-media applications, many of the architecture components are intended to solve the data transfer and storage issues. Recent experiments at several locations have clearly demonstrated that due to this fact, the main power (and largely also area) cost is situated in the memory units and the communication hardware. In this paper, the main reasons for this problem will be reviewed and a perspective will be provided on the expected near-future evolution. It will be shown that the circuit and process technology advances have been very significant in the past decade. Still, these are not sufficient to fully solve this power and area bottle-neck which has been created in the same period. Therefore, several possible design methodology remedies will be proposed for this critical design issue, with emphasis on effective system-level memory management methodologies. These promise very large savings on energy-delay also on area for multi-media applications, while still meeting the real-time constraints.
在数据主导的多媒体应用程序的定制和可编程指令集处理器中,许多体系结构组件都旨在解决数据传输和存储问题。最近在几个地方进行的实验清楚地表明,由于这一事实,主要的功率(以及很大程度上的面积)成本位于存储单元和通信硬件上。在本文中,将回顾造成这一问题的主要原因,并对预期的近期发展提供一个观点。在过去的十年中,电路和工艺技术的进步是非常显著的。然而,这些还不足以完全解决在同一时期产生的权力和面积瓶颈。因此,针对这个关键的设计问题,将提出几种可能的设计方法补救措施,重点是有效的系统级内存管理方法。在满足实时限制的情况下,这将大大节省多媒体应用的能源延迟。
{"title":"Energy-delay efficient data storage and transfer architectures: circuit technology versus design methodology solutions","authors":"F. Catthoor","doi":"10.1109/DATE.1998.655936","DOIUrl":"https://doi.org/10.1109/DATE.1998.655936","url":null,"abstract":"Both in custom and programmable instruction-set processors for data-dominated multi-media applications, many of the architecture components are intended to solve the data transfer and storage issues. Recent experiments at several locations have clearly demonstrated that due to this fact, the main power (and largely also area) cost is situated in the memory units and the communication hardware. In this paper, the main reasons for this problem will be reviewed and a perspective will be provided on the expected near-future evolution. It will be shown that the circuit and process technology advances have been very significant in the past decade. Still, these are not sufficient to fully solve this power and area bottle-neck which has been created in the same period. Therefore, several possible design methodology remedies will be proposed for this critical design issue, with emphasis on effective system-level memory management methodologies. These promise very large savings on energy-delay also on area for multi-media applications, while still meeting the real-time constraints.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115270602","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}
引用次数: 15
Advanced optimistic approaches in logic simulation 逻辑仿真中的先进乐观方法
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655883
S. Schmerler, Y. Tanurhan, K. Müller-Glaser
This paper presents the optimistic synchronization mechanism predictive time warp (PTW) based on the implementation time warp of the virtual time paradigm for use in the simulation of electronic systems and high level system simulation. In comparison to most existing approaches extending and improving classical time warp, the aim of this development was to reduce the roll-back frequency of optimistic logical processes without imposing waiting periods. Part of PTW is the introduction of forecast events predicting a certain period in the future and thus reducing the roll-back probability. On the example of a distributed logic simulation the benefit of the PTW synchronization approach is shown.
提出了基于虚拟时间范式实现时间扭曲的乐观同步机制预测时间扭曲(PTW),用于电子系统仿真和高层系统仿真。与大多数现有的扩展和改进经典时间扭曲的方法相比,这种发展的目的是在不施加等待时间的情况下减少乐观逻辑过程的回滚频率。PTW的一部分是引入预测事件,预测未来某一时期,从而降低回滚概率。通过一个分布式逻辑仿真实例,说明了PTW同步方法的优点。
{"title":"Advanced optimistic approaches in logic simulation","authors":"S. Schmerler, Y. Tanurhan, K. Müller-Glaser","doi":"10.1109/DATE.1998.655883","DOIUrl":"https://doi.org/10.1109/DATE.1998.655883","url":null,"abstract":"This paper presents the optimistic synchronization mechanism predictive time warp (PTW) based on the implementation time warp of the virtual time paradigm for use in the simulation of electronic systems and high level system simulation. In comparison to most existing approaches extending and improving classical time warp, the aim of this development was to reduce the roll-back frequency of optimistic logical processes without imposing waiting periods. Part of PTW is the introduction of forecast events predicting a certain period in the future and thus reducing the roll-back probability. On the example of a distributed logic simulation the benefit of the PTW synchronization approach is shown.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122940540","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}
引用次数: 4
Cross-level hierarchical high-level synthesis 跨层分层高级综合
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655897
O. Bringmann, W. Rosenstiel
This paper presents a new approach to cross-level hierarchical high-level synthesis. A methodology is presented, that supports the efficient synthesis of hierarchical specified systems while preserving the hierarchical structure. After synthesis of each subsystem, the determined component schedule and the synthesized RT-structure are added to its algorithmic specification. This provides an automatic selection of optimized complex components. Furthermore, the component schedule enables the sharing of unused subcomponents across different hierarchical levels of the design.
提出了一种跨层分层高级综合的新方法。提出了一种在保留分层结构的前提下支持分层指定系统的有效综合的方法。在对各子系统进行综合后,将确定的组件进度和综合的rt结构添加到其算法规范中。这提供了优化复杂组件的自动选择。此外,组件调度允许在设计的不同层次级别之间共享未使用的子组件。
{"title":"Cross-level hierarchical high-level synthesis","authors":"O. Bringmann, W. Rosenstiel","doi":"10.1109/DATE.1998.655897","DOIUrl":"https://doi.org/10.1109/DATE.1998.655897","url":null,"abstract":"This paper presents a new approach to cross-level hierarchical high-level synthesis. A methodology is presented, that supports the efficient synthesis of hierarchical specified systems while preserving the hierarchical structure. After synthesis of each subsystem, the determined component schedule and the synthesized RT-structure are added to its algorithmic specification. This provides an automatic selection of optimized complex components. Furthermore, the component schedule enables the sharing of unused subcomponents across different hierarchical levels of the design.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"38 1-2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114038114","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}
引用次数: 19
An efficient algorithm for fast parasitic extraction and passive order reduction of 3D interconnect models 一种三维互连模型的快速寄生提取和被动降阶算法
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655910
N. Marques, M. Kamon, Jacob K. White, L. M. Silveira
As VLSI circuit speeds have increased, the need for accurate three-dimensional interconnect models has become essential to accurate chip and system design. In this paper we describe an integral equation approach to modeling the impedance of interconnect structures accounting for both the charge accumulation on the surface of conductors and the current traveling along conductors. Unlike previous methods, our approach is based on a modified nodal analysis formulation and can be used directly to generate guaranteed passive low order interconnect models for efficient inclusion in a standard circuit simulator.
随着VLSI电路速度的提高,对精确的三维互连模型的需求对于精确的芯片和系统设计至关重要。在本文中,我们描述了一种积分方程方法来模拟互连结构的阻抗,同时考虑了导体表面的电荷积累和沿导体流动的电流。与以前的方法不同,我们的方法基于改进的节点分析公式,可以直接用于生成保证的无源低阶互连模型,以便有效地包含在标准电路模拟器中。
{"title":"An efficient algorithm for fast parasitic extraction and passive order reduction of 3D interconnect models","authors":"N. Marques, M. Kamon, Jacob K. White, L. M. Silveira","doi":"10.1109/DATE.1998.655910","DOIUrl":"https://doi.org/10.1109/DATE.1998.655910","url":null,"abstract":"As VLSI circuit speeds have increased, the need for accurate three-dimensional interconnect models has become essential to accurate chip and system design. In this paper we describe an integral equation approach to modeling the impedance of interconnect structures accounting for both the charge accumulation on the surface of conductors and the current traveling along conductors. Unlike previous methods, our approach is based on a modified nodal analysis formulation and can be used directly to generate guaranteed passive low order interconnect models for efficient inclusion in a standard circuit simulator.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116608309","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
Parallel VHDL simulation 并行VHDL仿真
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655851
E. Naroska
In this paper we evaluate parallel VHDL simulation based on conservative parallel discrete event simulation (conservative PDES) algorithms. We focus on a conservative simulation algorithm based on critical and external distances. This algorithm exploits the interconnection structure within the simulation model to increase parallelism. Further, a general method is introduced to automatically transform a VHDL model into a PDES model. Additionally, we suggest a method to further optimize parallel simulation performance. Finally, our first simulation results on a IBM parallel computer are presented. While these results are not sufficient for a general evaluation they show that a good speedup can be obtained.
本文对基于保守并行离散事件仿真(conservative PDES)算法的并行VHDL仿真进行了研究。我们重点研究了一种基于临界距离和外部距离的保守仿真算法。该算法利用仿真模型内部的互连结构来提高并行性。在此基础上,提出了一种将VHDL模型自动转换为PDES模型的通用方法。此外,我们还提出了一种进一步优化并行仿真性能的方法。最后,给出了在IBM并行计算机上的初步仿真结果。虽然这些结果不足以进行一般评估,但它们表明可以获得良好的加速。
{"title":"Parallel VHDL simulation","authors":"E. Naroska","doi":"10.1109/DATE.1998.655851","DOIUrl":"https://doi.org/10.1109/DATE.1998.655851","url":null,"abstract":"In this paper we evaluate parallel VHDL simulation based on conservative parallel discrete event simulation (conservative PDES) algorithms. We focus on a conservative simulation algorithm based on critical and external distances. This algorithm exploits the interconnection structure within the simulation model to increase parallelism. Further, a general method is introduced to automatically transform a VHDL model into a PDES model. Additionally, we suggest a method to further optimize parallel simulation performance. Finally, our first simulation results on a IBM parallel computer are presented. While these results are not sufficient for a general evaluation they show that a good speedup can be obtained.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121721282","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}
引用次数: 15
On the reuse of symbolic simulation results for incremental equivalence verification of switch-level circuits 开关级电路增量等效性验证中符号仿真结果的重用研究
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655923
L. Ribas-Xirgo, J. Carrabina-Bordoll
Incremental methods are successfully applied to deal with successive verifications of slightly modified switch-level networks. That is, only those parts affected by the changes are symbolically traversed for verification. In this paper, we present an incremental technique for symbolic simulators which is inspired in both existing incremental techniques for non-symbolic simulators and a token-passing mechanisms in Petri nets.
增量方法成功地应用于处理轻微修改的交换机级网络的连续验证。也就是说,只有那些受更改影响的部分才会被象征性地遍历以进行验证。在本文中,我们提出了一种用于符号模拟器的增量技术,该技术的灵感来自于现有的用于非符号模拟器的增量技术和Petri网中的令牌传递机制。
{"title":"On the reuse of symbolic simulation results for incremental equivalence verification of switch-level circuits","authors":"L. Ribas-Xirgo, J. Carrabina-Bordoll","doi":"10.1109/DATE.1998.655923","DOIUrl":"https://doi.org/10.1109/DATE.1998.655923","url":null,"abstract":"Incremental methods are successfully applied to deal with successive verifications of slightly modified switch-level networks. That is, only those parts affected by the changes are symbolically traversed for verification. In this paper, we present an incremental technique for symbolic simulators which is inspired in both existing incremental techniques for non-symbolic simulators and a token-passing mechanisms in Petri nets.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132714070","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}
引用次数: 0
Scheduling of conditional process graphs for the synthesis of embedded systems 嵌入式系统综合的条件过程图调度
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655847
P. Eles, K. Kuchcinski, Zebo Peng, A. Doboli, P. Pop
We present an approach to process scheduling based on an abstract graph representation which captures both data-flow and the flow of control. Target architectures consist of several processors, ASICs and shared buses. We have developed a heuristic which generates a schedule table so that the worst case delay is minimized. Several experiments demonstrate the efficiency of the approach.
提出了一种基于抽象图表示的过程调度方法,该方法可以同时捕获数据流和控制流。目标体系结构由多个处理器、asic和共享总线组成。我们开发了一种启发式算法,它生成一个时间表,使最坏情况下的延迟最小化。实验证明了该方法的有效性。
{"title":"Scheduling of conditional process graphs for the synthesis of embedded systems","authors":"P. Eles, K. Kuchcinski, Zebo Peng, A. Doboli, P. Pop","doi":"10.1109/DATE.1998.655847","DOIUrl":"https://doi.org/10.1109/DATE.1998.655847","url":null,"abstract":"We present an approach to process scheduling based on an abstract graph representation which captures both data-flow and the flow of control. Target architectures consist of several processors, ASICs and shared buses. We have developed a heuristic which generates a schedule table so that the worst case delay is minimized. Several experiments demonstrate the efficiency of the approach.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114319625","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}
引用次数: 149
Interconnect tuning strategies for high-performance ICs 高性能集成电路的互连优化策略
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655900
A. Kahng, S. Muddu, E. Sarto, Rahul Sharma
Interconnect tuning is an increasingly critical degree of freedom in the physical design of high-performance VLSI systems. By interconnect tuning, we refer to the selection of line thicknesses, widths and spacings in multi-layer interconnect to simultaneously optimize signal distribution, signal performance, signal integrity, and interconnect manufacturability and reliability. This is a key activity in most leading-edge design projects, but has received little attention in the literature. Our work provides the first technology-specific studies of interconnect tuning in the literature. We center on global wiring layers and interconnect tuning issues related to bus routing, repeater insertion, and choice of shielding/spacing rules for signal integrity and performance. We address four basic questions. (1) How should width and spacing be allocated to maximize performance for a given line pitch? (2) For a given line pitch, what criteria affect the optimal interval at which repeaters should be inserted into global interconnects? (3) Under what circumstances are shield wires the optimum technique for improving interconnect performance? (4) In global interconnect with repeaters, what other interconnect tuning is possible? Our study of question (4) demonstrates a new approach of offsetting repeater placements that can reduce worst-case cross-chip delays by over 30% in current technologies.
在高性能VLSI系统的物理设计中,互连调谐是一个越来越重要的自由度。通过互连调谐,我们指的是多层互连中线厚、宽度和间距的选择,以同时优化信号分布、信号性能、信号完整性以及互连的可制造性和可靠性。这是大多数前沿设计项目的关键活动,但在文献中很少受到关注。我们的工作提供了文献中第一个特定于技术的互连调谐研究。我们集中在全球布线层和互连调谐问题相关的总线路由,中继器插入,和选择屏蔽/间隔规则的信号完整性和性能。我们解决四个基本问题。(1)宽度和间距应该如何分配,以最大限度地提高性能为给定的线间距?(2)对于给定的线路间距,什么标准影响中继器插入全局互连的最佳间隔?(3)在什么情况下屏蔽线是改善互连性能的最佳技术?(4)在与中继器的全局互连中,有哪些其他的互连调谐是可能的?我们对问题(4)的研究展示了一种抵消中继器放置的新方法,该方法可以将当前技术中最坏情况下的跨芯片延迟减少30%以上。
{"title":"Interconnect tuning strategies for high-performance ICs","authors":"A. Kahng, S. Muddu, E. Sarto, Rahul Sharma","doi":"10.1109/DATE.1998.655900","DOIUrl":"https://doi.org/10.1109/DATE.1998.655900","url":null,"abstract":"Interconnect tuning is an increasingly critical degree of freedom in the physical design of high-performance VLSI systems. By interconnect tuning, we refer to the selection of line thicknesses, widths and spacings in multi-layer interconnect to simultaneously optimize signal distribution, signal performance, signal integrity, and interconnect manufacturability and reliability. This is a key activity in most leading-edge design projects, but has received little attention in the literature. Our work provides the first technology-specific studies of interconnect tuning in the literature. We center on global wiring layers and interconnect tuning issues related to bus routing, repeater insertion, and choice of shielding/spacing rules for signal integrity and performance. We address four basic questions. (1) How should width and spacing be allocated to maximize performance for a given line pitch? (2) For a given line pitch, what criteria affect the optimal interval at which repeaters should be inserted into global interconnects? (3) Under what circumstances are shield wires the optimum technique for improving interconnect performance? (4) In global interconnect with repeaters, what other interconnect tuning is possible? Our study of question (4) demonstrates a new approach of offsetting repeater placements that can reduce worst-case cross-chip delays by over 30% in current technologies.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"113 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115085127","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}
引用次数: 108
An efficient divide and conquer algorithm for exact hazard free logic minimization 一种有效的分治算法,用于精确的无危险逻辑最小化
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655942
J. Rutten, Michel Berkelaar, C. V. Eijk, M. Kolsteren
In this paper we introduce the first divide and conquer algorithm that is capable of exact hazard-free logic minimization in a constructive way. We compare our algorithm with the method of Dill and Nowick (1992), which was the only known method for exact hazard-free minimization. We show that our algorithm is much faster than the method proposed by Dill and Nowick by avoiding a significant part of the search space. We argue that the proposed algorithm is a promising framework for the development of efficient heuristic algorithms.
在本文中,我们介绍了第一种分治算法,它能够以一种建设性的方式实现精确的无危险逻辑最小化。我们将我们的算法与Dill和Nowick(1992)的方法进行比较,后者是唯一已知的精确无危险最小化方法。我们表明,我们的算法比Dill和Nowick提出的方法要快得多,因为它避免了搜索空间的重要部分。我们认为,所提出的算法是一个有前途的框架,为有效的启发式算法的发展。
{"title":"An efficient divide and conquer algorithm for exact hazard free logic minimization","authors":"J. Rutten, Michel Berkelaar, C. V. Eijk, M. Kolsteren","doi":"10.1109/DATE.1998.655942","DOIUrl":"https://doi.org/10.1109/DATE.1998.655942","url":null,"abstract":"In this paper we introduce the first divide and conquer algorithm that is capable of exact hazard-free logic minimization in a constructive way. We compare our algorithm with the method of Dill and Nowick (1992), which was the only known method for exact hazard-free minimization. We show that our algorithm is much faster than the method proposed by Dill and Nowick by avoiding a significant part of the search space. We argue that the proposed algorithm is a promising framework for the development of efficient heuristic algorithms.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126163240","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}
引用次数: 4
Optimal temporal partitioning and synthesis for reconfigurable architectures 可重构体系结构的最佳时间划分和综合
Pub Date : 1998-02-23 DOI: 10.1109/DATE.1998.655887
Meenakshi Kaul, R. Vemuri
We develop a 0-1 non-linear programming (NLP) model for combined temporal partitioning and high-level synthesis from behavioral specifications destined to be implemented on reconfigurable processors. We present tight linearizations of the NLP model. We present effective variable selection heuristics for a branch and bound solution of the derived linear programming model. We show how tight linearizations combined with good variable selection techniques during branch and bound yield optimal results in relatively short execution times.
我们开发了一个0-1非线性规划(NLP)模型,用于结合时间划分和高级综合的行为规范,这些规范注定要在可重构处理器上实现。我们提出了NLP模型的紧密线性化。给出了线性规划模型分支定界解的有效变量选择启发式算法。我们展示了在分支和绑定期间紧密线性化与良好的变量选择技术相结合如何在相对较短的执行时间内产生最佳结果。
{"title":"Optimal temporal partitioning and synthesis for reconfigurable architectures","authors":"Meenakshi Kaul, R. Vemuri","doi":"10.1109/DATE.1998.655887","DOIUrl":"https://doi.org/10.1109/DATE.1998.655887","url":null,"abstract":"We develop a 0-1 non-linear programming (NLP) model for combined temporal partitioning and high-level synthesis from behavioral specifications destined to be implemented on reconfigurable processors. We present tight linearizations of the NLP model. We present effective variable selection heuristics for a branch and bound solution of the derived linear programming model. We show how tight linearizations combined with good variable selection techniques during branch and bound yield optimal results in relatively short execution times.","PeriodicalId":179207,"journal":{"name":"Proceedings Design, Automation and Test in Europe","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124692373","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
期刊
Proceedings Design, Automation and Test in Europe
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1