Publications associées à Dépassement de tampon

EdgeAI-Aware Design of In-Memory Computing Architectures

Driven by the demand for real-time processing and the need to minimize latency in AI algorithms, edge computing has experienced remarkable progress. Decision-making AI applications stand out for their heavy reliance on data-centric operations, predominantl ...

EPFL2024

Scaling Language Features for Program Verification

Georg Stefan Schmid

Formal verification of real-world software systems remains challenging for a number of reasons, including lack of automation, friction in specifying properties, and limited support for the diverse programming paradigms used in industry. In this thesis we m ...

EPFL2022

Perimeter Control and Route Guidance of Multi-Region MFD Systems With Boundary Queues Using Colored Petri Nets

Nikolaos Geroliminis, Anastasios Kouvelas, Hui Fu

Perimeter control based on Macroscopic Fundamental Diagram (MFD) aims to meter the number of transferring vehicles at the periphery of the protected urban region in order to obtain the desired number of vehicles in that region. The advantage of perimeter c ...

IEEE Institute of Electrical and Electronics Engineers2022

A Computational Method for Identifying the Optimum Buffer Size in the Era of Zero Defect Manufacturing

Dimitrios Kyritsis, Ali Boujemaoui, Foivos Psarommatis Giannakopoulos

Decreasing defects, waste time, meeting customer demand and being adaptable are the goals of a Zero Defect Manufacturing (ZDM) strategy. Scheduling is an important tool to perform that. It should take in account buffer size allocation. In this study, a met ...

SPRINGER INTERNATIONAL PUBLISHING AG2020

Shrink It or Shed It! Minimize the Use of LSQs in Dataflow Designs

Paolo Ienne, Andrea Guerrieri, Lana Josipovic, Atri Bhattacharyya

When applications have unpredictable memory accesses or irregular control flow, dataflow circuits overcome the limitations of statically scheduled high-level synthesis (HLS). If memory dependences cannot be determined at compile time, dataflow circuits rel ...

IEEE COMPUTER SOC2019

Forbidden induced subposets of given height

Istvan Tomon

Let P be a partially ordered set. The function La* (n, P) denotes the size of the largest family F subset of 2([n]) that does not contain an induced copy of P. It was proved by Methuku and Palvolgyi that there exists a constant C-P (depending only on P) su ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

Butterfly Attack: Adversarial Manipulation of Temporal Properties of Cyber-Physical Systems

Mathias Josef Payer, Amir Aminifar

Increasing internet connectivity poses an existential threat for cyber-physical systems. Securing these safety-critical systems becomes an important challenge. Cyber-physical systems often comprise several control applications that are implemented on share ...

IEEE2019

Unified prefetching into instruction cache and branch target buffer

Babak Falsafi, Boris Robert Grot, Ilknur Cansu Kaynak

A system and method of coupling a Branch Target Buffer (BTB) content of a BTB with an instruction cache content of an instruction cache. The method includes: tagging a plurality of target buffer entries that belong to branches within a same instruction blo ...

2017

Near-optimal Deployment of Dataflow Applications on Many-core Platforms with Real-time Guarantees

Alena Simalatsar, Stefanos Skalistis

Safe and optimal deployment of data-streaming applications on many-core platforms requires the realistic estimation of task Worst-Case Execution Time (WCET). On the other hand, task WCET depends on the deployment solution, due to the varying number of inte ...

IEEE2017

Buffer overlow vulnerabilities in CUDA: a preliminary analysis

Andrea Miele

We present a preliminary study of buffer overflow vulnerabilities in CUDA software running on GPUs. We show how an attacker can overrun a buffer to corrupt sensitive data or steer the execution flow by overwriting function pointers, e.g., manipulating the ...

Springer France2015

Online Updates on Data Warehouses via Judicious Use of Solid-State Storage

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

Data warehouses have been traditionally optimized for read-only query performance, allowing only offline updates at night, essentially trading off data freshness for performance. The need for 24x7 operations in global markets and the rise of online and oth ...

Assoc Computing Machinery2015

Confluence: unified instruction supply for scale-out servers

Babak Falsafi, Boris Robert Grot, Ilknur Cansu Kaynak

Multi-megabyte instruction working sets of server workloads defy the capacities of latency-critical instruction-supply components of a core; the instruction cache (L1-I) and the branch target buffer (BTB). Recent work has proposed dedicated prefetching tec ...

ACM Press2015

Design of a diversion structure for the management of residual risks using physical model tests

Giovanni De Cesare, Raphaël Sprenger, Antoine Magnollay

As revitalization and protection against floods are essential in our time, the town of Delémont in Switzerland has set up a major project named “Delémont Marée Basse”. Part of the project, the residual risk plans to be managed by a lateral overflow bypassi ...

CRC Press/Balkema2014

Compatible Buffer for Capillary Electrophoresis and Matrix-Assisted Laser Desorption/Ionization Mass Spectrometry

Hubert Girault, Natalia Gasilova, Liang Qiao, Hong-Xu Chen

A compatible buffer system for the coupling of capillary electrophoresis (CE) with matrix-assisted laser desorption/ionization mass spectrometry (MALDI-MS) was developed. The employed interface consists of a robot to drive a sliver-covered separation capil ...

Royal Society of Chemistry2013

MaSM: Efficient Online Updates in Data Warehouses

Anastasia Ailamaki, Manoussos Gavriil Athanassoulis, Radu Ioan Stoica

Data warehouses (DW) have been traditionally optimized for readonly query performance, allowing only offline updates at night, essentially trading off data freshness for performance. The need for 24x7 operations in global markets and the rise of online and ...

2011

Electron localization by a donor in the vicinity of a basal stacking fault in GaN

Benoît Marie Joseph Deveaud, Jean-Daniel Ganière, Pierre Michel Corfdir, Jelena Ristic

We study the effects of the vicinity between a shallow donor nucleus and an I1-type basal stacking fault (BSF) in GaN. We propose a numerical calculation, in the “effective potential” formalism, of energies and envelope functions of electrons submitted to ...

2009

LFI: A Practical and General Library-Level Fault Injector

George Candea, Paul Dan Marinescu

Fault injection, a critical aspect of testing robust systems, is often overlooked in the development of general-purpose software. We believe this is due to the absence of easy-to-use tools and to the extensive manual labor required to perform fault injecti ...

2009

Mechanisms for store-wait-free multiprocessors

Anastasia Ailamaki, Babak Falsafi

Store misses cause significant delays in shared-memory multiprocessors because of limited store buffering and ordering constraints required for proper synchronization. Today, programmers must choose from a spectrum of memory consistency models that reduce ...

2007

Autodafé: an Act of Software Torture

Martin Vuagnoux

Automated vulnerability searching tools have led to a dramatic increase of the rate at which such flaws are discovered. One particular searching technique is fault injection i.e. insertion of random data into input files, buffers or protocol packets, combi ...

Chaos Computer Club2005