A methodology for the construction of scheduled systems
Related publications (15)
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.
Dampers are devices that reduce delay jitter in the context of time-sensitive networks, by delaying packets for the amount written in packet headers. Jitter reduction is required by some real-time applications; beyond this, dampers have the potential to so ...
Distributed low-latency datacenter applications must meet strict service-level objectives in the order of microseconds. R2P2 is a novel datacenter transport protocol designed for such services. This work extends R2P2 with congestion control and request-lev ...
In this paper, we present a novel activity-based scheduling model that combines a continuous optimisation framework for temporal scheduling decisions (i.e. activity timings and durations) with traditional discrete choice models for non-temporal choice dime ...
Big-Data streaming applications are used in several domains such as social media analysis, financial analysis, video annotation, surveillance, medical services and traffic prediction. These applications, running on different types of platforms from mobile ...
Numerous Directed-Acyclic Graph (DAG) schedulers have been developed to improve the energy efficiency of various multi-core platforms. However, these schedulers make a priori assumptions about the relationship between the task dependencies, and they are un ...
Institute of Electrical and Electronics Engineers2014
In this paper, we present a novel activity-based scheduling model that combines a continuous optimisation framework for temporal scheduling decisions (i.e. activity timings and durations) with traditional discrete choice models for non-temporal choice dime ...
Modern computing systems are based on multi-processor systems, i.e. multiple cores on the same chip. Hard real-time systems are required to perform particular tasks within certain amount of time; failure to do so characterises an unaccepted behavior. Hard ...
In periodic scheduling jobs arrive regularly and have to be executed on one or several machines or processors. An enormous amount of literature has been published on this topic, e.g. the founding work of Liu & Layland [LL73] is among the top cited computer ...
We consider several real-time scheduling problems on heterogeneous multiprocessor platforms, in which the different processors share a common memory pool. These include (i)~scheduling a collection of implicit-deadline sporadic tasks with the objective of m ...
In multiview applications, multiple cameras acquire the same scene from different viewpoints and produce correlated video streams. This results in large amounts of highly redundant data. In order to save resources, it is critical to handle properly this co ...