一种有效的网络多出口流量调度方案

针对基于Linux的多出口流量调度与负载不均衡问题,利用历史流量率和历史调度权值,提出一种自动按网络流量状态调整最优出口比例的自适应流量调度方案,给出方案的双出口校园网络完整配置过程和关键调度算法实现。仿真实验表明,该方案可有效调度网络多个出口的流量,保证网络多出口负载均衡。     

Linux内核进程调度与控制的实现

首先分析了Linux系统的整体结构,阐明了进程调度与内存管理系统、文件系统和网络接口之间的关系,最后给出了Linux进程调度的原理、策略及其实现方法.     

基于CFS组调度的CPU资源动态分配方法

进程调度作为Linux操作系统的核心,使系统其他部分联合成一个整体,在资源分配与系统推进方面发挥着至关重要的作用。对CFS(completely fair scheduler)调度的算法及其过程进行研究,并结合组调度思想提出一种动态分配的CFS组调度策略。该调度算法以组负载作为CPU资源分配的主要标准,同时兼顾组间的公平性。根据这一原则,在原Linux内核基础上进行修改,实现了该过程。测试结果表明,该调度方式有效地处理了组在不同负载下,CPU资源的分配问题,扩展了组调度的实用性。     

基于Linux的进程主/从调度实现

提出一种主从调度模型在Linux下的实现方法。在该模型中，系统中的每一个进程由某一个指定的CPU来运行，从而减少了进程切换的次数。在内核中，每一个CPU单独拥有一个可运行队列，各个CPU各自进行调度，使得内核调度线程能够同时在多个CPU上运行，多个CPU充分并行，从而提高系统性能。     

通用调度框架的改进及其在Linux中的实现

在嵌入式Linux实时系统中,要求内核对不同时问约束的任务采用不同的调度算法.但目前Linux内核采用单一的实时调度模式,不能灵活地执行多种调度算法,也就无法满足实时系统中实时任务的时间约束.引入了一种能够在Linux内核调度中执行多种调度算法的框架,即通用调度框架(GSF),并改进了其中的多算法调用机制,从而更好地在Linux内核中实现GSF.     

Linux流量控制管理架构

为了将流量合理地在各处理节点进行调度,优化网络资源的使用,解决网络资源使用的不平衡,分析了Linux核心体系结构、数据传递机制和数据转发过程．介绍了流量分类、队列管理和流量过滤等技术,得到了Linux下流量控制管理架构。通过实验结果证明．基于Linux能有效地进行流量拥塞控制,具有较好的流量管理效果。     

云计算资源调度研究综述

资源调度是云计算的一个主要研究方向.首先对云计算资源调度的相关研究现状进行深入调查和分析;然后重点讨论以降低云计算数据中心能耗为目标的资源调度方法、以提高系统资源利用率为目标的资源管理方法、基于经济学的云资源管理模型,给出最小能耗的云计算资源调度模型和最小服务器数量的云计算资源调度模型,并深入分析和比较现有的云资源调度方法;最后指出云计算资源管理的未来重要研究方向:基于预测的资源调度、能耗与性能折衷的调度、面向不同应用负载的资源管理策略与机制、面向计算能力(CPU、内存)和网络带宽的综合资源分配、多目标优化的资源调度,以便为云计算研究提供有益的参考.     

基于流的MAWRED Linux流量控制算法改进

Linux在其内核中嵌入了的流量控制机制,但其在流量控制的队列调度算法方面仍然有所欠缺。本文在分析了Linux系统流量控制的内核实现基础上,提出了一种新的队列调度算法-基于流的MAWRED算法,并给出了其具体实现。     

Linux流量控制分析及其算法改进

Linux在其内核中嵌入了的流量控制机制,但其在流量控制的队列调度算法方面仍然有所欠缺。本文在分析了Linux系统流量控制的内核实现基础上,提出了一种新的队列调度算法-基于流的MAWRED算法,并给出了其具体实现。     

基于CPU因子影响的二次调度算法

