Publications associées à Overhead (computing)

Safe Low-Level Code Without Overhead is Practical

Developers write low-level systems code in unsafe programming languages due to performance concerns. The lack of safety causes bugs and vulnerabilities that safe languages avoid. We argue that safety without run-time overhead is possible through type invar ...

IEEE COMPUTER SOC2023

Preventing Use-After-Free Attacks with Fast Forward Allocation

Sanidhya Kashyap, Jungwon Lim

Memory-unsafe languages are widely used to implement critical systems like kernels and browsers, leading to thousands of memory safety issues every year. A use-after-free bug is a temporal memory error where the program accidentally visits a freed memory l ...

USENIX ASSOC2021

Biosensors for Bimolecular Computing: a Review and Future Perspectives

Sandro Carrara, Danilo Demarchi, Simone Aiassa

Biomolecular computing is the field of engineering where computation, storage, communication, and coding are obtained by exploiting interactions between biomolecules, especially DNA, RNA, and enzymes. They are a promising solution in a long-term vision, br ...

SPRINGER2020

Fine-Grain Checkpointing with In-Cache-Line Logging

James Richard Larus, David Teksen Aksun, Nachshon Cohen

Non-Volatile Memory offers the possibility of implementing high-performance, durable data structures. However, achieving performance comparable to well-designed data structures in non-persistent (transient) memory is difficult, primarily because of the cos ...

ACM2019

Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

Eric Bezzam, Ivan Dokmanic, Robin Scheibler

We present pyroomacoustics, a software package aimed at the rapid development and testing of audio array processing algorithms. The content of the package can be divided into three main components: an intuitive Python object-oriented interface to quickly c ...

IEEE2018

SMT-Based Checking of Predicate-Qualified Types for Scala

Viktor Kuncak, Georg Stefan Schmid

We present qualified types for Scala, a form of refinement types adapted to the Scala language. Qualified types allow users to refine base types and classes using predicate expressions. We implemented a type checker for qualified types that is embedded in ...

Assoc Computing Machinery2016

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

In concurrent systems without automatic garbage collection, it is challenging to determine when it is safe to reclaim memory, especially for lock-free data structures. Existing concurrent memory reclamation schemes are either fast but do not tolerate proce ...

2016

Fast and Robust Memory Reclamation for Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Oana Maria Balmau

2016

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.

Overhead (computing)

Safe Low-Level Code Without Overhead is Practical

Preventing Use-After-Free Attacks with Fast Forward Allocation

Biosensors for Bimolecular Computing: a Review and Future Perspectives

System Support for Efficient Replication in Distributed Systems

Fine-Grain Checkpointing with In-Cache-Line Logging

Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

Every data structure deserves lock-free memory reclamation

SMT-Based Checking of Predicate-Qualified Types for Scala

Fast and Robust Memory Reclamation for Concurrent Data Structures

Fast and Robust Memory Reclamation for Concurrent Data Structures

Graph Chatbot

Chattez avec Graph Search

Preventing Use-After-Free Attacks with Fast Forward Allocation

Fine-Grain Checkpointing with In-Cache-Line Logging

SMT-Based Checking of Predicate-Qualified Types for Scala

Biosensors for Bimolecular Computing: a Review and Future Perspectives

Safe Low-Level Code Without Overhead is Practical

System Support for Efficient Replication in Distributed Systems

Every data structure deserves lock-free memory reclamation

Pyroomacoustics: A Python Package For Audio Room Simulation And Array Processing Algorithms

Fast and Robust Memory Reclamation for Concurrent Data Structures

Fast and Robust Memory Reclamation for Concurrent Data Structures