最小切割洗牌:解决最小切割放置的全局效应问题

25th ACM/IEEE, Design Automation Conference.Proceedings 1988. Pub Date : 1988-06-01 DOI:10.1109/DAC.1988.14842

I. Bhandari, Mark Hirsch, D. Siewiorek

{"title":"最小切割洗牌:解决最小切割放置的全局效应问题","authors":"I. Bhandari, Mark Hirsch, D. Siewiorek","doi":"10.1109/DAC.1988.14842","DOIUrl":null,"url":null,"abstract":"The global effect problem is introduced in the context of adapting min-cut partitioning for min-cut placement. A simplified version of the problem is solved in linear time by using a novel algorithm called the min-cut shuffle. A detailed analysis and implementation for the algorithm is presented.<<ETX>>","PeriodicalId":230716,"journal":{"name":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"The min-cut shuffle: toward a solution for the global effect problem of min-cut placement\",\"authors\":\"I. Bhandari, Mark Hirsch, D. Siewiorek\",\"doi\":\"10.1109/DAC.1988.14842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The global effect problem is introduced in the context of adapting min-cut partitioning for min-cut placement. A simplified version of the problem is solved in linear time by using a novel algorithm called the min-cut shuffle. A detailed analysis and implementation for the algorithm is presented.<<ETX>>\",\"PeriodicalId\":230716,\"journal\":{\"name\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DAC.1988.14842\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"25th ACM/IEEE, Design Automation Conference.Proceedings 1988.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DAC.1988.14842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

在采用最小切割分割进行最小切割放置的背景下，引入了全局效应问题。该问题的简化版本通过使用一种称为最小切割洗牌的新算法在线性时间内解决。给出了该算法的详细分析和实现。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

The min-cut shuffle: toward a solution for the global effect problem of min-cut placement

The global effect problem is introduced in the context of adapting min-cut partitioning for min-cut placement. A simplified version of the problem is solved in linear time by using a novel algorithm called the min-cut shuffle. A detailed analysis and implementation for the algorithm is presented.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

25th ACM/IEEE, Design Automation Conference.Proceedings 1988.

自引率

0.00%

发文量