支持线程级猜测的存储体系结构设计

在线程级猜测中进行数据依赖相关检测时,存在Cache一致性协议无法容忍线程切换引起的Cache块替换等问题。为此,通过分析推测线程数据管理模型,结合推测线程切概率低的特点,提出一种分布-共享式恢复缓冲区结构。该结构在进行Cache一致性检验时结合作废向量和版本优先级寄存器进行数据依赖检测,利用L2 Cache进行推测数据缓冲和恢复以支持推测线程切换。修改SESC模拟器以验证和评估该存储体系结构。实验结果表明,在保持模拟器理想加速比的情况下,该存储体系结构可以较好地支持推测线程切换。     

QoS可控的网络可视电话设计与实现

设计并实现了基于USB接口的低成本网络可视电话系统，描述了其内嵌的QoS控制机制。基于区分服务体系，对IP数据包的ToS字段进行不同的编码设置，以区别服务的优先级；采用双向链表结构的抖动缓冲区进行时延抖动的平滑，链表的节点位数据帧或空闲帧，二者可动态切换，输入线程和输出线程互斥地对其进行读写操作。实验证明，在多数应用场合下，系统的通信时延小于30ms，丢包率低于10%。     

移动IP环境下的平滑切换缓存管理优化

为克服移动节点在移动切换过程中丢包并使服务质量达到无缝切换的效果，IETF提出了平滑切换的解决方案．但此方案在实际应用中易造成整个网络吞吐率的下降．本文在通过仿真实验验证IETF缓存管理机制对TCP网络的性能造成影响的基础上，提出了一种基于RTT的拥塞窗口控制方案，仿真实验结果显示该方案能很好地解决平滑切换过程所造成的网络性能下降问题，具有其合理性与实用性．     

库函数调用的安全性分析

首先介绍缓冲区溢出机制和基于缓冲区溢出的攻击形式,从C程序员的角度讨论了三类常用的库函数在调用时可能引发的安全问题,并详细分析了缓冲区溢出的内在原因及可能被利用的攻击方法，如果在编程时能针对这些库函数的调用有意识地采取应对措施,无疑将减少缓冲区溢出漏洞,提高程序的安全性能。     

嵌入式协议栈缓冲区管理的简化实现方法

本文针对嵌入式系统网络协议栈的特点,设计了一种简洁、高效、且对存储资源要求很少的缓冲区管理策略。该策略基于缓冲区单次拷贝技术,克服了有些嵌入式系统存储控制器低效的存储块拷贝。除了提供缓冲区管理例程,还实现了缓冲区的动态分配与回收。最后,我们将实现源代码移植到X86嵌入式裸机平台的64K PCI扩展ROM中,基于该缓冲区管理设计了TCP/IP协议,并已经应用于无本地存储设备的超级刀片服务器上。     

基于缓冲器的编码器接口扩展方法研究

在数据采集测控系统中,用于检测的绝对值角度编码器的输出很多是基于SSI接口,采用SSI接口的绝对值角度编码器输出有时需要连接到多个不同的独立测控系统,由于SSI接口是单访问接口,多主机共享往往是较难解决又不得不解决的问题,本文提出了一种缓冲式并行读取绝对值角度编码器值的方法,实现了信号的并行读取,并给出了硬件和软件设计的思想和方法。     

Fabricating Buffer Layers for YBa2Cu3Oy Coated Conductor by Surface Oxidation Epitaxy

Coated conductor of YBa2Cu3Oy(YBCO) withhighsuperconducting critical current (IC)is promisingfor many applications . To decrease weak link andlarge grain boundary angle it is i mportant to achievebiaxial textured YBCO.Sofar ,a fewtechniques havebeen appli…     

Win32.SQLExp.Worm蠕虫病毒分析与对策

分析了Win32．SQt,Exp．Worm蠕虫病毒原理，并给出相应解决方案。     

Mechanistic modelling of the milling process using an adaptive depth buffer

A mechanistic model of the milling process based on an adaptive and local depth buffer is presented. This mechanistic model is needed for speedy computations of the cutting forces when machining surfaces on multi-axis milling machines. By adaptively orienting the depth buffer to match the current tool axis, the need for an extended Z-buffer is eliminated. This allows the mechanistic model to be implemented using standard graphics libraries, and gains the substantial benefit of hardware acceleration. Secondly, this method allows the depth buffer to be sized to the tool as opposed to the workpiece, and thus improves the depth buffer size to accuracy ratio drastically. The method calculates tangential and radial milling forces dependent on the in-process volume of material removed as determined by the rendering engine depth buffer. The method incorporates the effects of both cutting and edge forces and accounts for cutter runout. The simulated forces were verified with experimental data and found to agree closely. The error bounds of this process are also determined.     

Entropy maximisation and open queueing networks with priorities and blocking

A review is carried out on the characterisation and algorithmic implementation of an extended product-form approximation, based on the principle of maximum entropy (ME), for a wide class of arbitrary finite capacity open queueing network models (QNMs) with service and space priorities. A single server finite capacity GE/GE/1/N queue with R (R>1) distinct priority classes, compound Poisson arrival processes (CPPs) with geometrically distributed batches and generalised exponential (GE) service times is analysed via entropy maximisation, subject to suitable GE-type queueing theoretic constraints, under preemptive resume (PR) and head-of-line (HOL) scheduling rules combined with complete buffer sharing (CBS) and partial buffer sharing (PBS) management schemes stipulating a sequence of buffer thresholds {N=(N₁,…,N_R),0<N_i≤N_i−1,i=2,…,R}. The GE/GE/1/N queue is utilised, in conjunction with GE-type first two moment flow approximation formulae, as a cost-effective building block towards the establishment of a generic ME queue-by-queue decomposition algorithm for arbitrary open QNMs with space and service priorities under repetitive service blocking with random destination (RS-RD). Typical numerical results are included to illustrate the credibility of the ME algorithm against simulation for various network topologies and define experimentally pessimistic GE-type performance bounds. Remarks on the extensions of the ME algorithm to other types of blocking mechanisms, such as repetitive service blocking with fixed destination (RS-FD) and blocking-after-service (BAS), are included.