کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
865302 | 909659 | 2011 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Markov Clustering-Based Placement Algorithm for Hierarchical FPGAs*
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
سایر رشته های مهندسی
مهندسی (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Markov Clustering-Based Placement Algorithm for Hierarchical FPGAs* Markov Clustering-Based Placement Algorithm for Hierarchical FPGAs*](/preview/png/865302.png)
چکیده انگلیسی
Divide-and-conquer methods for FPGA placement algorithms including partition-based and cluster-based algorithms have shown the importance of good quality-runtime trade-off. This paper describes a cluster-based FPGA placement algorithm targeted to a new commercial hierarchical FPGA device. The algorithm is based on a Markov clustering algorithm that defines a sequence of stochastic matrices operating on a generating matrix from the input FPGA circuit netlist. The core of the algorithm tightly couples a Markov clustering process with a multilevel placement process. Tests show its excellent adaptability to hierarchical FPGAs. The average wirelength results produced by the algorithm are 22.3% shorter than the results produced by the current hierarchical FPGA placer.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Tsinghua Science & Technology - Volume 16, Issue 1, February 2011, Pages 62-68
Journal: Tsinghua Science & Technology - Volume 16, Issue 1, February 2011, Pages 62-68
نویسندگان
Dai (æ´æ), Zhou (å¨å¼º), Bian (边计年),