Concept

Fog computing

Publications associées (33)

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

Dynamic NoC buffer allocation for MPSoC timing side channel attack protection

Mathias Soeken

Multi-Processors Systems-on-Chip (MPSoCs), as a key technology enabler of the new computation paradigm Internet-of-Things (IoT), are exposed to attacks. Malicious applications can be downloaded at runtime to the MPSoC, infect IPs and open doors to perform ...

IEEE2016

Exploiting Circuit Duality to Speed Up SAT

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Maciej Jerzy Ciesielski

In this paper, we establish a non-trivial duality between tautology and contradiction check to speed up circuit SAT. Tautology check determines if a logic circuit is true in every possible interpretation. Analogously, contradiction check dete ...

IEEE2015

Computing in social networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a symmetric function f : V-n -> U of their inputs in a set of constant si ...

Elsevier2014

Smart device paradigm Standardization for Online Labs

Denis Gillet, Christophe Salzmann

This paper introduce the smart device paradigm and it usage to streamline the development of the next generation of online labs where more intelligence is placed at the server side and little or no assumption is made about the client. The requirements, the ...

2013

Instant Pickles: Generating Object-Oriented Pickler Combinators for Fast and Extensible Serialization

Martin Odersky, Philipp Haller, Eugene Burmako

As more applications migrate to the cloud, and as "big data" edges into even more production environments, the performance and simplicity of exchanging data between compute nodes/devices is increasing in importance. An issue central to distributed programm ...

Assoc Computing Machinery2013

Amazon Web Services- a Case Study

Rammohan Narendula

The Amazon Web Services (AWS) is a set (more than 25) of proprietary web-based services owned by Amazon.com. All these services ranging from simple storage to sophisticated database services constitute the cloud platform oered by Amazon. An extensive list ...

2012

Generalized Universality

Rachid Guerraoui

State machine replication reduces distributed to centralized computing. Any sequential service, modeled by a state machine, can be replicated over any number of processes and made highly available to all of them. At the heart of this fundamental reduction ...

Springer Berlin Heidelberg2011

A Modular Approach towards Wearable Computing

Xavier Righetti

Thanks to recent improvements in electronics, conductive materials and energy storage capabilities, we are now able to embed small circuits but also ultra-mobile PCs (UMPC) into clothes. These devices are able to sense, process and communicate information ...

EPFL2010

Context Aware, Multimodal, and Semantic Rendering Engine

Patrick Salamin

Nowadays, several techniques exist to render digital content such as graphics, audio, haptic, etc. Unfortunately, they require different faculties that cannot always be applied, e.g. providing a picture to a blind person would be useless. In this thesis, w ...

EPFL2010

Computing in Social Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Andrei Giurgiu

This paper defines the problem of Scalable Secure Computing in a Social network: we call it the S-3 problem. In short, nodes, directly reflecting on associated users, need to compute a function f : V -> U of their inputs in a set of constant size, in a sca ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010