TAILIEUCHUNG - High Level Synthesis: from Algorithm to Digital Circuit- P4

High Level Synthesis: from Algorithm to Digital Circuit- P4: This book presents an excellent collection of contributions addressing different aspects of high-level synthesis from both industry and academia. "High-Level Synthesis: from Algorithm to Digital Circuit" should be on each designer's and CAD developer's shelf, as well as on those of project managers who will soon embrace high level design and synthesis for all aspects of digital system design. | 16 R. Gupta and F. Brewer complex scheduling algorithms to accommodate the implied constraints inherent in the chosen hardware models. Improvements in the underlying algorithms later allowed for simultaneous consideration of timing and resource constraints however the complexity of such optimization limits their use to relatively small designs or forces the use of rather coarse heuristics as was done in the Behavioral Compiler tool from Synopsys. More recent scheduling algorithms Wave Scheduling Symbolic Scheduling ILP and Interval Scheduling allow for automated exploration of speculative execution in systematic ways to increase the available parallelism in a design. At the high end of this spectrum the distinction between static pre-determined execution patterns and dynamic run-time determined execution patterns are blurred by the inclusion of arbitration and local control mechanisms. History High-level synthesis HLS has been a major preoccupation of CAD researchers since the late 1970s. Table lists major time points in the history of HLS research through the eighties and the nineties this list of readings would be typical of a researcher active in the area throughout this period. As with any history this is by no means a comprehensive listing. We have intentionally skipped some important developments in this decade since these are still evolving and it is too early to look back and declare success or failure. Early work in HLS examined scheduling heuristics for data-flow designs. The most straightforward approaches include scheduling all operations as soon as possible ASAP and scheduling the operations as late as possible ALAP 5-8 . These were followed by a number of heuristics that used metrics such as urgency 9 and mobility 10 to schedule operations. The majority of the heuristics were derived from basic list scheduling where operations are scheduled relative to an ordering based on control and data dependencies 11-13 . Other approaches include .

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.