TAILIEUCHUNG - Handbook of algorithms for physical design automation part 46

Handbook of Algorithms for Physical Design Automation part 46 provides a detailed overview of VLSI physical design automation, emphasizing state-of-the-art techniques, trends and improvements that have emerged during the previous decade. After a brief introduction to the modern physical design problem, basic algorithmic techniques, and partitioning, the book discusses significant advances in floorplanning representations and describes recent formulations of the floorplanning problem. The text also addresses issues of placement, net layout and optimization, routing multiple signal nets, manufacturability, physical synthesis, special nets, and designing for specialized technologies. It includes a personal perspective from Ralph Otten as he looks back on. | 432 Handbook of Algorithms for Physical Design Automation and TNS gain. Because the sensitivity analysis works best when the netweights are updated in small steps from their initial values it also adds a constant of total change to bound the netweights. The netweight can be computed as W i Worg i Slk i 0 Worg i a Slkf - Slk i 5Wk i ßSWs i Slk i 0 where WOTg z is the original netweight a and p set the bound of netweight changes and control the balance between WNS and TNS Dynamic Netweighting Static netweighting computes netweights once and does not update them during TDP. However wirelengths change during and after placement and the original timing analysis may not be valid. To overcome this problem dynamic netweighting methods were proposed to adjust weights during placement based on timing information available at the current placement stage. A simple dynamic netweighting scheme is to run multiple placement and netweighting iterations. This scheme can be applied on any placement and netweighting algorithms. This simple scheme however is often hard to converge without careful netweighting assignment. This is the so-called oscillation problem 33 . Weights are assigned by performing timing analysis for some given placement solution at the nth iteration 28 . Critical nets receive higher weights. At next iteration the lengths of those critical nets are reduced while the lengths of some noncritical nets may be increased resulting in a different set of critical and noncritical nets. If a net alternates between critical and noncritical nets we have an oscillation problem. To mitigate this problem one needs to either periodically recompute timing during the placement process 13 27 or use historical netweighting information to achieve stability 34 35 . Incremental Timing Analysis To periodically update weights during placement one needs to recompute timing during placement. One could incrementally update timing like Ref. 2 which only computes the .

TỪ KHÓA LIÊN QUAN
TAILIEUCHUNG - Chia sẻ tài liệu không giới hạn
Địa chỉ : 444 Hoang Hoa Tham, Hanoi, Viet Nam
Website : tailieuchung.com
Email : tailieuchung20@gmail.com
Tailieuchung.com là thư viện tài liệu trực tuyến, nơi chia sẽ trao đổi hàng triệu tài liệu như luận văn đồ án, sách, giáo trình, đề thi.
Chúng tôi không chịu trách nhiệm liên quan đến các vấn đề bản quyền nội dung tài liệu được thành viên tự nguyện đăng tải lên, nếu phát hiện thấy tài liệu xấu hoặc tài liệu có bản quyền xin hãy email cho chúng tôi.
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.