1,009 research outputs found
Large-scale Join-Idle-Queue system with general service times
A parallel server system with identical servers is considered. The
service time distribution has a finite mean , but otherwise is
arbitrary. Arriving customers are be routed to one of the servers immediately
upon arrival. Join-Idle-Queue routing algorithm is studied, under which an
arriving customer is sent to an idle server, if such is available, and to a
randomly uniformly chosen server, otherwise. We consider the asymptotic regime
where and the customer input flow rate is . Under the
condition , we prove that, as , the sequence of
(appropriately scaled) stationary distributions concentrates at the natural
equilibrium point, with the fraction of occupied servers being constant equal
. In particular, this implies that the steady-state probability of
an arriving customer waiting for service vanishes.Comment: Revision. 11 page
Multi-capacity bin packing with dependent items and its application to the packing of brokered workloads in virtualized environments
Providing resource allocation with performance
predictability guarantees is increasingly important in cloud
platforms, especially for data-intensive applications, in which
performance depends greatly on the available rates of data
transfer between the various computing/storage hosts underlying
the virtualized resources assigned to the application. Existing
resource allocation solutions either assume that applications
manage their data transfer between their virtualized resources, or
that cloud providers manage their internal networking resources.
With the increased prevalence of brokerage services in cloud
platforms, there is a need for resource allocation solutions that
provides predictability guarantees in settings, in which neither
application scheduling nor cloud provider resources can be
managed/controlled by the broker. This paper addresses this
problem, as we define the Network-Constrained Packing (NCP)
problem of finding the optimal mapping of brokered resources
to applications with guaranteed performance predictability. We
prove that NCP is NP-hard, and we define two special instances
of the problem, for which exact solutions can be found efficiently.
We develop a greedy heuristic to solve the general instance of the
NCP problem , and we evaluate its efficiency using simulations
on various application workloads, and network models.This work was done while author was at Boston University. It was partially supported by NSF CISE awards #1430145, #1414119, #1239021 and #1012798. (1430145 - NSF CISE; 1414119 - NSF CISE; 1239021 - NSF CISE; 1012798 - NSF CISE
Network-constrained packing of brokered workloads in virtualized environments
Providing resource allocation with performance predictability guarantees is increasingly important in cloud platforms, especially for data-intensive applications, in which performance depends greatly on the available rates of data transfer between the various computing/storage hosts underlying the virtualized resources assigned to the application. Existing resource allocation solutions either assume that applications manage their data transfer between their virtualized resources, or that cloud providers manage their internal networking resources.With the increased prevalence of brokerage services in cloud platforms, there is a need for resource allocation solutions that provides predictability guarantees in settings, in which neither application scheduling nor cloud provider resources can be managed/controlled by the broker. This paper addresses this problem, as we define the Network-Constrained Packing (NCP)problem of finding the optimal mapping of brokered resources to applications with guaranteed performance predictability. We prove that NCP is NP-hard, and we define two special instances of the problem, for which exact solutions can be found efficiently. We develop a greedy heuristic to solve the general instance of the NCP problem, and we evaluate its efficiency using simulations on various application workloads, and network models.This work is supported by NSF CISE CNS Award #1347522, # 1239021, # 1012798
The divergence of theoretical and actual designs in a holonic packing cell
The aim of this paper is to take the reader through the decisions made in designing a holonic system architecture to support customised packing of gift boxes with personal grooming (Gillette) products. The paper highlights issues that cause a divergence between a theoretical model of a holonic system and the approach that was actually encoded
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
- âŠ