Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 2 of 2
Full-Text Articles in Engineering
A Finite Domain Constraint Approach For Placement And Routing Of Coarse-Grained Reconfigurable Architectures, Rohit Saraswat
A Finite Domain Constraint Approach For Placement And Routing Of Coarse-Grained Reconfigurable Architectures, Rohit Saraswat
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Scheduling, placement, and routing are important steps in Very Large Scale Integration (VLSI) design. Researchers have developed numerous techniques to solve placement and routing problems. As the complexity of Application Specific Integrated Circuits (ASICs) increased over the past decades, so did the demand for improved place and route techniques. The primary objective of these place and route approaches has typically been wirelength minimization due to its impact on signal delay and design performance. With the advent of Field Programmable Gate Arrays (FPGAs), the same place and route techniques were applied to FPGA-based design. However, traditional place and route techniques may …
A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver
A Methodology To Design Pipelined Simulated Annealing Kernel Accelerators On Space-Borne Field-Programmable Gate Arrays, Jeffrey Michael Carver
All Graduate Theses and Dissertations, Spring 1920 to Summer 2023
Increased levels of science objectives expected from spacecraft systems necessitate the ability to carry out fast on-board autonomous mission planning and scheduling. Heterogeneous radiation-hardened Field Programmable Gate Arrays (FPGAs) with embedded multiplier and memory modules are well suited to support the acceleration of scheduling algorithms. A methodology to design circuits specifically to accelerate Simulated Annealing Kernels (SAKs) in event scheduling algorithms is shown. The main contribution of this thesis is the low complexity scoring calculation used for the heuristic mapping algorithm used to balance resource allocation across a coarse-grained pipelined data-path. The methodology was exercised over various kernels with different …