看板 NCTU_CS_EDA 關於我們 聯絡資訊
http://www.ispd.cc/contest.html The last few years have seen significant advances in the quality of global placement and routing algorithms, mainly due to the availability of large, challenging testcases by way of the ISPD 2005-2008 contests. The ISPD placement contests evaluated the placers based on the half-perimeter wire length (ISPD-05) and their spreading capability by way of a placement target density in addition to wire length and runtime (ISPD-06). Although wire length and spreading ability are important metrics, they still do not directly address a fundamental requirement for placement algorithms, namely,the ability to produce routable placements. In fact, routing congestion is a serious concern for advanced process technologies like 65nm and below. In light of the advances in global placement and routing technologies, the ISPD 2011 contest will be on "ROUTABILITY-DRIVEN PLACEMENT". In the spirit of the past ISPD contests, a new set of challenging industrial benchmarks will be released to test the routability of the placement algorithms. Please note, none of the benchmarks will have any artificial constraints like target density, etc., to enforce more spreading. The placer can use any technique to come up with a routable placement solution. The metrics for evaluation will be based on: Routability of a given placement. Overall runtime to generate a placement solution. As a part of the contest, two or three "golden" routers will be released to evaluate the routability of the placement algorithms. During the contest, all the golden routers will be run on every placement solution, and the best result will be used for each benchmark. The finalized metrics for evaluation / contest objective function will also be released along with the "golden" routers. -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.113.241.143
Topi:...... 11/11 14:35
※ 編輯: Topi 來自: 140.113.241.143 (11/11 14:47)