936 resultados para Scheduler simulator
Resumo:
An experimental technique has been developed in order to mimic the effect of landmine loading on materials and structures to be studied in a laboratory setting, without the need for explosives. Compressed gas is discharged beneath a sand layer, simulating the dynamic flow generated by a buried explosive. High speed photography reveals that the stages of soil motion observed during a landmine blast are replicated. The effect of soil saturation and the depth of the sand layer on sand motion are evaluated. Two series of experiments have been performed with the buried charge simulator to characterise subsequent impact of the sand. First, the time variation in pressure and impulse during sand impact on a stationary target is evaluated using a Kolsky bar apparatus. It is found that the pressure pulse imparted to the Kolsky bar consists of two phases: an initial transient phase of high pressure (attributed to wave propagation effects in the impacting sand), followed by a lower pressure phase of longer duration (due to lateral flow of the sand against the Kolsky bar). Both phases make a significant contribution to the total imparted impulse. It is found that wet sand exerts higher peak pressures and imparts a larger total impulse than dry sand. The level of imparted impulse is determined as a function of sand depth, and of stand-off distance between the sand and the impacted end of the Kolsky bar. The second study uses a vertical impulse pendulum to measure the momentum imparted by sand impact to a target which is free to move vertically. The effect of target mass upon imparted momentum is investigated. It is concluded that the laboratory-scale sand impact apparatus is a flexible tool for investigating the interactions between structures and dynamic sand flows. © 2013 Elsevier Ltd. All rights reserved.
Resumo:
The paper is concerned with the identification of theoretical preview steering controllers using data obtained from five test subjects in a fixed-base driving simulator. An understanding of human steering control behaviour is relevant to the design of autonomous and semi-autonomous vehicle controls. The driving task involved steering a linear vehicle along a randomly curving path. The theoretical steering controllers identified from the data were based on optimal linear preview control. A direct-identification method was used, and the steering controllers were identified so that the predicted steering angle matched as closely as possible the measured steering angle of the test subjects. It was found that identification of the driver's time delay and noise is necessary to avoid bias in identification of the controller parameters. Most subjects' steering behaviour was predicted well by a theoretical controller based on the lateral/yaw dynamics of the vehicle. There was some evidence that an inexperienced driver's steering action was better represented by a controller based on a simpler model of the vehicle dynamics, perhaps reflecting incomplete learning by the driver. Copyright © 2014 Inderscience Enterprises Ltd.
Resumo:
United Nations University, Int. Inst. for Softw. Technol., China; Vietnam National University, Hanoi, Vietnam; Vietnam Academy of Science and Technology, Vietnam
Resumo:
This paper presents a new approach to window-constrained scheduling, suitable for multimedia and weakly-hard real-time systems. We originally developed an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), that attempts to guarantee no more than x out of y deadlines are missed for real-time jobs such as periodic CPU tasks, or delay-constrained packet streams. While DWCS is capable of generating a feasible window-constrained schedule that utilizes 100% of resources, it requires all jobs to have the same request periods (or intervals between successive service requests). We describe a new algorithm called Virtual Deadline Scheduling (VDS), that provides window-constrained service guarantees to jobs with potentially different request periods, while still maximizing resource utilization. VDS attempts to service m out of k job instances by their virtual deadlines, that may be some finite time after the corresponding real-time deadlines. Notwithstanding, VDS is capable of outperforming DWCS and similar algorithms, when servicing jobs with potentially different request periods. Additionally, VDS is able to limit the extent to which a fraction of all job instances are serviced late. Results from simulations show that VDS can provide better window-constrained service guarantees than other related algorithms, while still having as good or better delay bounds for all scheduled jobs. Finally, an implementation of VDS in the Linux kernel compares favorably against DWCS for a range of scheduling loads.
Resumo:
info:eu-repo/semantics/published
Resumo:
The FIRE Detection and Suppression Simulation (FIREDASS) project was concerned with the development of water misting systems as a possible replacement for halon based fire suppression systems currently used in aircraft cargo holds and ship engine rooms. As part of this program of work, a computational model was developed to assist engineers optimize the design of water mist suppression systems. The model is based on Computational Fluid Dynamics (CFD) and comprised of the following components: fire model; mist model; two-phase radiation model; suppression model; detector/activation model. In this paper the FIREDASS software package is described and the theory behind the fire and radiation sub-models is detailed. The fire model uses prescribed release rates for heat and gaseous combustion products to represent the fire load. Typical release rates have been determined through experimentation. The radiation model is a six-flux model coupled to the gas (and mist) phase. As part of the FIREDASS project, a detailed series of fire experiments were conducted in order to validate the fire model. Model predictions are compared with data from these experiments and good agreement is found.
Resumo:
A novel tag computation circuit for a credit based Self-Clocked Fair Queuing (SCFQ) Scheduler is presented. The scheduler combines Weighted Fair Queuing (WFQ) with a credit based bandwidth reallocation scheme. The proposed architecture is able to reallocate bandwidth on the fly if particular links suffer from channel quality degradation .The hardware architecture is parallel and pipelined enabling an aggregated throughput rate of 180 million tag computations per second. The throughput performance is ideal for Broadband Wireless Access applications, allowing room for relatively complex computations in QoS aware adaptive scheduling. The high-level system break-down is described and synthesis results for Altera Stratix II FPGA technology are presented.