907 resultados para NONTRANSFERRIN-BOUND IRON


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In embedded systems, the timing behaviour of the control mechanisms are sometimes of critical importance for the operational safety. These high criticality systems require strict compliance with the offline predicted task execution time. The execution of a task when subject to preemption may vary significantly in comparison to its non-preemptive execution. Hence, when preemptive scheduling is required to operate the workload, preemption delay estimation is of paramount importance. In this paper a preemption delay estimation method for floating non-preemptive scheduling policies is presented. This work builds on [1], extending the model and optimising it considerably. The preemption delay function is subject to a major tightness improvement, considering the WCET analysis context. Moreover more information is provided as well in the form of an extrinsic cache misses function, which enables the method to provide a solution in situations where the non-preemptive regions sizes are small. Finally experimental results from the implementation of the proposed solutions in Heptane are provided for real benchmarks which validate the significance of this work.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consider a distributed computer system comprising many computer nodes, each interconnected with a controller area network (CAN) bus. We prove that if priorities to message streams are assigned using rate-monotonic (RM) and if the requested capacity of the CAN bus does not exceed 25% then all deadlines are met.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Contention on the memory bus in COTS based multicore systems is becoming a major determining factor of the execution time of a task. Analyzing this extra execution time is non-trivial because (i) bus arbitration protocols in such systems are often undocumented and (ii) the times when the memory bus is requested to be used are not explicitly controlled by the operating system scheduler; they are instead a result of cache misses. We present a method for finding an upper bound on the extra execution time of a task due to contention on the memory bus in COTS based multicore systems. This method makes no assumptions on the bus arbitration protocol (other than assuming that it is work-conserving).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consider global fixed-priority preemptive multiprocessor scheduling of implicit-deadline sporadic tasks. I conjecture that the utilization bound of SM-US(√2−1) is √2-1.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Graphics processor units (GPUs) today can be used for computations that go beyond graphics and such use can attain a performance that is orders of magnitude greater than a normal processor. The software executing on a graphics processor is composed of a set of (often thousands of) threads which operate on different parts of the data and thereby jointly compute a result which is delivered to another thread executing on the main processor. Hence the response time of a thread executing on the main processor is dependent on the finishing time of the execution of threads executing on the GPU. Therefore, we present a simple method for calculating an upper bound on the finishing time of threads executing on a GPU, in particular NVIDIA Fermi. Developing such a method is nontrivial because threads executing on a GPU share hardware resources at very fine granularity.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consider the problem of scheduling a set of sporadically arriving implicit-deadline tasks to meet deadlines on a uniprocessor. Static-priority scheduling is considered using the slack-monotonic priority-assignment scheme. We prove that its utilization bound is 50%.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Dissertação apresentada para obtenção do Grau de Doutor em Bioquímica, ramo de Bioquímica-Física, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An experimental study to evaluate the power dissipation of gears was performed. Three low-loss gear models were manufactured using standard 20° pressure angle tools. Austempered ductile iron (ADI) and 20MnCr5 carburized steel gears were tested in an FZG gear test machine using mineral, ester and polyalphaolephine (PAO)-based oils. The results compare power dissipation, the influence of different tooth flank geometries, materials and lubricants. This work concludes that conventional power-transmission gears can be replaced by these improved and more efficient low–loss models, which can be produced using common tools and that steel gears can be successfully replaced by austempered ductile iron gears.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Low-loss power transmission gears operate at lower temperature than conventional ones because their teeth geometry is optimized to reduce friction. The main objective of this work is to compare the operating stabilization temperature and efficiency of low-loss austempered ductile iron (ADI) and carburized steel gears. Three different low-loss tooth geometries were adopted (types 311, 411 and 611, all produced using standard 20° pressure angle tools) and corresponding steel and ADI gears were tested in a FZG machine. The results obtained showed that low-loss geometries had a significant influence on power loss, gears 611 generating lower power loss than gears 311. At low speeds (500 and 1000 rpm) and high torque ADI gears generated lower power loss than steel gears. However, at high speed and high torque (high input power and high stabilization temperature) steel gears had better efficiency.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new family of "Fe-II(eta(5)-C5H5)" half sandwich compounds bearing a N-heteroaromatic ligand coordinated to the iron center by a nitrile functional group has been synthesized and fully characterized by NMR and UV-Vis spectroscopy. X-ray analysis of single crystal was achieved for complexes 1 and 3, which crystallized in the monoclinic P2(1)/c and monoclinic P2(1)/n space groups, respectively. Studies of interaction of these five new complexes with plasmid pBR322 DNA by atomic force microscopy showed very strong and different types of interaction. Antiproliferative tests were examined on human leukemia cancer cells (HL-60) using the MTT assay, and the IC50 values revealed excellent antiproliferative activity compared to cisplatin. (C) 2014 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Considering tobacco smoke as one of the most health-relevant indoor sources, the aim of this work was to further understand its negative impacts on human health. The specific objectives of this work were to evaluate the levels of particulate-bound PAHs in smoking and non-smoking homes and to assess the risks associated with inhalation exposure to these compounds. The developed work concerned the application of the toxicity equivalency factors approach (including the estimation of the lifetime lung cancer risks, WHO) and the methodology established by USEPA (considering three different age categories) to 18 PAHs detected in inhalable (PM10) and fine (PM2.5) particles at two homes. The total concentrations of 18 PAHs (ΣPAHs) was 17.1 and 16.6 ng m−3 in PM10 and PM2.5 at smoking home and 7.60 and 7.16 ng m−3 in PM10 and PM2.5 at non-smoking one. Compounds with five and six rings composed the majority of the particulate PAHs content (i.e., 73 and 78 % of ΣPAHs at the smoking and non-smoking home, respectively). Target carcinogenic risks exceeded USEPA health-based guideline at smoking home for 2 different age categories. Estimated values of lifetime lung cancer risks largely exceeded (68–200 times) the health-based guideline levels at both homes thus demonstrating that long-term exposure to PAHs at the respective levels would eventually cause risk of developing cancer. The high determined values of cancer risks in the absence of smoking were probably caused by contribution of PAHs from outdoor sources.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The iron(III) complexes [H(EtOH)][FeCl2(L)(2)] (1), [H(2)bipy](1/2)[FeCl2(L)(2)].DMF (2) and [FeCl2(L)(2,2'-bipy)] (3) (L = 3-amino-2-pyrazinecarboxylate; H(2)bipy = doubly protonated 4,4'-bipyridine; 2,2'-bipy = 2,2'-bipyridine, DMF = dimethylformamide) have been synthesized and fully characterized by IR, elemental and single-crystal X-ray diffraction analyses, as well as by electrochemical methods. Complexes 1 and 2 have similar mononuclear structures containing different guest molecules (protonated ethanol for 1 and doubly protonated 4,4'-bipyridine for 2) in their lattices, whereas the complex 3 has one 3-amino-2-pyrazinecarboxylate and a 2,2'-bipyridine ligand. They show a high catalytic activity for the low power (10 W) solvent-free microwave assisted peroxidative oxidation of 1-phenylethanol, leading, in the presence of TEMPO, to quantitative yields of acetophenone [TOFs up to 8.1 x 10(3) h(-1), (3)] after 1 h. Moreover, the catalysts are of easy recovery and reused, at least for four consecutive cycles, maintaining 83 % of the initial activity and concomitant rather high selectivity. 3-Amino-2-pyrazinecarboxylic acid is used to synthesize three new iron(III) complexes which act as heterogeneous catalysts for the solvent-free microwave-assisted peroxidative oxidation of 1-phenylethanol.