An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

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.

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

This paper rethinks Sharpness-Aware Minimization (SAM), which is originally formulated as a zero-sum game where the weights of a network and a bounded perturbation try to minimize/maximize, respectively, the same differentiable loss. We argue that SAM shou ...

Effective caching is crucial for performance of modern-day computing systems. A key optimization problem arising in caching – which item to evict to make room for a new item – cannot be optimally solved without knowing the future. There are many classical ...

Weighted flow time is a fundamental and very well-studied objective function in scheduling. In this paper, we study the setting of a single machine with preemptions. ...

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

An a posteriori error estimate is derived for the approximation of the transport equation with a time dependent transport velocity. Continuous, piecewise linear, anisotropic finite elements are used for space discretization, the Crank-Nicolson scheme schem ...

We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is, of course, to minimize both the number of bins used as well as the amount of repacking. ...

Vulnerability metrics play a key role in the understanding of cascading failures and target/random attacks to a network. The graph fragmentation problem (GFP) is the result of a worst-case analysis of a random attack. We can choose a fixed number of indivi ...

We present a novel anytime heuristic (ALMA), inspired by the human principle of altruism, for solving the assignment problem. ALMA is decentralized, completely uncoupled, and requires no communication between the participants. We prove an upper bound on th ...

The general license application (RBG) for the Swiss deep geological repository will be submitted in 2024. Furthermore, the decommissioning of the nuclear power plants (NPPs) is coming soon, with the Mühleberg NPP (KKM) scheduled to shut down in 2019. In su ...

In this paper, we prove several extremal results for geometrically defined hypergraphs. In particular, we establish an improved lower bound, single exponentially decreasing in k, on the best constant delta > 0 such that the vertex classes P-1,...,P-k of ev ...

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

Non-volatile memory (NVM) promises fast, byte-addressable and durable storage, with raw access latencies in the same order of magnitude as DRAM. But in order to take advantage of the durability of NVM, programmers need to design persistent objects which ma ...

Shoals of small fishes can change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. In this paper, we study the analog problem of distributed pattern formation. A set of processes needs to move ...

Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...

Surface scattering is the key limiting factor to thermal transport in dielectric crystals as the length scales are reduced or when temperature is lowered. To explain this phenomenon, it is commonly assumed that the mean free paths of heat carriers are boun ...

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...

We study jump-penalized estimators based on least absolute deviations which are often referred to as Potts estimators. They are estimators for a parsimonious piecewise constant representation of noisy data having a noise distribution which has heavier tail ...

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

Chattez avec Graph Search

A ride time-oriented scheduling algorithm for dial-a-ride problems

Improving SAM Requires Rethinking its Optimization Formulation

Robust Learning-Augmented Caching: An Experimental Study

A (2+epsilon)-Approximation Algorithm for Preemptive Weighted Flow Time on a Single Machine

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

An adaptive algorithm for the transport equation with time dependent velocity

Fully dynamic bin packing revisited

Graph fragmentation problem: analysis and synthesis

Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior

High-Fidelity Determination of Nuclide Inventories for Radioactive Waste Disposal

A Polynomial Regularity Lemma For Semialgebraic Hypergraphs And Its Applications In Geometry And Property Testing

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

The Inherent Cost of Remembering Consistently

Collision-Free Pattern Formation

The Inherent Cost of Remembering Consistently

Capacity and Data Complexity in Multidimensional Linear Attack

Boltzmann Transport in Nanostructures as a Friction Effect

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Jump-Penalized Least Absolute Values Estimation of Scalar or Circle-Valued Signals

Proactive Synthesis of Recursive Tree-to-String Functions from Examples