Schedulability issues for EDZL scheduling on real-time multiprocessor systems

EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3m/4=0.75m for m processors. In this paper, we disprove this conjecture and show that the utilization bound of EDZL is no greater than m(1−1/e)≈0.6321m, where e≈2.718 is the Euler's number.     

我国掺稀土光纤的现状分析

掺稀土光纤作为激光增益介质在光纤通信、光纤激光器和传感器等领域有着广泛的应用,国内掺铒光纤、掺镱光纤的市场曾长期被Corning、Lucent等国外光纤制造厂商所垄断,近年来我国掺铒光纤、掺镱光纤的研究取得了很大进展,已部分替代国外进口.文章主要介绍国内掺铒光纤、掺镱光纤的研究现状和发展趋势.     

新颖的双级双程输出C L波段高功率宽带光源

在分析了采用掺铒光纤(EDF)产生C波段和L波段光的基础上,进一步分析了双级双程结构实现C L波段宽带光源(BBS)的基本原理,优化设计后并通过实验用双级双程结构实现了高功率C L波段宽带放大的自发辐射(ASE)同时输出。其中,第1级采用双程前向可实现功率为19．2mW(12．93dBm),平均波长为1552．823nm的C L(1520～1610nm之间)ASE输出;第1级采用双程后向可实现功率为21．13mW(13．25dBm),平均波长为1552．925nm的C L(1524～1610nm之间)ASE输出,两级所用的光纤长度分别为7m(低浓度)和31m(高浓度)。对比分析两种结构输出光谱的抽运光利用效率、光滑平坦特性后,可得出第1级采用双程后向的双级双程是一种更为理想的实现C L波段高功率ASE输出的结构。     

基于光纤环形镜的双级双程L波段高功率ASE光源

研究了L波段光产生的基本机理,基于3dB宽带耦合器的光纤环形镜作为反射镜,优化设计并通过实验得到了双级双程L波段掺Er光纤(EDF)高功率放大的自发辐射(ASE)输出光谱。两级所用的光纤长度分别为7m(低浓度)和31m(高浓度),在同等条件下,第1级采用双程前向得到功率为21．48mW(13．32dBm)、平均波长为1573．52nm的L波段ASE输出;第1级采用双程后向可实现功率为22．71mW(13．56dBm)、平均波长为1574．66nm的L波段ASE输出。对比分析2种结构输出光谱的抽运光利用效率、光谱平坦度等特性后,得到第1级采用双程后向的双级双程是一种更为理想的实现L波段高功率ASE输出的结构,同时由于C波段易获得高功率(高于30mW)的输出,二者结合即可得到功率高于50mW的C L波段ASE输出。     

双程后向结构掺铒光纤超荧光光源研究

通过编制1套图形界面的模拟分析软件,对双程后向结构掺铒光纤超荧光光源有关输出功率、带宽和平均波长特性进行了理论模拟。结果表明,通过选取适当的掺铒光纤长度,总能实现光源的平均波长不依赖于泵浦功率的高稳定性。并报道了研制的双程后向结构掺铒光纤超荧光光源。     

Smooth Scheduling under Variable Rates or the Analog-Digital Confinement Game

This work considers non-terminating scheduling problems in which a system of multiple resources serves clients having variable needs. The system has m identical resources and n clients; in each time slot each resource may serve at most one client; in each such slot t each client γ has a rate, a real number ρ _γ (t), that specifies his needs in this slot. The rates satisfy the restriction ∑ _γ ρ _γ (t)≤m for any slot t. Except of this restriction, the rates can vary in arbitrary fashion. (This contrasts most prior works in this area in which the rates of the clients are constant.) The schedule is required to be smooth as follows: a schedule is Δ -smooth if for all time intervals I the absolute difference between the amount of service received by each client γ to his nominal needs of ∑ _t∈I ρ _γ (t) is less than Δ. Our objective are online schedulers that produce Δ-smooth schedules where Δ is a small constant which is independent of m and n. Our paper constructs such schedulers; these are the first online Δ-smooth schedulers, with a constant Δ, for clients with arbitrarily variable rates in a single or multiple resource system. Furthermore, the paper also considers a non-concurrent environment in which there is an additional restriction that each client is served at most once in each time slot; it presents the first online smooth schedulers for variable rates under this restriction. The above non-concurrent restriction is crucial in some applications (e.g., CPU scheduling). It has been pointed out that this restriction “adds a surprising amount of difficulty” to the scheduling problem. However, this observation was never formalized and, of course, was never proved. Our paper formalizes and proves some aspects of this observation. Another contribution of this paper is the introduction of a complete information, two player game called the analog-digital confinement game. In such a game pebbles are located on the real line; the two players, the analog player and the digital player, take alternating turns and each one, in his turn, moves some of the pebbles; the digital player moves the pebbles backwards by discrete distances while the analog player moves the pebbles forward by analog distances; the aim of the analog player is to cause one pebble (or more) to escape a pre-defined real interval while the aim of the digital player is to confine the pebbles into the interval. We demonstrate that this game is a convenient framework to study the general question of how to approximate an analog process by a digital one. All the above scheduling results are established via this game. In this derivation, the pebbles represent the clients, the analog player generates the needs of the clients and the digital player generates the schedule. Dedicated to the memory of Professor Shimon Even for his inspiration and encouragement     

EDF调度算法在COTS交换式工业以太网上的实现

将交换式以太网引入工业实时通信领域正受到越来越多的关注,但是,基于成熟商用组件技术（COTS）的交换式以太网在实时性方面的缺陷限制了其在工业实时通信领域中应用。基于FTT模型（Flexible Time—Triggered communication paradigm）,在无须对现有交换以太网做任何硬件改动的前提下,实现了交换式以太网上周期性实时消息与其它消息在时间上严格隔离,并针对周期性实时消息传输提出了一种基于EDF的实时性调度算法,仿真实验表明该算法具有明显的优点。     

EDF统一调度硬实时周期任务和偶发任务的可调度性判定算法

现有的硬实时周期任务和非周期任务的混合调度方法都没有保证非周期任务的实时性,所以不适合调度具有强实时要求的偶发任务.通过分析和计算EDF算法调度偶发任务所占用的空闲时间和挪用时间,以及调度后对空闲时间和最大可挪用时间的影响,提出一种采用EDF算法统一调度硬实时周期任务和偶发任务时的可调度性充分判定算法.最后用仿真实验得出了该算法在不同系统负载下的判定准确率和偶发任务的平均响应时间.