This work introduces scheduling strategies to maximize the expected numberof independent tasks that can be executed on a cloud platform within a given budgetand under a deadline constraint. Task execution times are not known before execution;instead, the only information available to the scheduler is that they obey some (unknown)probability distribution. The scheduler needs to acquire some information before decidingfor a cutting threshold: instead of allowing all tasks to run until completion, one maywant to interrupt long-running tasks at some point. In addition, the cutting thresholdmay be reevaluated as new information is acquired when the execution progresses further.This works presents several strategies to determine a good cutting th...
Scheduling independent tasks on a parallel platform is a widely-studied problem, in particular when ...
We study the resource-constrained project scheduling problem with stochastic activity durations. We ...
In this paper, we are interested in scheduling stochastic jobs on a reservation-based platform. Spec...
This work introduces scheduling strategies to maximize the expected numberof independent tasks that ...
This paper discusses scheduling strategies for the problem of maximizing theexpected number of tasks...
International audienceThis paper discusses scheduling strategies for the problem of maximizing the e...
This work introduces scheduling strategies to maximize the expected number of independent tasks that...
This report introduces several budget-aware algorithms to deploy scientific workflows on IaaS cloud ...
A project is a temporary endeavor to achieve clearly defined goals. Project management deals with th...
This paper introduces and assesses novel strategies to schedule firm real-time jobs on an overloaded...
This report, which is an update of [5], introduces several budget-aware algorithms to deploy scienti...
International audienceThis work introduces scheduling strategies to maximize the expected number of ...
Cloud computing promises the delivery of on-demand pay-per-use access to unlimited resources. Using ...
The project scheduling problem domain is an important research and applications area of engineering ...
Scheduling independent tasks on a parallel platform is a widely-studied problem, in particular when ...
We study the resource-constrained project scheduling problem with stochastic activity durations. We ...
In this paper, we are interested in scheduling stochastic jobs on a reservation-based platform. Spec...
This work introduces scheduling strategies to maximize the expected numberof independent tasks that ...
This paper discusses scheduling strategies for the problem of maximizing theexpected number of tasks...
International audienceThis paper discusses scheduling strategies for the problem of maximizing the e...
This work introduces scheduling strategies to maximize the expected number of independent tasks that...
This report introduces several budget-aware algorithms to deploy scientific workflows on IaaS cloud ...
A project is a temporary endeavor to achieve clearly defined goals. Project management deals with th...
This paper introduces and assesses novel strategies to schedule firm real-time jobs on an overloaded...
This report, which is an update of [5], introduces several budget-aware algorithms to deploy scienti...
International audienceThis work introduces scheduling strategies to maximize the expected number of ...
Cloud computing promises the delivery of on-demand pay-per-use access to unlimited resources. Using ...
The project scheduling problem domain is an important research and applications area of engineering ...
Scheduling independent tasks on a parallel platform is a widely-studied problem, in particular when ...
We study the resource-constrained project scheduling problem with stochastic activity durations. We ...
In this paper, we are interested in scheduling stochastic jobs on a reservation-based platform. Spec...