在航天器型号设计阶段需要利用高性能计算系统开展大量的仿真分析工作,昂贵的许可证资源使用极其紧张,作业计算效率低.针对高性能计算系统中现有作业派发机制未动态考虑高性能运算主机空闲状态的缺陷和不足开展研究,基于资源调度软件Platform LSF,结合航天器仿真分析特点,提出一种新的思路,设计并实现一种新的基于CPU因子（CPU Factor）影响的二次调度算法,CPU因子用于区分不同机器的相对运行速度,仿真结果表明算法能够有效提升作业计算效率,缩短许可证资源占用时间.实际案例说明算法具备推广应用的可能,一定程度的提高了许可证资源利用率,满足了航天器仿真分析过程中对于成本控制和资源精益化利用的实际需求.     

Implementation and experimental performance evaluation of a hybrid interrupt-handling scheme

The performance of network hosts can be severely degraded when subjected to heavy traffic of today’s Gigabit networks. This degradation occurs as a result of the interrupt overhead associated with the high rate of packet arrivals. NAPI, a packet reception mechanism integrated into the latest version of Linux networking subsystem, was designed to improve Linux performance to suit today’s Gigabit traffic. NAPI is definitely a major step up from earlier reception mechanisms; however, NAPI has shortcomings and its performance can be further enhanced. A hybrid interrupt-handling scheme, which was recently proposed in Salah et al. [K. Salah, K. El-Badawi, F. Haidari, Performance Analysis and Comparison of Interrupt-Handling Schemes in Gigabit Networks, International Journal of Computer Communications, Elsevier, Amsterdam 30 (17) (2007) 3425–3441], can better improve the performance of Gigabit network hosts. The hybrid scheme switches between interrupt disabling–enabling (DE) and polling (NAPI). In this paper, we present and discuss major changes required to implement such a hybrid scheme in the latest version of Linux kernel 2.6.15. We prove experimentally that the hybrid scheme can significantly improve the performance of general-purpose network desktops or servers running network I/O-bound applications, when subjecting such network hosts to both light and heavy traffic load conditions. The performance is measured and analyzed in terms of throughput, packet loss, latency, and CPU availability.     

TDCS: a new scheduling framework for real-time multimedia OS

ABSTRACT

The emerging real-time hyper-physical system (CPS), such as autonomous vehicle and live interactive media application, requires time deterministic behaviour. This is challenging to achieve by using the traditional general purpose operating system (GPOS). This paper presents a new design of the real-time operating system (OS) scheduling mechanism called ‘time deterministic cyclic scheduling’ (TDCS) mainly for live multimedia tasks processing. This new scheduler shares a similar philosophy as classic cyclic execution but with flexibility and dynamic configuration. This hybrid design is based on both time-reserved based cyclic execution and priority-based pre-emptive scheduling for mixed criticality applications. The simulation results show that this scheduling scheme can achieve predictable timing behaviour of task delay and jitter under high CPU utilisation. This shows that the proposed scheme is promising for low latency high-performance multimedia censoring tasks that occur in a periodic manner.     

Flow scheduling and endpoint rate control in GridNetworks

In grid networks, distributed resources, computing or storage elements as well as scientific instruments are interconnected to support computing-intensive and data-intensive applications. To facilitate the efficient scheduling of these resources, we propose to manage the movements of massive data set between them. This paper formulates the bulk data transfer scheduling problem and presents an optimal solution to minimize the network congestion factor of a dedicated network or an isolated traffic class. The solution satisfying individual flows’ time and volume constraints can be found in polynomial time and expressed as a set of multi-interval bandwidth allocation profiles. To ensure a large-scale deployment of this approach, we propose, for the data plane, a combination of a bandwidth profile enforcement mechanism with traditional transport protocols. The paper examines several solutions for implementing such a mechanism in a Linux kernel. The experimental evaluation shows that packet pacing performed at IP level offers a simple yet valuable and TCP-compatible solution for accurate bandwidth profile enforcement at very high speed.     

嵌入式Linux中调度算法的实现及优化

本文论述实时嵌入式Linux的多任务调度算法实现机制。结合嵌入式操作系统的特点，重点介绍基于优先级驱动嵌入式系统的一种实时调度优化算法的实现机制，讨论如何在GPL下充分利用现有的实时调度算法开发适合嵌入式Linux的优化调度方法，并提出了具体的实现思路。     

