The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we present a temperature-aware global router that considers the reliability of interconnects by improving a state-of-the-art global router, NTHU-Route 2.0, with the following enhancements: (1) a temperature-aware L-shaped routing method employed during initial routing, (2) two temperature-aware cost functions employed during rip-up and reroute, and (3) three implementation techniques...
This paper presents a robust global router called NTHU-Route 2.0 that improves the solution quality and runtime of NTHU-Route by the following enhancements: 1) a new history based cost function; 2) new ordering methods for congested region identification and rip-up and reroute; and 3) two implementation techniques. We report convincing experimental results to show the effectiveness of each individual...
We present in this paper a fast and stable global router called NTHU-Route 2.0 that improves the solution quality and runtime of a state-of-the-art router, NTHU-Route, by the following enhancements: (1) a new history based cost function, (2) new ordering methods for congested region identification and rip-up and reroute, and (3) two implementation techniques. The experimental results show that NTHU-Router...
We study in this paper the feasibility problem for two-way circuit partitioning subject to complex resource constraints. We first prove that the problem is in general NP-complete. We then consider two special cases of the problem, and present polynomial-time algorithms for them. Finally we give a backtracking algorithm to solve the general case. To reduce the run time and the storage space of the...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.