Increasing availability through maintainability growth using partial Multi Criteria Decision Making (pMCDM)

In the last decades considerations about equipments' availability became an important issue, as well as its dependence on components characteristics such as reliability and maintainability. This is particularly of outstanding importance if one is dealing with high risk industrial equipments, where these factors play an important and fundamental role in risk management when safety or huge economic values are in discussion. As availability is a function of reliability, maintainability, and maintenance support activities, the main goal is to improve one or more of these factors. This paper intends to show how maintainability can influence availability and present a methodology to select the most important attributes for maintainability using a partial Multi Criteria Decision Making (pMCDM). Improvements in maintainability can be analyzed assuming it as a probability related with a restore probability density function [g(t)].

Partial utility-driven scheduling for flexible SLA and pricing arbitration in clouds

Cloud SLAs compensate customers with credits when average availability drops below certain levels. This is too inflexible because consumers lose non-measurable amounts of performance being only compensated later, in next charging cycles. We propose to schedule virtual machines (VMs), driven by range-based non-linear reductions of utility, different for classes of users and across different ranges of resource allocations: partial utility. This customer-defined metric, allows providers transferring resources between VMs in meaningful and economically efficient ways. We define a comprehensive cost model incorporating partial utility given by clients to a certain level of degradation, when VMs are allocated in overcommitted environments (Public, Private, Community Clouds). CloudSim was extended to support our scheduling model. Several simulation scenarios with synthetic and real workloads are presented, using datacenters with different dimensions regarding the number of servers and computational capacity. We show the partial utility-driven driven scheduling allows more VMs to be allocated. It brings benefits to providers, regarding revenue and resource utilization, allowing for more revenue per resource allocated and scaling well with the size of datacenters when comparing with an utility-oblivious redistribution of resources. Regarding clients, their workloads’ execution time is also improved, by incorporating an SLA-based redistribution of their VM’s computational power.

JPEG decoder implementation on FPGA using dynamic partial reconfiguration

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Electrónica e telecomunicações

Partial classification of Lorenz knots: Syllable permutations of torus knots words

We define families of aperiodic words associated to Lorenz knots that arise naturally as syllable permutations of symbolic words corresponding to torus knots. An algorithm to construct symbolic words of satellite Lorenz knots is defined. We prove, subject to the validity of a previous conjecture, that Lorenz knots coded by some of these families of words are hyperbolic, by showing that they are neither satellites nor torus knots and making use of Thurston's theorem. Infinite families of hyperbolic Lorenz knots are generated in this way, to our knowledge, for the first time. The techniques used can be generalized to study other families of Lorenz knots.

Presentations for monoids of finite partial isometries

In this paper we give presentations for the monoid DPn of all partial isometries on {1,..., n} and for its submonoid ODPn of all order-preserving partial isometries.