Concept

Scheduling (computing)

Related publications (275)

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.

Impact analysis of a flexible air transportation system

Michel Bierlaire, Claudio Leonardi, Matteo Salani, Bilge Atasoy

The paper provides analytical evidence of the added-value of flexibility for air transportation systems. More specifically, the impact of a new innovative modular aircraft on the operations of an airline is deeply analyzed. The impact analysis is carried o ...

Editorial Board Ejtir2013

Secure Device Authentication Mechanisms for the Smart Grid-Enabled Home Area Networks

Erman Ayday

In this paper, we propose secure and intuitive device authentication techniques for the Smart Grid enabled Home Area Networks (HANs). We assume a distributed architecture for the HAN in which the smart appliances can communicate both with the smart meter a ...

2013

Is the Same Instance Type Created Equal? Exploiting Heterogeneity of Public Clouds

Hao Zhuang

Public cloud platforms might start with homogeneous hardware; nevertheless, because of inevitable hardware upgrades, or adding more capacity, the initial homogeneous platform will gradually evolve into heterogeneous as time passes by. The consequent perfor ...

2013

Execution Synthesis: A Technique for Automating the Debugging of Software

Cristian Zamfir

Debugging real systems is hard, requires deep knowledge of the target code, and is time-consuming. Bug reports rarely provide sufficient information for debugging, thus forcing developers to turn into detectives searching for an explanation of how the prog ...

EPFL2013

Understanding NVIDIA GPGPU Hardware

Ogier Philippe Maitre

This chapter presents NVIDIA general purpose graphical processing unit (GPGPU) architecture, by detailing both hardware and software concepts. The evolution of GPGPUs from the beginning to the most modern GPGPUs is presented in order to illustrate the tren ...

Springer Berlin Heidelber2013

Detecting pedestrian destinations from ubiquitous digital footprint

Antonin Danalet

Walking is the key for efficient multimodal transport systems. Pedestrian infrastructures, such as railway stations, face congestion and need to understand flows. Data is required for models that can help managers in their infrastructure planning. In this ...

2013

Multi-resource allocation in stochastic project scheduling

Daniel Kuhn, Wolfram Wiesemann

We propose a resource allocation model for project scheduling. Our model accommodates multiple resources and decision-dependent activity durations inspired by microeconomic theory. First, we elaborate a deterministic problem formulation. In a second stage, ...

2012

Zeta: Scheduling Interactive Services with Partial Execution

James Richard Larus, Sameh Mohamed Elnikety, Chenyu Yan

This paper presents a scheduling model for a class of interactive services in which requests are time bounded and lower result quality can be traded for shorter execution time. These applications include web search engines, finance servers, and other inter ...

ACM2012

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Martin Niemeier

This thesis is devoted to the design and analysis of algorithms for scheduling problems. These problems are ubiquitous in the modern world. Examples include the optimization of local transportation, managing access to concurrent resources like runways at a ...

EPFL2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing, in which p asyn- chronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key bui ...

2012