Search results for "deadline"
showing 10 items of 12 documents
Scheduling independent stochastic tasks under deadline and budget constraints
2018
This article discusses scheduling strategies for the problem of maximizing the expected number of tasks that can be executed on a cloud platform within a given budget and under a deadline constraint. The execution times of tasks follow independent and identically distributed probability laws. The main questions are how many processors to enroll and whether and when to interrupt tasks that have been executing for some time. We provide complexity results and an asymptotically optimal strategy for the problem instance with discrete probability distributions and without deadline. We extend the latter strategy for the general case with continuous distributions and a deadline and we design an ef…
Approximation algorithm for constrained coupled-tasks scheduling problem
2014
International audience; We tackle the makespan minimization coupled-tasks problem in presence of compatibility constraints. In particular, we focus on stretched coupled-tasks, i.e. coupled-tasks having the same sub-tasks execution time and idle time duration. In such context, we propose some complexity results according to several parameters and we design an efficient polynomial-time approximation algorithm.
BARGAINING WITH COMMITMENT UNDER AN UNCERTAIN DEADLINE
2006
We consider an infinite horizon bargaining game in which a deadline can arise with positive probability and where players possess an endogenous commitment device. We show that for any truncation of the game, the equilibrium agreement can only take place if the deadline arises within this finite horizon. Since the deadline is an uncertain event, the equilibrium exhibits agreements which are delayed with positive probability.
Looking for the best modes helps solving the MRCPSP/max
2013
The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestin et al. [2009. An evolutionary algorithm for the resource-…
Tempi di produzione e tempi di consumo delle news: la rivoluzione del giornalismo on line
2013
Il saggio analizza i radicali cambiamenti delle ruotine produttive nei newsmedia on line
Optimal deadline assignment for periodic real-time tasks in dynamic priority systems
2006
Real-time systems are often designed using a set of periodic tasks. Task periods are usually set by the system requirements, but deadlines and computation times can be modified in order to improve system performance. Sensitivity analysis in real-time systems has focused on changes in task computation times using fixed priority analysis. Only a few studies deal with the modification of deadlines in dynamic priority scheduling. The aim of this work is to provide a sensitivity analysis for task deadlines in the context of dynamic-priority, pre-emptive, uniprocessor scheduling. In this paper, we present a deadline minimisation method that achieves the maximum reduction. As undertaken in other s…
Scheduling of Real-Time Networks with a Column Generation Approach
2013
We present an algorithm based on column generation for the real-time scheduling problem of allocating periodic tasks to electronic control units in multiple subsystems connected by a global bus. The allocation has to ensure that tasks can be scheduled, and messages between tasks in different subsystems can be transmitted over the global bus and meet their deadlines. Also tasks and messages occurring in a task chain must be scheduled in a way such that the sequence of execution meets their end-to-end deadline. We show that our approach computes the optimal allocation in our model and due to the column generation approach early provides lower bounds on the optimal value.
Dynamic scheduling of periodic skippable tasks in an overloaded real-time system
2008
International audience; The need for supporting dynamic real-time environments where changes in workloads may occur requires a scheduling framework that explicitly addresses overload conditions, allows the system to achieve graceful degradation and supports a mechanism capable of determining the load to be shed from the system to handle the overload. In applications ranging from video reception to air-craft control, tasks enter periodically and have response time constraints, but missing a deadline is acceptable, provided most deadlines are met. Such tasks are said to be occasionally skippable and have an assigned skip parameter. We look at the problem of uniprocessor scheduling of skippabl…
Los plazos para interponer recursos y de determinados procedimientos y actos tributarios durante el Estado de Alarma.
2020
[EN] Royal Decree 463/2020, of March 14, declared the state of alarm as a consequence of COVID-19. From this declaration, a series of royal decree-laws have followed one another that have introduced a series of changes in the financial system to adapt the tax obligations to the health crisis situation. In this sense, the deadlines for filing resource, the forms and deadlines for filing and paying declarations and self-settlement have been modified, as well as certain procedures and acts while this exceptional regime lasts. In this study we are going to analyze the adoption of these measures and their accommodation in Tax Law.
Deadline-based QoS Algorithms for High-performance Networks
2007
Quality of service (QoS) is becoming an attractive feature for high-performance networks and parallel machines because it could allow a more efficient use of resources. Deadline-based algorithms can provide powerful QoS provision. However, the cost associated with keeping ordered lists of packets makes them impractical for high-performance networks. In this paper, we explore how to adapt efficiently the earliest deadline first family of algorithms to the high-speed networks environments. The results show excellent performance using just two virtual channels, FIFO queues, and a cost feasible with today's technology.