4 resultados para projection onto convex sets
em Instituto Politécnico do Porto, Portugal
Resumo:
Cloud computing is increasingly being adopted in different scenarios, like social networking, business applications, scientific experiments, etc. Relying in virtualization technology, the construction of these computing environments targets improvements in the infrastructure, such as power-efficiency and fulfillment of users’ SLA specifications. The methodology usually applied is packing all the virtual machines on the proper physical servers. However, failure occurrences in these networked computing systems can induce substantial negative impact on system performance, deviating the system from ours initial objectives. In this work, we propose adapted algorithms to dynamically map virtual machines to physical hosts, in order to improve cloud infrastructure power-efficiency, with low impact on users’ required performance. Our decision making algorithms leverage proactive fault-tolerance techniques to deal with systems failures, allied with virtual machine technology to share nodes resources in an accurately and controlled manner. The results indicate that our algorithms perform better targeting power-efficiency and SLA fulfillment, in face of cloud infrastructure failures.
Resumo:
It is generally challenging to determine end-to-end delays of applications for maximizing the aggregate system utility subject to timing constraints. Many practical approaches suggest the use of intermediate deadline of tasks in order to control and upper-bound their end-to-end delays. This paper proposes a unified framework for different time-sensitive, global optimization problems, and solves them in a distributed manner using Lagrangian duality. The framework uses global viewpoints to assign intermediate deadlines, taking resource contention among tasks into consideration. For soft real-time tasks, the proposed framework effectively addresses the deadline assignment problem while maximizing the aggregate quality of service. For hard real-time tasks, we show that existing heuristic solutions to the deadline assignment problem can be incorporated into the proposed framework, enriching their mathematical interpretation.
Resumo:
Heterogeneous multicore platforms are becoming an interesting alternative for embedded computing systems with limited power supply as they can execute specific tasks in an efficient manner. Nonetheless, one of the main challenges of such platforms consists of optimising the energy consumption in the presence of temporal constraints. This paper addresses the problem of task-to-core allocation onto heterogeneous multicore platforms such that the overall energy consumption of the system is minimised. To this end, we propose a two-phase approach that considers both dynamic and leakage energy consumption: (i) the first phase allocates tasks to the cores such that the dynamic energy consumption is reduced; (ii) the second phase refines the allocation performed in the first phase in order to achieve better sleep states by trading off the dynamic energy consumption with the reduction in leakage energy consumption. This hybrid approach considers core frequency set-points, tasks energy consumption and sleep states of the cores to reduce the energy consumption of the system. Major value has been placed on a realistic power model which increases the practical relevance of the proposed approach. Finally, extensive simulations have been carried out to demonstrate the effectiveness of the proposed algorithm. In the best-case, savings up to 18% of energy are reached over the first fit algorithm, which has shown, in previous works, to perform better than other bin-packing heuristics for the target heterogeneous multicore platform.
Resumo:
A low-cost disposable was developed for rapid detection of the protein biomarker myoglobin (Myo) as a model analyte. A screen printed electrode was modified with a molecularly imprinted material grafted on a graphite support and incorporated in a matrix composed of poly(vinyl chloride) and the plasticizer o-nitrophenyloctyl ether. The protein-imprinted material (PIM) was produced by growing a reticulated polymer around a protein template. This is followed by radical polymerization of 4-styrenesulfonic acid, 2-aminoethyl methacrylate hydrochloride, and ethylene glycol dimethacrylate. The polymeric layer was then covalently bound to the graphitic support, and Myo was added during the imprinting stage to act as a template. Non-imprinted control materials (CM) were also prepared by omitting the Myo template. Morphological and structural analysis of PIM and CM by FTIR, Raman, and SEM/EDC microscopies confirmed the modification of the graphite support. The analytical performance of the SPE was assessed by square wave voltammetry. The average limit of detection is 0.79 μg of Myo per mL, and the slope is −0.193 ± 0.006 μA per decade. The SPE-CM cannot detect such low levels of Myo but gives a linear response at above 7.2 μg · mL−1, with a slope of −0.719 ± 0.02 μA per decade. Interference studies with hemoglobin, bovine serum albumin, creatinine, and sodium chloride demonstrated good selectivity for Myo. The method was successfully applied to the determination of Myo urine and is conceived to be a promising tool for screening Myo in point-of-care patients with ischemia.