Real-time task scheduling with overheads considered

n periodic tasks are to be processed by a single machine, where each task i has a maximum request rate or periodicity F_i, a processing time E_i, a deadline D_i, relative to each request of task i, a task-request interrupt overhead I_i, and a task-independent scheduling overhead S. Two scheduling strategies are considered for sequencing the execution of an arbitrary arrangement of task requests in time: the preemptive and the nonpreemptive earliest-deadline algorithms. Necessary and sufficient conditions are derived for establishing whether a given set of tasks can be scheduled by each scheduling strategy. The conditions are given in the form of limited simulations of a small number of well-defined task-request arrangements. If all simulations succeed, the schedule is feasible for the given set of tasks. If any simulation fails, the schedule is infeasible. While interrupt handling and scheduling overheads can be handled by such simulations, context switching overhead resulting from preemption cannot. A counterexample illustrates how the simulations fail to uncover unschedulable task sets when context switching overhead is considered.     

旋转稳定塑料弹体工程设计计算研究

本文以实验结果为依据,首先分析了塑料弹体影响弹丸膛内运动的物理性能,然后结合旋转弹丸的膛内运动特征,经过模拟试验,采用数学拟合法,初步建立旋转稳定弹塑料弹体工程设计计算的数学模型(包括结构尺寸设计计算、强度计算和内弹道计算)。     

Properties of a source location estimator in the plane

The statistical properties of an estimator of a source location were established by simulation for the case in which the source location is estimated—using transformation of lines to points—from the angles in which different observers see the source, and both the assumed locations of the observer points and the observed angles are subject to error. It was found that for normal error distributions the estimator is unbiased, and the resulting estimates are approximately normally distributed with a small standard deviation. An easy-to-use and reliable forecasting formula was suggested to forecast the parameters of the distributions of the estimates for different observer-source relationships. © 1993 John Wiley & Sons, Inc.     

Age replacement policies in two time scales

We develop and estimate optimal age replacement policies for devices whose age is measured in two time scales. For example, the age of a jet engine can be measured in the number of flight hours and the number of landings. Under a single‐scale age replacement policy, a device is replaced at age τ or upon failure, whichever occurs first. We show that a natural generalization to two scales is to replace nonfailed devices when their usage path crosses the boundary of a two‐dimensional region M, where M is a lower set with respect to the matrix partial order. For lifetimes measured in two scales, we consider devices that age along linear usage paths. We generalize the single‐scale long‐run average cost, estimate optimal two‐scale policies, and give an example. We note that these policies are strongly consistent estimators of the true optimal policies under mild conditions, and study small‐sample behavior using simulation. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 592–613, 2003.     

Nonparametric estimation of some quantities of interest from renewal theory

In this paper, confidence intervals are given for two quantities of importance related to renewal processes. For each quantity, two confidence intervals are discussed. One confidence interval is given for general, all‐purpose use. Another confidence interval is given which is easier to compute, but not of general use. The case where data are subject to right censorship is also considered. Some numerical comparisons are made. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 638–649, 2003.     

Application of level crossing analysis to discrete state processes in queueing systems

In this paper we introduce a discrete state level crossing analysis and present some basic results and a key theorem of level crossings. We illustrate the fertility of the discrete state level crossing analysis by applying it to queueing systems with (i) bulk arrival, (ii) instantaneous feedback, (iii) limited waiting space, and (iv) to machine interference problems.     

Waiting time analysis of the M/G/1 queue with finite retrial group

We consider an M/G/1 retrial queue with finite capacity of the retrial group. First, we obtain equations governing the dynamic of the waiting time. Then, we focus on the numerical inversion of the density function and the computation of moments. These results are used to approximate the waiting time of the M/G/1 queue with infinite retrial group for which direct analysis seems intractable. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

On a Markov‐modulated shock and wear process

We present transient and asymptotic reliability indices for a single‐unit system that is subject to Markov‐modulated shocks and wear. The transient results are derived from the (transform) solution of an integro‐differential equation describing the joint distribution of the cumulative degradation process and the state of the modulating process. Additionally, we prove the asymptotic normality of a properly centered and time‐scaled version of the cumulative degradation at time t. This asymptotic result leads to a simple normal approximation for a properly centered and space‐scaled version of the systes lifetime distribution. Two numerical examples illustrate the quality of the normal approximation. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Landmarks in defense literature

The Profession of Arms: by General Sir John Hackett. Macmillan, New York, 1983. 239 pp.