分布式多媒体系统资源管理的研究

分布式多媒体系统中,资源管理包括多媒体呼叫建立期间服务质量（ＱｏＳ）协商、ＱｏＳ确认过程中的资源分配,以及多媒体传输期间资源监视、ＱｏＳ重协商过程中的资源调整等内容。文章概述了资源管理研究的关键技术,包括系统层次模型、资源管理模型和任务调度算法。     

具有优先级特征的多媒体流的资源管理

本文研究了具有优先级特征的分布式多媒体流的资源管理，提出了一种基于节优先级的资源管理的设计方法，包括资源管理机制，资源管理策略，服务质量（ＱｏＳ）协商调整算法和高优先级节枪占算法，它能够保证稳定的具估优先级特征的多媒体流，能够极大地调度并发的多媒体流，特别是在系统资源不足时，能够最大限度地调度高优先级的多媒体流，并能保证各多媒体流量了的ＱｏＳ。     

分布式多媒体系统中的一种QoS管理模型

分布式多媒体系统需要强有力的服务质量ＱｏＳ管理机制。本文从分析现有网络系统在ＱｏＳ管理方面的不足出发，结合分布式多媒体系统的特点，归纳出有关分布式多媒体系统ＱｏＳ管理的基本观点及应该具备的基本功能；然后，提出一种ＱｏＳ管理模型，给出该模型的逻辑结构和工作过程。     

基于QoS的分布式多媒体资源管理的系统结构

本文研究了ＱｏＳ的层次表达和多媒体资源管理的内容，讨论了ＱｏＳ层次结构与ＯＳＩ网络参考模型以及操作系统的对照关系，提出了一种可行的资源管理的逻辑结构。它可被用于实现ＶＯＤ和视频会议系统。     

可视电话系统的QoS管理

ＱｏＳ管理近年来引起了人们的关注,尤其是分布式多媒体系统中ＱｏＳ管理更是一研究热点,本文则独辟蹊径,探讨点到点可视电话系统中的端到端的ＱｏＳ管理,以填补当前研究中的一个空白,本文给出了可视电话系统中的ＱｏＳ参考模型,管理策略以及可视电话系统的结构。     

一个基于对象的分布式多媒体系统模型

提出了一个基于对象的分布式多媒体系统模型。由媒体存取层、多媒体对象层和多媒体表现层等构成的层次模型将媒体异构环境存取、分布式多媒体对象处理和语义合成表现等问题在不同层次分别进行处理,并能够全面处理多种时序关系以及ＱｏＳ（ｑｕａｌｉｔｙ ｏｆ ｓｅｒｖｉｃｅ）等特殊问题。     

由VTRR算法为DiffServ提供QoS的一种方法

ＤｉｆｆＳｅｒｖ是解决宽带Ｉｎｔｅｒｎｅｔ ＱｏＳ控制的一种可行方案，它在边界节点将不同的ＱｏＳ要求映射成ＰＨＢ。对每类具有相同ＰＨＢ的ＩＰ业务流，应用ＶＴＲＲ公平调度算法。ＶＴＲＲ算法允许在竞争带宽的业务流中公平共享分配的带宽。将ＶＴＲＲ与ＲＳＶＰ结合使用，能为ＤｉｆｆＳｅｒｖ提供ＱｏＳ保证。     

建立分布式多媒体系统的体系结构参考模型

分布式多媒体系统具有广阔的应用前景。但由于缺乏一致的体系结构，其研究和开发均受到了很大的限制。本文首先给出分布式多媒体系统的资源配置模型和一般功能需求，引入虚拟设备、虚拟连接、ＱｏＳ等概念，最后描述了我们所使用的分布式多媒体系统体系结构参考模型。该模型对理解分布式多媒体系统的特点和工作原理亦有相当帮助。     

关于服务质量(QoS)保证的管理机制的研究

分布式多媒体应用越来越深入到人们的工作、学习和生活的各个方面,而推广分布式多媒体应用需要解决的一个关键问题是提供服务质量（ＱｏＳ）保证。该文首先给出了提供ＱｏＳ保证的管理需完成的三个基本过程：连接建立、传输过程和连接断开;然后详细描述了这三个基本过程应该完成的任务;最后,给出了结论。     

基于QoS控制的连续媒体服务任务调度

连续媒体服务如视频,音频等是一类新的实时应用,要求在一统一的操作系统框架内支持强,弱实时应用,而传统的操作系统中的调度策略不能很好的支持该类应用。文中提出了一种新的ＱｏＳ描述方法,并在此基础上提出支持连续媒体流的,基于ＱｏＳ的启发式任务调度算法。该算法考虑了多媒体任务的成功率和连续失败数在资源有限的前提下,尽量保证所有媒体流的服务质量。     

分时EDF算法及其在多媒体操作系统中的应用

提出了一种新的CPU调度算法－－分时EDF（Earliest Deadine First)算法,该算法能保证硬实时任务不丢失死线,并易于在分时系统中实现。以分时EDF算法为基础,提出一种新的CPU层次调度算法－－HRFSFQ,该算法用于多媒体操作系统时能保证各类任务的QoS。最后通过大量实验证明了上述算法的有效性和正确性。     

On the convergence of the holistic analysis for EDF distributed systems

Dynamic scheduling techniques, and EDF (Earliest Deadline First) in particular, have demonstrated their ability to increase the schedulability of real time systems compared to fixed-priority scheduling. In distributed systems, the scheduling policies of the processing nodes tend to be the same as in stand-alone systems and, although few EDF networks exist, it is foreseen that dynamic scheduling will gradually develop into real-time networks. There are some response time analysis techniques for EDF scheduled distributed systems, mostly derived from the holistic analysis developed by Spuri. A major factor influencing the response time is the release jitter of each task, which is the maximum variation suffered by the release time of the task jobs. The convergence of the holistic analysis in the context of EDF distributed systems with shared resources had not been studied until now. There is a circular dependency between the task release jitter values, response times and the preemption level ceilings of shared resources. In this paper we present an extension of Spuri’s algorithm and we demonstrate that its iterative formulas are non-decreasing, even in the presence of shared resources. This result enables us to assert that the new algorithm converges towards a solution for the response times of the tasks and messages in a distributed system.¹     

