Scheduling algorithm for stochastic job stream cipher service based on load balancing

Business stream parallel processing system face the situation of the diversity of cipher service requests,the cross of serial mode and parallel mode,the intercross of different business data flow,and the demand of high speed and high reliability in security field.In order to improve the parallel processing efficiency of multi-cryptographic algorithm,load balancing was used as scheduling objective.Based on hierarchical hardware scheduling method (HHS-ACDID),considering the processing node’s storage capacity and processing speed,a load balancing scheduling algorithm was approved to support non related tasks and related tasks at the same time,which achieves the high speed cipher processing throughput.Simulation results show that the algorithm can complete dynamic scheduling of data stream system and get better load balancing effect.Compared with HHS-ACDID,the efficiency of the algorithm is improved by about 12%.     

一种基于模块的调度策略

Cache的缺失严重影响着计算机系统的运行效率.现代构件化软件架构中模块化程度越来越高,操作系统中传统的调度策略忽视任务的模块特性,若模块具有特定的代码/数据访问集合,模块间不合理的任务调度会导致严重的Cache缺失.本文提出了一种基于模块的调度策略MBS,可以尽量连续调度同一模块中的任务,尤其适应于构件化的服务系统.分析与实验结果表明,MBS可以有效减少此类系统的Cache缺失,明显提高系统性能.     

Low area field-programmable gate array implementation of PRESENT image encryption with key rotation and substitution

Lightweight ciphers are increasingly employed in cryptography because of the high demand for secure data transmission in wireless sensor network, embedded devices, and Internet of Things. The PRESENT algorithm as an ultra-lightweight block cipher provides better solution for secure hardware cryptography with low power consumption and minimum resource. This study generates the key using key rotation and substitution method, which contains key rotation, key switching, and binary-coded decimal-based key generation used in image encryption. The key rotation and substitution-based PRESENT architecture is proposed to increase security level for data stream and randomness in cipher through providing high resistance to attacks. Lookup table is used to design the key scheduling module, thus reducing the area of architecture. Field-programmable gate array (FPGA) performances are evaluated for the proposed and conventional methods. In Virtex 6 device, the proposed key rotation and substitution PRESENT architecture occupied 72 lookup tables, 65 flip flops, and 35 slices which are comparably less to the existing architecture.     

雷达系统超精简流式AES加密器设计和优化

为了满足雷达系统对信息加密传输的要求,对高级加密标准（AES）的计数模式（CTR）重新设计,将其改进成流加密的工作模式。通过进行结构折叠和算法重用,有效地减小了资源占用,提高了吞吐率。在Spartan3型号的FPGA上,仅占用728个slice就可以实现276.53Mbps的吞吐率。本设计实现了节省硬件资源的纯逻辑模式和速度较高的分布式内存模式,并且完成实时密钥调度和流水线设计,获得了高可靠性、高吞吐率和高安全性。通过对实际雷达数据的加密实验,验证了该设计的有效性,显示了流加密模式的AES在雷达系统加密传输中的强大潜力。     

基于任务生灭过程模型的边缘计算批处理调度算法分析与设计

移动边缘计算技术为低时延要求、资源敏感的计算任务需求提供解决方案,通过研究任务请求特征以提高调度算法效率是边缘计算的重要研究方向。不同于现有研究将任务请求特征建模为单一随机变量的做法,提出基于任务请求生灭过程模型的边缘计算架构,将求解最优调度决策的过程建模为无限期平均成本马尔可夫决策过程。在使用贝尔曼方程分析问题的过程中,利用任务的生灭特性对未来的请求到达做出估计以判断当前决策对未来系统时延能耗成本的影响,进而辅助确定当前状态的最优决策,并结合任务相关性感知提出批处理任务调度控制算法。所提算法根据生灭状态信息对策略迭代的状态空间和决策空间进行剪枝以降低策略改进的复杂度,突破了策略迭代算法的复杂度瓶颈。仿真结果表明,所提算法相较于传统的策略迭代算法具有明显的低复杂度优势,且能在不同系统条件下保持低时延、能耗成本。     

多功能组网雷达可变参数任务规划方法

