%0 Journal Article
%T A Block Placement Algorithm with Predefined Coordinate Alignment Constraint Based on Sequence Pair Representation<br>基于序列对表示的对齐约束模块布局算法
%A LIU Rui
%A HONG Xian-Long
%A DONG She-Qin
%A GU Jun
%A <br>刘锐
%A 洪先龙
%A 董社勤
%A 顾钧
%J 软件学报
%D 2003
%I 
%X In the system on a chip, some cells should be placed along a predefined coordinate within a relatively small region. This constraint comes from the requirement that the data should be ready on the common bus at the same time. In this paper, the module placement problem is studied where some modules have the predefined coordinate alignment (PCA) constraint. The relations are given between constrained modules, from which a necessary condition is induced. A polynomial-time algorithm is developed that can guarantee a feasible placement is always obtainable. The algorithm is implemented and tested on ami33 and ami49. The experimental results show that it is effective.
%K module placement
%K predefined coordinate alignment constraint
%K sequence pair<br>模块布局
%K 预定坐标线对齐约束
%K 序列对
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=5AB602E70AED7967&yid=D43C4A19B2EE3C0A&vid=F3583C8E78166B9E&iid=5D311CA918CA9A03&sid=782B98DFA363AFCB&eid=AFD02B86BFB3C7FC&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=13