图书馆多媒体业务流的短时公平分组反馈调度方法

研究了一种新的基于短时公平的分组调度算法的问题. 基于短时公平性的分组反馈调度算法改进了WF2Q＋算法在短期内无法为新加入客户端提供公平服务的缺陷,增强了调度算法的适应性和公平性. 在本算法中,调度器中的各个客户端权值能够根据其获得的实际服务量状况在线调整,增强了系统的鲁棒性和自适应性,同时提高了系统实现短期公平性的能力,对各个客户端提供更为公平的服务质量（Quality of Service,QoS）.     

基于特征尺度均衡的Linux系统双阈值任务调度算法

在嵌入式Linux操作系统的设计和应用中,操作系统经过移植后运行在不同的硬件平台上,它需要一种有效的任务调度算法来实现进程管理和内存管理,以提高系统运行效率.提出了一种基于特征尺度均衡的Linux系统双阈值任务调度算法,分析了嵌入式Linux的内核结构,构建了系统任务调度模型.该算法对以往各类型任务的到达频率、执行时间等信息流进行统计,并提取特征尺度,在Linux系统的全局任务调度中心将所有任务进行融合,输入系统总调度器,得到尺度优化目标函数,进行特征尺度均衡处理;把均衡后的特征尺度时间轴划分成各个相邻但不重合的任务匹配平滑窗口,通过双阈值权衡判决实现对Linux系统的任务调度.仿真结果表明,采用该算法进行Linux嵌入式任务调度,具有较高的执行效率,CPU利用率高,整体性能优于传统算法.     

Fuzzy-Based Dynamic Distributed Queue Scheduling for Packet Switched Networks

Addressing the problem of queue scheduling for the packet-switched system is a vital aspect of congestion control. In this paper, the fuzzy logic based decision method is adopted for queue scheduling in order to enforce some level of control for traffic of different quality of service requirements using predetermined values. The fuzzy scheduler proposed in this paper takes into account the dynamic nature of the Internet traffic with respect to its time-varying packet arrival process that affects the network states and performance. Three queues are defined, viz low, medium and high priority queues. The choice of prioritizing packets influences how queues are served. The fuzzy scheduler not only utilizes queue priority in the queue scheduling scheme, but also considers packet drop susceptibility and queue limit. Through simulation it is shown that the fuzzy scheduler is more appropriate for the dynamic nature of Internet traffic in a packet-switched system as compared with some existing queue scheduling methods. Results show that the scheduling strategy of the proposed fuzzy scheduler reduces packet drop, provides good link utilization and minimizes queue delay as compared with the priority queuing (PQ), first-in-first-out (FIFO), and weighted fair queuing (WFQ).     

Linux实时调度方案的设计与实现

作为一个分时系统，Linux的设计目标为提高吞吐率和平均响应时间，因此采取了基于时间片的调度策略，显然这种机制无法保证实时任务得到及时响应和调度．为了改进Linux操作系统的实时性能，探讨了基于Linux的实时操作系统RFRTOS中的实时调度机制．实验验证，所做改进有效地提高了Linux的调度精度，满足了软实时方面的需求．     

基于CPU MEM的负载共享调度机制研究*

分布式系统中调度机制对负载共享系统性能有重要影响。基于CPU-MEM的负载共享策略考虑内存资源对系统性能的作用,降低了页失效次数,提高了资源利用率。在CPU-MEM负载共享机制基础上,考虑任务在执行过程中的变化特性,提出了在单节点上减少任务平均内存需求的多内存需求多时间片轮询策略(RR-MMMCS)和基于预测的多内存多时间片策略(MMMCS-P)。实验表明,无论是对计算密集型任务还是数据密集型任务,RR-MMMCS、MMMCS-P调度机制在平均响应时间方面具有较好的性能。     

基于Linux集群的分布式实时操作系统的设计

文章针对Linux集群环境,以Linux通用操作系统为基础,提出了一种分布式实时操作系统的设计思路。以分布式实时操作系统的特殊性为线索,详细阐述了分布式实时操作系统中实时任务调度机制、实时进程间通信机制和实时网络通信机制的设计思路。