针对任意周期雷达任务(侦查、干扰、探测等)在多功能组网雷达中的规划问题,提出了一种可变参数的任务规划方法。首先,分析雷达任务特性,建立可变参数雷达任务模型。然后,设定组网雷达中各雷达任务规划时间窗宽度和开槽宽度,使组网雷达可执行任务的周期与现有任务周期最接近。接着,针对雷达任务任意周期的特点,以任务周期变化量最小为原则对任务周期进行调整,保证多个任务在同一部雷达中不重叠,并且具有周期性。最后,利用启发式算法,以任务驻留时间的平均隶属度最大为目标完成任务规划。仿真结果与实例证明了该方法的有效性。     

Design of a hard real-time multi-core testbed for energy measurement

This paper presents a systematic methodology for designing a hard real-time multi-core testbed to validate and benchmark various rate monotonic scheduling (RMS)-based task allocation and scheduling schemes in energy consumption. The hard real-time multi-core testbed comprises Intel Core Duo T2500 processor with dynamic voltage scaling (DVS) capability and runs the Linux Fedora 8 operating system supporting soft real-time scheduling. POSIX threads API and Linux FIFO scheduling policy are utilized to facilitate the design and Dhrystone-based tasks are generated to verify the design. A LabView-based DAQ system is designed to measure the energy consumption of CPU and system board of the testbed. A case study of task allocation and scheduling algorithms is also presented that aim to optimize the schedule feasibility and energy consumed by the processor and memory module in the multi-core platform. The experience from the implementation is summarized to serve as potential guidelines for other researchers and practitioners.     

一种多核系统改进型列表调度算法

在任务调度领域,基于列表的任务调度算法被广泛应用。经典列表调度算法在节点排序阶段会对权值一致的任务节点进行随机排序,但这种节点排序方式过于粗糙,难以取得较好效果。针对这一缺陷,文中提出了一种改进型列表调度算法,通过特殊列表片段将权值一致的任务整合到一起,并对特殊列表片段的调度解空间进行遍历,以迭代产生更优的调度列表获得更好的调度效果。随机DAG图测试结果表明,提出的算法调度效果优异,算法平均增强比最高可达15.3%,不仅适用于多种任务图规模,且在CCR和平均出入度较高的情况下有更好的调度性能。     

高速无线个域网中一种基于效用公平的机会调度算法

基于对无线高速个域网中机会调度的研究,提出了一种适用于WPAN的机会主义时隙调度算法FPTS。该算法充分考虑了信道状态的波动和用户间的公平性,由参数更新模块和调度分配模块组成。参数更新模块根据调度结果更新控制参数,维护用户的公平性和自适应的跟踪信道的变化;调度分配模块负责计算每个用户的公平效用权值,并按照权值向各用户比例分配信道资源。仿真结果表明：所提调度方案能够在保证系统高吞吐量的前提下,获得LLPTS算法更好的公平性和信道使用效率。     

树形网格自适应调度模型研究

提出一种基于树形计算网格的自适应调度模型,实现对小粒度独立任务和用户大作业的自适应最优调度.通过对网格环境的实时检测,给出了基于节点负载状况、节点任务执行时间和任务特性的自适应调度算法.实验证明该任务调度模型在负载平衡和容错方面具有良好的性能.     

基于模糊聚类的云任务调度算法

为了更好地实践云计算提供廉价按需服务的宗旨,提出了一种在模糊聚类基础上,基于两级调度模式的任务调度(FCTLBS,fuzzy clustering and two level based task scheduling)算法,新算法设置用户调度和任务调度2个等级。对资源进行性能模糊聚类;根据任务参数计算资源偏好,使不同偏好任务在不同聚类中选择,缩小了选择范围,更好地反映了任务需求。仿真实验表明,本算法较之同类算法具备一定的优越性。     

Cooperative spectrum sensing scheduling scheme based on discrete particle swarm optimization algorithm

The statistical characteristics of the network state changes were analyzed by using the CTMC model.Considering the difference of each secondary user’s sensing ability,two integer programming problems on cooperative sensing scheduling scheme were established from two aspects:the primary users and the secondary users respectively.A discrete particle swarm optimization algorithm was proposed to solve the integer programming problems,and compared with the traditional random scheduling scheme and greedy scheduling scheme based on SNR.The simulation results show that the cooperative sensing scheduling scheme based on discrete particle swarm optimization algorithm is superior to random scheduling scheme and greedy scheduling scheme based on the SNR,which gets a higher spectrum sensing accuracy.     

Task Scheduling Algorithm for the Communication,Ocean, and Meteorological Satellite

