Concept

Scheduling (computing)

Related publications (275)

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods

We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a minimum number of machines and offsets of the tasks have to be computed. The ta ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 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

A projective algorithm for preemptive open shop scheduling with two multiprocessor groups

Dominique de Werra

We study a multiprocessor extension of the preemptive open shop scheduling problem, where the set of processors is partitioned into processor groups. We show that the makespan minimization problem is polynomially solvable for two multiprocessor groups even ...

2010

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2010

Deployment of job priority mechanisms in the Italian Cloud of the ATLAS experiment

Alessandro Barchiesi, Simone Campana

An optimized use of the Grid computing resources in the ATLAS experiment requires the enforcement of a mechanism of job priorities and of resource sharing among the different activities inside the ATLAS VO. This mechanism has been implemented through the V ...

2010

Dynamic network loading: a differentiable model that derives link state distributions

Michel Bierlaire, Gunnar Flötteröd, Carolina Osorio Pizano

We present a dynamic network loading model that yields queue length distributions, accounts for spillbacks, and maintains a differentiable mapping from the dynamic demand on the dynamic queue lengths. The approach builds upon an existing stationary queuein ...

2010

Decoupling contention management from scheduling

Anastasia Ailamaki, Frederick Ryan Johnson, Radu Ioan Stoica

Many parallel applications exhibit unpredictable communication between threads, leading to contention for shared objects. The choice of contention management strategy impacts strongly the performance and scalability of these applications: spinning provides ...

2010

Reducing the Energy Dissipation of the Issue Queue by Exploiting Narrow Immediate Operands

Yusuf Onur Koçberber, Ilknur Cansu Kaynak

In contemporary superscalar microprocessors, issue queue is a considerable energy dissipating component due its complex scheduling logic. In addition to the energy dissipated for scheduling activities, read and write lines of the issue queue entries are al ...

2010

Execution Synthesis: A Technique for Automated Software Debugging

George Candea, Cristian Zamfir

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

2010

User Selection Methods for Multiuser Two-Way Relay Communications Using Space Division Multiple Access

Ali H. Sayed

In this paper, we design a multiuser two-way relay system using space division multiple access (SDMA) communications and devise an optimal scheduling method that maximizes the sum rate while ensuring fairness among users. To reduce the computational load a ...

IEEE2010

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.