Concept

Switch (instruction)

Publications associées (28)

SAT-based Exact Modulo Scheduling Mapping for Resource-Constrained CGRAs

David Atienza Alonso, Giovanni Ansaloni, José Angel Miranda Calero, Rubén Rodríguez Álvarez, Juan Pablo Sapriza Araujo, Benoît Walter Denkinger

Coarse-Grain Reconfigurable Arrays (CGRAs) represent emerging low-power architectures designed to accelerate Compute-Intensive Loops (CILs). The effectiveness of CGRAs in providing acceleration relies on the quality of mapping: how efficiently the CIL is c ...

2024

Formalizing GADT constraint reasoning in Scala

Mario Bucev

Generalized algebraic data types (GADTs) are a powerful tool allowing to express invariants leveraging the type system. Scala 3 considerably improves the support of GADTs with respect to its predecessor Scala 2. A unique feature of Scala 3, compared to lan ...

2021

Combined Shear-Flexural Verification Of In Plane Loaded Reinforced And Unreinforced Masonry Walls

Lorenzo Benedetti

The safety verification of in-plane loaded masonry panels requires the evaluation of at least three different collapse conditions connected with overturning, shear sliding, and shear - compression failure at the panels' toe. In reinforced panels, the resis ...

INT CENTER NUMERICAL METHODS ENGINEERING2021

Template-assisted electrodeposition of nickel and nickel copper 3D microcomponents

Patrik Schürch

New types of metamaterials and architectured material require metallic materials with precise structural design in the microscale. However, additivemanufacturing of metallic structures in themicroscale has proven difficult, as the demand for the material q ...

EPFL2020

SpecROP: Speculative Exploitation of ROP Chains

Mathias Josef Payer, Atri Bhattacharyya, Andrés Sánchez Marín

Speculative execution attacks, such as Spectre, reuse code from the victim’s binary to access and leak secret information during speculative execution. Every variant of the attack requires very particular code sequences, necessitating elaborate gadget-sear ...

2020

On-the-fly and DAG-aware: Rewriting Boolean Networks with Exact Synthesis

Giovanni De Micheli, Mathias Soeken, Heinz Riener, Winston Jason Haaswijk

The paper presents a generalization of DAG-aware AIG rewriting for k-feasible Boolean networks, whose nodes are k-input lookup tables (k-LUTs). We introduce a high-effort DAG-aware rewriting algorithm, called cut rewriting, which uses exact synthesis to co ...

IEEE2019

Material and Electrical study of HfO2-Based Resistive Random Access Memories (ReRAMs)

Behnoush Attarimashalkoubeh

Resistive Random Access Memories (ReRAMs) have been researched intensively in the last past decades as a promising alternatives technology for the next-generation non-volatile memory (NVM) devices. ReRAMâs excellent performance properties such as high sw ...

EPFL2019

A Reliability and Efficiency Optimization System for Hard-Switching DC/DC Converters

Maher Kayal, Adil Koukab, Giacomo Ripamonti, Stefano Michelis, Federico Faccio

The Large Hadron Collider experiments at CERN will use power distribution schemes relying on integrated buck DC/DC converters. Due to the radiation-hardness requirements, the devices used for the development of such converters will have a voltage rating wh ...

IEEE2018

Efficient Online Processing for Advanced Analytics

Mohamed Elsayed Mohamed Ahmed El Seidy

With the advent of emerging technologies and the Internet of Things, the importance of online data analytics has become more pronounced. Businesses and companies are adopting approaches that provide responsive analytics to stay competitive in the global ma ...

EPFL2017

A fully geometric approach for interactive constraint-based structural equilibrium design

Corentin Jean Dominique Fivet

This paper introduces computational techniques to support architects and structural designers in the shaping of strut-and-tie networks in static equilibrium. Taking full advantage of geometry, these techniques build on the reciprocal diagrams of graphic st ...

Elsevier2015

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search