EDBT 2026 Demo / reviewers in the wild / expert
Masaki Kobata
dblp:37/3587
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Reconfigurable computing and FPGAs · 56% Electronic design automation · 44% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Reconfigurable computing and FPGAs › FPGA physical design
FPGA clustering |
0.1 | 1 | 2006 | Effective clustering technique to optimize routability of outer cluster nets · FPGA 2006 |
Electronic design automation › physical design › routing › routability
routability optimization |
0.1 | 1 | 2006 | Effective clustering technique to optimize routability of outer cluster nets · FPGA 2006 |
Methods — techniques the papers use, named apart from their topics
evaluation functions · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | Effective clustering technique to optimize routability of outer cluster netsabstractWe also study a clustering technique for a cluster-based FPGA to optimize the routability of outer cluster nets. Prior research of FPGA clustering aims to take in inter-cluster connections to utilize the various advantages of the local interconnection in the cluster. Taking in the inter-cluster connections to the cluster can improve the FPGA speed and area, and can lighten the burden of the placement and routing tool. However, many inter-cluster connections still remain in the outside cluster. The condition of these connections give the performance of the circuit big influence. Therefore, we propose the effective clustering technique to optimize routability of outer cluster nets which are not taken in. In order to reduce the used routing resources in FPGA, our technique uses two evaluation functions. One evaluation function can be reduced routing resources in the outside cluster. The second evaluation function can utilize various characteristics of the local routing resources in the inside cluster. Our clustering technique has the unusual ability in the optimization of routing resources concurrently. As a result, our method resulted in 21.4% improvement in terms of the routing area (16.6% on average), and the critical path delay is reduced by 28.0% (11.8% on average) compared to existing clustering method in the benchmark circuits. Masaki Kobata, Masahiro Iida, Toshinori Sueyoshi |
FPGA | 1 |