现场级硬实时网络在线调度

通过对主要周期和非周期硬实时调度算法的深入研究，提出了一种可用于调度链路数据包的在线硬实时调度系统(ARTCS)。该调度器基于单调比率调度算法：RM、风车调度算法Sr和轮询服务器调度算法，能快速判定可调度性，进而自动生成总线表，使调度算法将数据包作为周期数据包进行调度。ARTCS简单、易用，有效地利用了总线带宽。顺序执行总线表，不仅能保证硬实时的性能，而且避免了消息传输中的中断和阻塞，因而较好地满足了现场总线领域中硬实时通信系统的要求。     

基于RM与EDF的实时混合调度算法研究

通过对实时系统中静态调度算法RM和动态调度算法EDF的研究与分析,针对两种调度算法在实际应用中的问题,提出了一种基于阈值δ的混合调度算法,将RM与EDF调度算法相结合,并从数学角度描述了混合调度算法的可调度性与实时任务的周期、执行时间等属性之间的关系,给出了混合调度算法可调度性的充分必要条件。最后用实验验证了混合调度算法的有效性。     

IEEE 802.16中支持QoS的有效带宽分配机制

基于IEEE 802.16协议,研究宽带无线接入网中保障QoS的有效带宽资源分配和调度问题。首先,在PMP模式下设计一个有效率的QoS调度算法,利用参数的调整提供更具有弹性的服务质量,以利于rtPS服务支持多媒体传输;然后利用标准中所提供的QoS参数调度各种不同类型的服务业务,分配上传带宽,进而达到有效地使用网络资源。仿真实验结果表明,本方案能够在保证QoS需求的同时,有效地分配带宽资源。     

分布式多媒体任务风车调度延迟问题的研究

作者于1999年提出一种分布式多媒体任务的风车调度算法DMSr,它在分布式系统各节点上通过逐步消除候选项,计算出各任务的调度周期,使多媒体无抖动地传输。在此基础上,作者继续研究了DMSr风车调度延迟最小化问题。文章定义了延迟时间和调度启动滞后时间概念,分析了调度启动滞动时间、调度周期和延迟时间之间的关系,证明了DMSr调度传输延迟时间是启动滞后时间的周期性函数,延迟时间被描述为一组具有固定斜率的锯齿线段,并提出了一种启动滞后时间的计算算法MinSum,它能使任务总延迟最小化。     

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

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

Scheduling and admission testing for jitter-constrained periodic threads

We present new admission tests for periodic real-time threads with explicitly stated deadlines scheduled according to the earliest deadline first (EDF) algorithm. In traditional real-time periodic scheduling, the deadline of a periodic thread is conventionally the end of the current period. In contrast, our tests support periodic threads in which the deadline may be earlier than the end of the current period. In the extreme case, the deadline may be specified as identical to the per period execution time, which results in perfectly isochronous periodic threads. The provision of such threads, which we refer to as jitter-constrained threads, helps end-systems to honour jitter as well as throughput-related QoS parameters in distributed multimedia systems. In addition, such threads can reduce end-to-end delay and buffer memory requirements as less buffering is needed to smooth excessive delay jitter.     

Energy-efficient scheduling of real-time tasks with shared resources

This paper explores the energy-efficient scheduling of real-time tasks on a non-ideal DVS processor in the presence of resource sharing. We assume that tasks are periodic, preemptive and may access to shared resources. When dynamic-priority and fixed-priority scheduling are considered, we use the earliest deadline first (EDF) algorithm and the rate monotonic (RM) algorithm to schedule the given set of tasks. Based on the stack resource policy (SRP), we propose an approach, called blocking-aware two-speed (BATS) algorithm, to synchronize the tasks with shared resources and to calculate appropriate execution speeds so that the shared resources can be accessed in a mutual exclusive manner and the energy consumption can be reduced. Particularly, BATS uses a static low speed to execute tasks initially, and then it switches to a high speed dynamically whenever a task blocks a higher priority task. More specifically, the processor runs at the high speed from the beginning of the blocking until the deadline of the blocked task or the processor becomes idle. In order to guarantee that the deadlines of tasks are met, the static low speed and the dynamic high speeds are derived based on the theoretical analysis of the schedulability of tasks. Compared with existing work, BATS achieves more energy saving because its dynamic high speeds are lower than that of existing work and the processor has less chance to execute tasks at the high speeds. The schedulability analysis and the properties of our proposed BATS are provided in this paper. We also evaluated the capabilities of BATS by a series of experiments, for which we have some encouraging results.     

Rate Monotonic vs. EDF: Judgment Day

Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedulability analysis of periodic task sets. Unfortunately, many misconceptions still exist about the properties of these two scheduling methods, which usually tend to favor RM more than EDF. Typical wrong statements often heard in technical conferences and even in research papers claim that RM is easier to analyze than EDF, it introduces less runtime overhead, it is more predictable in overload conditions, and causes less jitter in task execution.Since the above statements are either wrong, or not precise, it is time to clarify these issues in a systematic fashion, because the use of EDF allows a better exploitation of the available resources and significantly improves system's performance.This paper compares RM against EDF under several aspects, using existing theoretical results, specific simulation experiments, or simple counterexamples to show that many common beliefs are either false or only restricted to specific situations.