1,696 research outputs found

    Exact Speedup Factors and Sub-Optimality for Non-Preemptive Scheduling

    Get PDF
    Fixed priority scheduling is used in many real-time systems; however, both preemptive and non-preemptive variants (FP-P and FP-NP) are known to be sub-optimal when compared to an optimal uniprocessor scheduling algorithm such as preemptive earliest deadline first (EDF-P). In this paper, we investigate the sub-optimality of fixed priority non-preemptive scheduling. Specifically, we derive the exact processor speed-up factor required to guarantee the feasibility under FP-NP (i.e. schedulability assuming an optimal priority assignment) of any task set that is feasible under EDF-P. As a consequence of this work, we also derive a lower bound on the sub-optimality of non-preemptive EDF (EDF-NP). As this lower bound matches a recently published upper bound for the same quantity, it closes the exact sub-optimality for EDF-NP. It is known that neither preemptive, nor non-preemptive fixed priority scheduling dominates the other, in other words, there are task sets that are feasible on a processor of unit speed under FP-P that are not feasible under FP-NP and vice-versa. Hence comparing these two algorithms, there are non-trivial speedup factors in both directions. We derive the exact speed-up factor required to guarantee the FP-NP feasibility of any FP-P feasible task set. Further, we derive the exact speed-up factor required to guarantee FP-P feasibility of any constrained-deadline FP-NP feasible task set

    Feedback-based admission control for hard real-time task allocation under dynamic workload on many-core systems

    Get PDF
    In hard real-time systems, a computationally expensive schedulability analysis has to be performed for every task. Fulfilling this requirement is particularly tough when system workload and service capacity are not available a priori and thus the analysis has to be conducted at runtime. This paper presents an approach for applying controltheory-based admission control to predict the task schedulability so that the exact schedulability analysis is performed only to the tasks with positive prediction results. In case of a careful fine-tuning of parameters, the proposed approach can be successfully applied even to many-core embedded systems with hard real-time constraints and other time-critical systems. The provided experimental results demonstrate that, on average, only 62% of the schedulability tests have to be performed in comparison with the traditional, open-loop approach. The proposed approach is particularly beneficial for heavier workloads, where the number of executed tasks is almost unchanged in comparison with the traditional open-loop approach. By our approach, only 32% of exact schedulability tests have to be conducted. Moreover, for the analysed industrial workloads with dependent jobs, the proposed technique admitted and executed 11% more tasks while not violating any timing constraints

    Identifying component modules

    Get PDF
    A computer-based system for modelling component dependencies and identifying component modules is presented. A variation of the Dependency Structure Matrix (DSM) representation was used to model component dependencies. The system utilises a two-stage approach towards facilitating the identification of a hierarchical modular structure. The first stage calculates a value for a clustering criterion that may be used to group component dependencies together. A Genetic Algorithm is described to optimise the order of the components within the DSM with the focus of minimising the value of the clustering criterion to identify the most significant component groupings (modules) within the product structure. The second stage utilises a 'Module Strength Indicator' (MSI) function to determine a value representative of the degree of modularity of the component groupings. The application of this function to the DSM produces a 'Module Structure Matrix' (MSM) depicting the relative modularity of available component groupings within it. The approach enabled the identification of hierarchical modularity in the product structure without the requirement for any additional domain specific knowledge within the system. The system supports design by providing mechanisms to explicitly represent and utilise component and dependency knowledge to facilitate the nontrivial task of determining near-optimal component modules and representing product modularity

    An extensible framework for multicore response time analysis

    Get PDF
    In this paper, we introduce a multicore response time analysis (MRTA) framework, which decouples response time analysis from a reliance on context independent WCET values. Instead, the analysis formulates response times directly from the demands placed on different hardware resources. The MRTA framework is extensible to different multicore architectures, with a variety of arbitration policies for the common interconnects, and different types and arrangements of local memory. We instantiate the framework for single level local data and instruction memories (cache or scratchpads), for a variety of memory bus arbitration policies, including: Round-Robin, FIFO, Fixed-Priority, Processor-Priority, and TDMA, and account for DRAM refreshes. The MRTA framework provides a general approach to timing verification for multicore systems that is parametric in the hardware configuration and so can be used at the architectural design stage to compare the guaranteed levels of real-time performance that can be obtained with different hardware configurations. We use the framework in this way to evaluate the performance of multicore systems with a variety of different architectural components and policies. These results are then used to compose a predictable architecture, which is compared against a reference architecture designed for good average-case behaviour. This comparison shows that the predictable architecture has substantially better guaranteed real-time performance, with the precision of the analysis verified using cycle-accurate simulation

    Domestic cats (Felis silvestris catus) do not show signs of secure attachment to their owners

    Get PDF
    The Ainsworth Strange Situation Test (SST) has been widely used to demonstrate that the bond between both children and dogs to their primary carer typically meets the requirements of a secure attachment (i.e. the carer being perceived as a focus of safety and security in otherwise threatening environments), and has been adapted for cats with a similar claim made. However methodological problems in this latter research make the claim that the cat-owner bond is typically a secure attachment, operationally definable by its behaviour in the SST, questionable. We therefore developed an adapted version of the SST with the necessary methodological controls which include a full counterbalance of the procedure. A cross-over design experiment with 20 cat-owner pairs (10 each undertaking one of the two versions of the SST first) and continuous focal sampling was used to record the duration of a range of behavioural states expressed by the cats that might be useful for assessing secure attachment. Since data were not normally distributed, non-parametric analyses were used on those behaviours shown to be reliable across the two versions of the test (which excluded much cat behaviour). Although cats vocalised more when the owner rather the stranger left the cat with the other individual, there was no other evidence consistent with the interpretation of the bond between a cat and its owner meeting the requirements of a secure attachment. These results are consistent with the view that adult cats are typically quite autonomous, even in their social relationships, and not necessarily dependent on others to provide a sense of security and safety. It is concluded that alternative methods need to be developed to characterise the normal psychological features of the cat-owner bond

    Planck intermediate results. XLI. A map of lensing-induced B-modes

    Get PDF
    The secondary cosmic microwave background (CMB) BB-modes stem from the post-decoupling distortion of the polarization EE-modes due to the gravitational lensing effect of large-scale structures. These lensing-induced BB-modes constitute both a valuable probe of the dark matter distribution and an important contaminant for the extraction of the primary CMB BB-modes from inflation. Planck provides accurate nearly all-sky measurements of both the polarization EE-modes and the integrated mass distribution via the reconstruction of the CMB lensing potential. By combining these two data products, we have produced an all-sky template map of the lensing-induced BB-modes using a real-space algorithm that minimizes the impact of sky masks. The cross-correlation of this template with an observed (primordial and secondary) BB-mode map can be used to measure the lensing BB-mode power spectrum at multipoles up to 20002000. In particular, when cross-correlating with the BB-mode contribution directly derived from the Planck polarization maps, we obtain lensing-induced BB-mode power spectrum measurement at a significance level of 12σ12\,\sigma, which agrees with the theoretical expectation derived from the Planck best-fit Λ\LambdaCDM model. This unique nearly all-sky secondary BB-mode template, which includes the lensing-induced information from intermediate to small (10100010\lesssim \ell\lesssim 1000) angular scales, is delivered as part of the Planck 2015 public data release. It will be particularly useful for experiments searching for primordial BB-modes, such as BICEP2/Keck Array or LiteBIRD, since it will enable an estimate to be made of the lensing-induced contribution to the measured total CMB BB-modes.Comment: 20 pages, 12 figures; Accepted for publication in A&A; The B-mode map is part of the PR2-2015 Cosmology Products; available as Lensing Products in the Planck Legacy Archive http://pla.esac.esa.int/pla/#cosmology; and described in the 'Explanatory Supplement' https://wiki.cosmos.esa.int/planckpla2015/index.php/Specially_processed_maps#2015_Lensing-induced_B-mode_ma

    Multi-criteria Resource Allocation in Modal Hard Real-Time Systems

    Get PDF
    In this paper, a novel resource allocation approach dedicated to hard real-time systems with distinctive operational modes is proposed. The aim of this approach is to reduce the energy dissipation of the computing cores by either powering them off or switching them into energy-saving states while still guaranteeing to meet all timing constraints. The approach is illustrated with two industrial applications, an engine control management and an engine control unit. Moreover, the amount of data to be migrated during the mode change is minimised. Since the number of processing cores and their energy dissipation are often negatively correlated with the amount of data to be migrated during the mode change, there is some trade-off between these values, which is also analysed in this paper

    The loop structure and the RNA helicase p72/DDX17 influence the processing efficiency of the mice miR-132

    Get PDF
    miRNAs are small RNAs that are key regulators of gene expression in eukaryotic organisms. The processing of miRNAs is regulated by structural characteristics of the RNA and is also tightly controlled by auxiliary protein factors. Among them, RNA binding proteins play crucial roles to facilitate or inhibit miRNA maturation and can be controlled in a cell, tissue and species-specific manners or in response to environmental stimuli. In this study we dissect the molecular mechanism that promotes the overexpression of miR-132 in mice over its related, co-transcribed and co-regulated miRNA, miR-212. We have shown that the loop structure of miR-132 is a key determinant for its efficient processing in cells. We have also identified a range of RNA binding proteins that recognize the loop of miR-132 and influence both miR-132 and miR-212 processing. The DEAD box helicase p72/DDX17 was identified as a factor that facilitates the specific processing of miR-132

    How environmental managers perceive and approach the issue of invasive species: the case of Japanese knotweed s.l. (Rhône River, France)

    Get PDF
    We would like to thank Springer for publishing our article. The final publication is available at http://link.springer.com/article/10.1007%2Fs10530-015-0969-1International audienceStudying the perceptions of stakeholders or interested parties is a good way to better understand behaviours and decisions. This is especially true for the management of invasive species such as Japanese knotweed s.l. This plant has spread widely in the Rhône basin, where significant financial resources have been devoted to its management. However, no control technique is recognized as being particularly effective. Many uncertainties remain and many documents have been produced by environmental managers to disseminate current knowledge about the plant and its management. This article aims at characterizing the perceptions that environmental managers have of Japanese knotweed s.l. A discourse analysis was conducted on the printed documentation produced about Japanese knotweed s.l. by environmental managers working along the Rhône River (France). The corpus was both qualitatively and quantitatively analysed. The results indicated a diversity of perceptions depending on the type of environmental managers involved, as well as the geographicalareas and scales on which they acted. Whereas some focused on general knowledge relating to the origins and strategies of colonization, others emphasized the diversity and efficacy of the prospective eradication techniques. There is a real interest in implementing targeted actions to meet local issues. To do so, however, these issues must be better defined. This is a challenging task, as it must involve all types of stakeholders
    corecore