S. C. Maruvada, A. Berkman, K. Krishnamoorthy, F. Balasa
{"title":"模拟拓扑布局中的确定性跳跃表","authors":"S. C. Maruvada, A. Berkman, K. Krishnamoorthy, F. Balasa","doi":"10.1109/ICASIC.2005.1611437","DOIUrl":null,"url":null,"abstract":"This paper presents a novel algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible (S-F) binary tree representations (Balasa et al., 2004) of the layout, the novel approach employs 1-3 deterministic skip lists (Munro et al., 1992) and (Papadakis, 1993), exhibiting running times at least 20-30% better than previous (nonslicing) topological algorithms for analog placement, and significantly better (typically, over 100%) than more traditional approaches based on the absolute representation","PeriodicalId":431034,"journal":{"name":"2005 6th International Conference on ASIC","volume":"158 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Deterministic skip lists in analog topological placement\",\"authors\":\"S. C. Maruvada, A. Berkman, K. Krishnamoorthy, F. Balasa\",\"doi\":\"10.1109/ICASIC.2005.1611437\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a novel algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible (S-F) binary tree representations (Balasa et al., 2004) of the layout, the novel approach employs 1-3 deterministic skip lists (Munro et al., 1992) and (Papadakis, 1993), exhibiting running times at least 20-30% better than previous (nonslicing) topological algorithms for analog placement, and significantly better (typically, over 100%) than more traditional approaches based on the absolute representation\",\"PeriodicalId\":431034,\"journal\":{\"name\":\"2005 6th International Conference on ASIC\",\"volume\":\"158 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2005 6th International Conference on ASIC\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICASIC.2005.1611437\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 6th International Conference on ASIC","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASIC.2005.1611437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
摘要
提出了一种具有对称约束的器件级模拟放置算法。基于对布局的对称可行(S-F)二叉树表示(Balasa et al.， 2004)的探索，这种新方法采用了1-3个确定性跳跃表(Munro et al.， 1992)和(Papadakis, 1993)，在模拟放置方面，其运行时间至少比以前(非切片)拓扑算法好20-30%，并且比基于绝对表示的更传统的方法明显更好(通常超过100%)
Deterministic skip lists in analog topological placement
This paper presents a novel algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible (S-F) binary tree representations (Balasa et al., 2004) of the layout, the novel approach employs 1-3 deterministic skip lists (Munro et al., 1992) and (Papadakis, 1993), exhibiting running times at least 20-30% better than previous (nonslicing) topological algorithms for analog placement, and significantly better (typically, over 100%) than more traditional approaches based on the absolute representation
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
