Putting it all together – Formal verification of the VAMP

In the verified architecture microprocessor (VAMP) project we have designed, functionally verified, and synthesized a processor with full DLX instruction set, delayed branch, Tomasulo scheduler, maskable nested precise interrupts, pipelined fully IEEE compatible dual precision floating point unit with variable latency, and separate instruction and data caches. The verification has been carried out in the theorem proving system PVS. The processor has been implemented on a Xilinx FPGA. A shorter version of this article with the title “Instantiating uninterpreted functional units and memory system: functional verification of the VAMP” appeared in [8]. The work reported here was done while all the authors were with Saarland University.     

分数频率复用的帧结构及性能分析

针对现代无线通信系统在干扰控制方面越来越高的要求,利用通信帧中子载波的重新分配,提出了帧结构设计中一种新的分数频率复用方法—时频分分数频率复用,并将其与传统的分数频率复用方式进行比较。这一新方法是在对系统容量进行建模之后,综合资源块分配中的时分和频分模式提出的,其对应的帧结构相对于传统的FFR具有更高的调节粒度。实验结果验证了这种设计以少量系统容量为代价,在提升系统公平性、提高边缘用户吞吐率方面的性能优势。     

支持MES系统的服务程序设计

制造执行系统正被广泛地应用于企业的现场生产中,但目前由于大多数的制造执行系统价格昂贵,多数是针对连续生产型企业的,并不适用于我国现存的大量离散型生产企业.我们设计了一种由服务程序支持的制造执行系统,这种系统有效地降低了开发成本,同时又继承了先进制造执行系统高效、灵活、可靠、适应性强等特点,非常适用于离散型的生产企业.这里主要介绍了该系统服务程序部分的设计,该服务程序能够完成车间生产计划的自动排产和其它相关的计划功能.最后在实施中对这种系统进行了测试,收到了很好的效果。     

路由器QoS模块研究

互联网从研究网络到商业网络的转化以及多种对QOS有不同要求的应用的出现要求互联网提供QOS．本文首先论证了在路由器中实现QOS的必要性，然后以此为基础，给出了在路由器中实现QOS模块所需要考虑的问题和实现框架，并详细讨论了实现细节．最后在具有自主知识产权的BQ2000路由器上对该模块作了测试，给出了评测．     

Linux 2.6内核进程调度分析

介绍了Linux 2.4内核调度策略的不足,深入分析了linux 2.6进程调度算法思想,指出其相对于Linux 2.4内核的进步点,并对Linux内核调度技术的进一步完善提出了自己的看法.     

社会保险系统中方法库技术的实现

社会保险系统中,存在很多政策计算问题,使软件有效的适应政策变化以及大量的计算问题,我们必须实现方法库技术。本文首先介绍方法库技术的思想,基于此,我们要在数据库中建立参数库和方法库,最后提出实现方法库技术的调度方法,在社保软件中实现方法库技术。     

PBS中的任务调度以及一类资源分配失效的解决

首先对PBS强大的任务调度功能做了详细的介绍,然后实现了PBS和MPICH的绑定,从而解决了使用PBS和MPICH所带来的资源分配失效的问题。     

制造网格中资源管理与调度系统的研究

为解决制造网格 (MG)中资源管理与调度问题 ,本文开发了制造网格信息服务 (MGIS)和制造网格资源调度器 (MGRS) ,建立了制造网格资源管理与调度系统。其中 ,MGIS通过集成Globus提供的检测查询服务 (MDS)和各种制造资源封装模板实现了资源的远程封装、注册、发现和监控管理 ,而MGRS实现了全局工艺规划 (GPP)分析、资源发现、资源选择、资源匹配以及容错处理等基于TQCS(时间、质量、成本、服务 )的资源调度功能。最后 ,本文通过建立应用原型说明了该系统的实际应用过程。     

基于 OpenStack 的虚拟资源调度技术研究

传统的高能物理计算系统基于物理机集群,主要通过 Torque、Condor、LSF 等资源管理和作业调度系统将作业调度到物理机器上运行,缺少对虚拟化计算的接口支持。我们选取 OpenStack 作为底层虚拟化平台,设计并实现上层调度系统与 OpenStack 之间的桥梁,采用推拉结合的作业运行方式,构建虚拟计算集群。     

A general distributed scalable grid scheduler for independent tasks

We consider non-preemptively scheduling a bag of independent mixed tasks (hard, firm and soft) in computational grids. Based upon task type, we construct a novel generalized distributed scheduler (GDS) for scheduling tasks with different priorities and deadlines. GDS is scalable and does not require knowledge of the global state of the system. It is composed of several phases: a multiple attribute ranking phase, a shuffling phase, and a task-resource matched peer to peer dispatching phase. Results of exhaustive simulation demonstrate that with respect to the number of high-priority tasks meeting deadlines, GDS outperforms existing approaches by 10%–25% without degrading schedulability of other tasks. Indeed, with respect to the total number of schedulable tasks meeting deadlines, GDS is slightly better. Thus, GDS not only maximizes the number of mission-critical tasks meeting deadlines, but it does so without degrading the overall performance. The results have been further confirmed by examining each component phase of GDS. Given that fully known global information is time intensive to obtain, the performance of GDS is significant. GDS is highly scalable both in terms of processors and number of tasks—indeed it provides superior performance over existing algorithms as the number of tasks increase. Also, GDS incorporates a shuffle phase that moves hard tasks ahead improving their temporal fault tolerance. Furthermore, since GDS can handle mixed task types, it paves the way to open the grid to make it amenable for commercialization. The complexity of GDS is O(n²m)$O\left(n^{2}m\right)$ where n$n$ is the number of tasks and m$m$ the number of machines.