Publication

A scalable and oblivious atomicity assertion

Publications associées (31)

Linebacker: Preserving Victim Cache Lines in Idle Register Files of GPUs

Modern GPUs suffer from cache contention due to the limited cache size that is shared across tens of concurrently running warps. To increase the per-warp cache size prior techniques proposed warp throttling which limits the number of active warps. Warp thr ...

ASSOC COMPUTING MACHINERY2019

Engineering and integration risks arising from advanced magnetic divertor configurations

Holger Reimerdes, Seungkyu Ha

The divertor configuration defines the power exhaust capabilities of DEMO as one of the major key design parameters and sets a number of requirements on the tokamak layout, including port sizes, poloidal field coil positions, and size of toroidal field coi ...

ELSEVIER SCIENCE SA2019

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

Feistel Networks (FN) are now being used massively to encrypt credit card numbers through format-preserving encryption. In our work, we focus on FN with two branches, entirely unknown round functions, modular additions (or other group operations), and when ...

2018

Generic Round-Function-Recovery Attacks for Feistel Networks over Small Domains

Serge Vaudenay, Fatma Betül Durak

ePrint2018

Single-server Multi-user Private Information Retrieval with Side Information

Michael Christoph Gastpar, Su Li

In the problem of private information retrieval with side information, a single user wants to recover one of the K independent messages which are stored at one or multiple servers. The user initially has a subset of messages as side information. The goal o ...

2018

Towards Scalable Personalization

Rhicheek Patra

The ever-growing amount of online information calls for Personalization. Among the various personalization systems, recommenders have become increasingly popular in recent years. Recommenders typically use collaborative filtering to suggest the most releva ...

EPFL2018

Explicit Conditions on Existence and Uniqueness of Load-Flow Solutions in Distribution Networks

Jean-Yves Le Boudec, Mario Paolone, Andrey Bernstein, Cong Wang

We present explicit sufficient conditions that guarantee the existence and uniqueness of the load-flow solution for distribution networks with a generic topology (radial or meshed) modeled with positive sequence equivalents. In the problem, we also account ...

2018

Comparison of L1 and L5 Bands GNSS Signals Acquisition

Cyril Botteron, Jérôme Leclère

Nowadays, civil Global Navigation Satellite System (GNSS) signals are available in both L1 and L5 bands. A receiver does not need to acquire independently the signals in both bands coming from a same satellite, since their carrier Doppler and code delay ar ...

2018

LTRF: Enabling High-Capacity Register Files for GPUs via Hardware/Software Cooperative Register Prefetching

Babak Falsafi, Hamid Sarbazi-Azad, Mario Paulo Drumond Lages De Oliveira, Seyed Borna Ehsani

Graphics Processing Units (GPUs) employ large register files to accommodate all active threads and accelerate context switching. Unfortunately, register files are a scalability bottleneck for future GPUs due to long access latency, high power consumption, ...

2018

Novel Algorithms For Clustering

James Peter Newling

Clustering is a method for discovering structure in data, widely used across many scientific disciplines. The two main clustering problems this dissertation considers are K-means and K-medoids. These are NP-hard problems in the number of samples and cluste ...

EPFL2018

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Volkan Cevher, Marwa El Halabi, Ya-Ping Hsieh, Cong Bang Vu, Van Quang Nguyen

In this paper, we consider composite convex minimization problems. We advocate the merit of considering Generalized Proximal gradient Methods (GPM) where the norm employed is not Euclidean. To that end, we show the tractability of the general proximity ope ...

2017