In this paper, we propose an efficient single‐resource task scheduling algorithm for the Communication, Ocean, and Meteorological Satellite. Among general satellite planning functions such as constraint check, priority check, and task scheduling, this paper focuses on the task scheduling algorithm, which resolves conflict among tasks which have an exclusion relation and the same priority. The goal of the proposed task scheduling algorithm is to maximize the number of tasks that can be scheduled. The rationale of the algorithm is that a discarded task can be scheduled instead of a previously selected one depending on the expected benefit acquired by doing so. The evaluation results show that the proposed algorithm enhances the number of tasks that can be scheduled considerably.     

Scheduling for Concept-Oriented Rapid Prototyping

In this paper scheduling strategies for a rapid prototyping system are discussed. Our rapid prototyping system is able to deal with several CASE-tools and generate code for models of heterogenous domains. By using the emerging CASE Data Interchange Format CDIF the model data of CASE-tools is represented tool-independent. This tool-independent layer serves as a basis for analysis, simulation and code generation. The generated code is partitioned in tasks which must be scheduled as fast as possible using a real-time operating system to support high performance applications. We classify scheduling requirements for the constraints of rapid prototyping and present a new scheduling strategy called pseudo-rate scheduling which significantly improve the execution speed of rapid prototyping applications. Additionally, we provide a set of equations to estimate schedulability. Experimental results demonstrate the main advantages of our scheduling strategy.     

基于以太网的电力调度信息传输的开发

针对电力调度系统远程通信实时性传输的要求,分析了当前传统的电力调度通信系统的传输方法,以及以太网通信协议在信息远程传输的应用,重点结合电力系统应用的实际要求,给出了以太网在电力调度信息传输系统中的应用,从以太网应用模式、以太网通信模块设计以及数据传输机制三个方面进行了分析研究,对于进一步提高电力调度系统信息传输的实时性具有一定借鉴意义。     

WCDMA系统SIB块解码算法分析与优化

在初始小区搜索过程中.系统终端需要通过解码MIB和SIB获得进行小区驻留、随机接入等物理层过程的必要参数,因此如何在有效性和可靠性同时兼顾的情况下进行SIB块解码就显得很重要.本文首先介绍了WCDMA下行广播信道的结构,然后在对SIB块解码调度算法设计之前.分析了某一种SIB模块的设计,并在其设计的基础上结合实际情况提...     

分布式开放实时系统调度策略研究

为有效管理分布式开放实时系统(Distributed Open Real-Time System,DORTS)的CPU和网络资源,提供实时应用端到端延时确保,提出一种基于资源预留的分层调度策略.对于任务的调度,首先利用最大需求任务优先与最小可利用率节点适应算法将任务分配到各节点,然后在节点上采用基于服务器的两层调度架构...     

一种可重构阵列结构及其任务调度算法

提出了一种可以利用计算时间覆盖配置时间和数据传输时间的可重构阵列结构,并且针对该可重构阵列结构提出了一种表调度算法进行任务调度.在SOCDesigner平台上进行了软硬件协同仿真,对于IDCT,FFT,4×4矩阵乘法新可重构阵列相比原来的可重构阵列有平均约10%的速度提升.     

嵌入式操作系统μC/OS-Ⅱ面向数控系统的改进

为了使嵌入式操作系统μC/OS-Ⅱ更加适合数控系统的应用,对μC/OS-Ⅱ的任务分类和任务调度做了改进。将任务分为普通任务和抢占式任务。普通任务指通过操作系统调度器调度运行的任务,它又分为周期任务和随机任务。周期任务对应数控系统中要求定期执行的任务,随机任务对应数控系统中由信号触发执行的任务。抢占式任务不通过调度器调度运行,而在中断处理中直接运行。抢占式任务对应数控系统中执行频率高,执行时间短的任务。实验证明,改进后的μC/OS-Ⅱ更适合数控系统任务的添加。     

满足本地化计算的集群资源调度策略

将本地化计算分成节点本地化计算和机架本地化计算2个层次,分别称作节点本地化计算和机架本地化计算。结合主导资源公平调度策略DRF和Delay调度约束机制提出一种满足本地化计算的集群资源调度策略DDRF,旨在既能达到一个较高的本地化计算水平,又能保证资源调度的“公平性”。通过数据实验分析了在DDRF调度策略下本地化计算延迟对作业执行效率的影响。