DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Event-based sensors have the potential to optimize energy consumption at every stage in the signal processing pipeline, including data acquisition, transmission, processing, and storage. However, almost all state-of-the-art systems are still built upon th ...

Next-generation implantable computational devices require long-term-stable electronic components capable of operating in, and interacting with, electrolytic surroundings without being damaged. Organic electrochemical transistors (OECTs) emerged as fitting ...

Machine learning and data processing algorithms have been thriving in finding ways of processing and classifying information by exploiting the hidden trends of large datasets. Although these emerging computational methods have become successful in today's ...

High-level synthesis (HLS) tools typically generate statically scheduled datapaths. Static scheduling implies that the resulting circuits have a hard time exploiting parallelism in code with potential memory dependences, with control dependences, or where ...

Activity-based models offer the potential of a far deeper understanding of daily mobility behaviour than trip-based models. However, activity-based models used both in research and practice have often relied on applying sequential choice models between sub ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

The performance of programs executed on heterogeneous parallel platforms largely depends on the design choices regarding how to partition the processing on the various different processing units. In other words, it depends on the assumptions and parameters ...

Quantum computing has made significant progress in recent years, with Google and IBM releasing quantum computers with 72 and 50 qubits, respectively. Google has also achieved quantum supremacy with its 54-qubit device, and IBM has announced the release of ...

High-level synthesis (HLS) is the process of automatically generating circuits out of high-level language descriptions. Previous research has shown that dynamically scheduled HLS through elastic circuit generation is successful at exploiting parallelism in ...

Approximate logic synthesis is an emerging field that tolerates errors in the synthesized logic circuits for better optimization quality. Indeed, in many computing problems, the requirement of preserving the exact functionality either results in unnecessar ...

DASS: Combining Dynamic & Static Scheduling in High-Level Synthesis

Chat with Graph Search

An Error-Based Approximation Sensing Circuit for Event-Triggered Low-Power Wearable Sensors

In Liquido Computation with Electrochemical Transistors and Mixed Conductors for Intelligent Bioelectronics

2D Nanosystems: Applications of 2D Semiconductors for In-Memory Computing

From C/C plus plus Code to High-Performance Dataflow Circuits

OASIS: Optimisation-based Activity Scheduling with Integrated Simultaneous choice dimensions

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Performance Estimation of High-Level Dataflow Program on Heterogeneous Platforms by Dynamic Network Execution

Optimizing Quantum Compilers: Efficient and Effective Algorithms

Unleashing Parallelism in Elastic Circuits with Faster Token Delivery

Logic Synthesis From Incomplete Specifications Using Disjoint Support Decomposition