OpenROAD's unified application implementing an RTL-to-GDS Flow. Documentation at https://openroad.readthedocs.io/en/latest/
-
Updated
Jun 20, 2024 - Verilog
OpenROAD's unified application implementing an RTL-to-GDS Flow. Documentation at https://openroad.readthedocs.io/en/latest/
OpenROAD's scripts implementing an RTL-to-GDS Flow. Documentation at https://openroad-flow-scripts.readthedocs.io/en/latest/
🟢 super fast 🚀 and tiny 🐥 embedded device 𝘾 printf-like trace ✍ code, works also inside ⚡ interrupts ⚡ and real-time PC 💻 logging (trace ID visualization 👀)
This is a tutorial on standard digital design flow
AMF-Placer 2.0: An open-source timing-driven analytical mixed-size FPGA placer of heterogeneous resources (LUT/FF/LUTRAM/MUX/CARRY/DSP/BRAM...)
Easily benchmark PyTorch model FLOPs, latency, throughput, allocated gpu memory and energy consumption
Simplify VLSI (timing, power, noise, correlation, reliability) modeling and analysis with Characterization Description Format
This repository contains code and data for "Tik-Tok: The Utility of Packet Timing in Website Fingerprinting Attacks" paper, published in PETS 2020.
RTAS 2021 - Artifact Evaluation for "Timing Analysis of Asynchronized Distributed Cause-Effect Chains"
Evaluation Framework for Self-Suspending Task Systems
Compiler backend from packing to bitstream generation.
Gate-level timing estimation toolkit
This repository contains the code and data required to perform the analysis for the manuscript https://doi.org/10.1101/2021.09.22.21256632
Analysis of radio pulsar parameters and their relationships with nulling statistics
GG for Arduino is a serial console library. It also contains various functions for implementing the console, for example printf(). You can implement a command line interface on your Arduino and add your own commands. This library contains built-in commands that allow memory access and timing analysis.
GG はシリアルコンソールを実現するための支援ライブラリです。コンソールを組み込むための補助的なツール(例えば書式付出力や文字列変換)を含みます。 GG for CCRX は ルネサス RX でのポーティング例です。
A program that determines the largest number possible from the contents of a given integer array. The array contents should be appended to each other in any order to form the largest number possible. For example, given the array { 11, 67, 79, 7, 22, 13 }, the largest number that it is possible is 79767221311
This is a collection of scripts that is used to time DNS queries using BIND, and create DNS access traces with hit and miss times (cache hit and miss that is)
Add a description, image, and links to the timing-analysis topic page so that developers can more easily learn about it.
To associate your repository with the timing-analysis topic, visit your repo's landing page and select "manage topics."