Concept

Utility computing

Related publications (98)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Meetings through the Cloud: Privacy-Preserving Scheduling on Mobile Devices

Jean-Pierre Hubaux, Imad Aad, Murtuza Jadliwala, Igor Bilogrevic, Valtteri Niemi

Mobile devices are increasingly being used to store and manage users' personal information, as well as to access popular third-party context-based services. Very often, these applications need to determine common availabilities among a set of user schedule ...

Elsevier2011

A Modeling Framework for Analyzing the Viability of Service Systems

Gil Regev, Alain Wegmann, Arash Golnam

Recent research has explored the principles of service system viability based on systems inquiry invoking perspectives from Systems Theory and Cybernetics in particular Stafford Beer’s viable systems model (VSM). However based on Banathy & Jenlink (2004), ...

2011

Toolchain for Online Modeling of the LHC

Xavier Buffat, Massimo Giovannozzi

The control of high intensity beams in a high energy, su- perconducting machine with complex optics like the CERN Large Hadron Collider (LHC) is challenging not only from the design aspect but also for operation towards physics production. To support the L ...

2011

OpenMP parallelization of the three-dimensional distinct lattice spring model

Jiannong Fang, Liang Sun, Gaofeng Zhao, Jianbo Zhu

This paper presents the OpenMP parallel implementation of the Distinct Lattice Spring Model (DLSM). The motivation of this study is to reduce the computing time and increase the computational capacity of the DLSM code. Firstly, the basic theory of DLSM is ...

Crc Press-Taylor & Francis Group, 6000 Broken Sound Parkway Nw, Ste 300, Boca Raton, Fl 33487-2742 Usa2010

A Tighter Analysis of Work Stealing

Nicolas Gabriel Gast, Denis Trystram

Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost for managing a single centralized list becomes prohibitive. The objective of this wor ...

Springer Berlin Heidelberg2010

Real-time GNSS software receivers Challenges, status and perspectives

Pierre-André Farine, Cyril Botteron, Marcel Baracchi Frei

The idea of a software receiver is to replace the data processing implemented in hardware with software and to sample the analog input signal as close to the antenna as possible. Thus, the hardware is reduced to the minimum (antenna and analog to digital c ...

2010

The Heard-Of model: computing in distributed systems with benign faults

André Schiper

Problems in fault-tolerant distributed computing have been studied in a variety of models. These models are structured around two central ideas: (1) degree of synchrony and failure model are two independent parameters that determine a particular type of sy ...

Springer Verlag2009

Comparison of Methods for Increasing the Performance of a DUA Computation

Computing realistic routes for a given road network and a known demand of vehicles is one of the most important steps when preparing a road traffic simulation. The approach developed by Christian Gawron in 1998 which we use for this purpose computes a dyna ...

2008

Optimal application-oriented resource brokering in a high performance computing grid

Vincent Keller

In the world of High Performance Computing (newly renamed "High Productivity Computing"), where the race for performance is on, where the hunt for the last Flop rages and where the developers swear by the Cult of Power, the different applications have diff ...

EPFL2008

Composite Kernel Learning

The Support Vector Machine (SVM) is an acknowledged powerful tool for building classifiers, but it lacks flexibility, in the sense that the kernel is chosen prior to learning. Multiple Kernel Learning (MKL) enables to learn the kernel, from an ensemble of ...

Omnipress2008