404 research outputs found
System Stability Under Adversarial Injection of Dependent Tasks
Technological changes (NFV, Osmotic Computing, Cyber-physical Systems) are making very
important devising techniques to efficiently run a flow of jobs formed by dependent tasks in a set of servers.
These problem can be seen as generalizations of the dynamic job-shop scheduling problem, with very
rich dependency patterns and arrival assumptions. In this work, we consider a computational model of a
distributed system formed by a set of servers in which jobs, that are continuously arriving, have to be
executed. Every job is formed by a set of dependent tasks (i. e., each task may have to wait for others to
be completed before it can be started), each of which has to be executed in one of the servers. The arrival of
jobs and their properties is assumed to be controlled by a bounded adversary, whose only restriction is that
it cannot overload any server. This model is a non-trivial generalization of the Adversarial Queuing Theory
model of Borodin et al., and, like that model, focuses on the stability of the system: whether the number of
jobs pending to be completed is bounded at all times. We show multiple results of stability and instability for
this adversarial model under different combinations of the scheduling policy used at the servers, the arrival
rate, and the dependence between tasks in the jobs
Stability of Service under Time-of-Use Pricing
We consider "time-of-use" pricing as a technique for matching supply and
demand of temporal resources with the goal of maximizing social welfare.
Relevant examples include energy, computing resources on a cloud computing
platform, and charging stations for electric vehicles, among many others. A
client/job in this setting has a window of time during which he needs service,
and a particular value for obtaining it. We assume a stochastic model for
demand, where each job materializes with some probability via an independent
Bernoulli trial. Given a per-time-unit pricing of resources, any realized job
will first try to get served by the cheapest available resource in its window
and, failing that, will try to find service at the next cheapest available
resource, and so on. Thus, the natural stochastic fluctuations in demand have
the potential to lead to cascading overload events. Our main result shows that
setting prices so as to optimally handle the {\em expected} demand works well:
with high probability, when the actual demand is instantiated, the system is
stable and the expected value of the jobs served is very close to that of the
optimal offline algorithm.Comment: To appear in STOC'1
Learning and Management for Internet-of-Things: Accounting for Adaptivity and Scalability
Internet-of-Things (IoT) envisions an intelligent infrastructure of networked
smart devices offering task-specific monitoring and control services. The
unique features of IoT include extreme heterogeneity, massive number of
devices, and unpredictable dynamics partially due to human interaction. These
call for foundational innovations in network design and management. Ideally, it
should allow efficient adaptation to changing environments, and low-cost
implementation scalable to massive number of devices, subject to stringent
latency constraints. To this end, the overarching goal of this paper is to
outline a unified framework for online learning and management policies in IoT
through joint advances in communication, networking, learning, and
optimization. From the network architecture vantage point, the unified
framework leverages a promising fog architecture that enables smart devices to
have proximity access to cloud functionalities at the network edge, along the
cloud-to-things continuum. From the algorithmic perspective, key innovations
target online approaches adaptive to different degrees of nonstationarity in
IoT dynamics, and their scalable model-free implementation under limited
feedback that motivates blind or bandit approaches. The proposed framework
aspires to offer a stepping stone that leads to systematic designs and analysis
of task-specific learning and management schemes for IoT, along with a host of
new research directions to build on.Comment: Submitted on June 15 to Proceeding of IEEE Special Issue on Adaptive
and Scalable Communication Network
Actes du 11ème Atelier en Évaluation de Performances
International audienceLe présent document contient les actes du 11ème Atelier en Évaluation des Performances qui s'est tenu les 15-17 Mars 2016 au LAAS-CNRS, Toulouse. L’Atelier en Évaluation de Performances est une réunion destinée à faire s’exprimer et se rencontrer les jeunes chercheurs (doctorants et postdoctorants) dans le domaine de la Modélisation et de l’Évaluation de Performances, une discipline consacrée à l’étude et l’optimisation de systèmes dynamiques stochastiques et/ou temporisés apparaissant en Informatique, Télécommunications, Productique et Robotique entre autres. La présentation informelle de travaux, même en cours, y est encouragée afin de renforcer les interactions entre jeunes chercheurs et préparer des soumissions de nouveaux projets scientifiques. Des exposés de synthèse sur des domaines de recherche d’actualité, donnés par des chercheurs confirmés du domaine renforcent la partie formation de l’atelier
- …