实时响应物联网中基于查询的数据转发方案

在许多基于传感器网络技术的物联网应用中,用户需要快速的查询响应,比如智能交通物联网应用中,行驶在路上的司机即时查询附近的空停车位信息.如何为此类物联网设计一种符合传感器网络特性(如能量有效等)的快速数据转发方案是一项重要的挑战性工作.已有的传感器网络实时数据转发协议大都因未解决好转发断路带来的额外开销、孤立节点处理耗时、难以适应网络拓扑动态变化等关键性问题而未取得理想的实时性效果.为此,该文提出一种新的基于查询的快速数据转发方案,利用查询消息为每个传感器节点建立最快速的数据转发路径(有向无环图),此外文中给出的综合路径代价模型可以均衡网络能量和减少网络拥塞延时,最后设计了贪婪的分布式数据转发算法及其改进算法,并用仿真实验验证了该方案的有效性和高效性.     

银行作为建设工程保证担保主体的关键风险研究

银行保证担保作为建设领域担保制度的重要组成部分,在实践中得到了广泛应用.为了解决银行在提供保证担保时,由于缺乏对担保关键风险要素的考察而增加担保面临的风险问题,本文在对担保领域的专家学者进行问卷调查地过程中提炼出7个风险要素.在此基础上,通过建立数学模型,采用统计分析的方法,识别出银行担保过程中的4个关键风险指标,即承包商信誉、原材料市场的稳定性、承包商实力和劳资纠纷.基于本文的研究成果,银行在对建设工程提供保证担保时,可以通过重点考察以上4个指标决定是否提供担保以及收取保费的多少等一系列问题,实现降低承保风险的目的.     

Active Store Window: Enabling Far Store-Load Forwarding with Scalability and Complexity-Efficiency

Conventional dynamically scheduled processors often use fully associative structures named load/store queue (LSQ) to implement the value communication between loads and the older in-flight stores and to detect the store-load order violation.But this in-flight forwarding only occupies about 15% of all store-load communications,which makes the CAM-based micro-architecture the major bottleneck to scale store-load communication further.This paper presents a new micro-architecture named ASW (short for active store window).It provides a new structure named speculative active store window to implement more aggressively speculative store-load forwarding than conventional LSQ.This structure could forward the data of committed stores to the executing loads without accessing to L1 data cache,which is referred to as far forwarding in this paper.At the back-end of the pipeline,it uses in-order load re-execution filtered by the tagged SSBF (short for store sequence bloom filter) to verify the correctness of the store-load forwarding.The speculative active store window and tagged store sequence bloom filter are all set-associate structures that are more efficient and scalable than fully associative structures.Experiments show that this simpler and faster design outperforms a conventional load/store queue based design and the NoSQ design on most benchmarks by 10.22% and 8.71% respectively.     

基于差分演化算法的大规模包匹配研究

在差分演化算法与传统包匹配算法基础上,提出一种改进包匹配算法。该算法包匹配的时间性能与规则数目存在弱相关性,可处理多维和大规模规则库的包匹配问题。数值分析与实验结果表明,与基于Trie类算法相比,该算法能使数据包有效地进行线速转发,改善包匹配性能。     

一种实现区分服务和带宽公平性的队列管理算法

区分服务(DiffServ)体系对于可靠型(AF)服务的OUT数据包和尽力型(BE)服务的数据包并未提供任何优先处理机制。为避免某AF服务的数据流占用过多的网络带宽，提出了一种名为TD&BF的核心无状态队列管理算法，该算法能在保证AF业务承诺服务速率的前提下，将剩余带宽公平地分配给BE业务及AF业务。     

Inferential Queueing and Speculative Push

Communication latencies within critical sections constitute a major bottleneck in some classes of emerging parallel workloads. In this paper, we argue for the use of two mechanisms to reduce these communication latencies: Inferentially Queued locks (IQLs) and Speculative Push (SP). With IQLs, the processor infers the existence, and limits, of a critical section from the use of synchronization instructions and joins a queue of lock requestors, reducing synchronization delay. The SP mechanism extracts information about program structure by observing IQLs. SP allows the cache controller, responding to a request for a cache line that likely includes a lock variable, to predict the data sets the requestor will modify within the associated critical section. The controller then pushes these lines from its own cache to the target cache, as well as writing them to memory. Overlapping the protected data transfer with that of the lock can substantially reduce the communication latencies within critical sections. By pushing data in exclusive state, the mechanism can collapse a read-modify-write sequences within a critical section into a single local cache access. The write-back to memory allows the receiving cache to ignore the push. Neither mechanism requires any programmer or compiler support nor any instruction set changes. Our experiments demonstrate that IQLs and SP can improve performance of applications employing frequent synchronization.     

水下无线传感器网络自适应转发协议

针对水下传感器网络延时长、网络拓扑动态变化的问题,提出一种三维水下无线传感器网络自适应转发协议AFP(adaptive forwarding protocol)。AFP采用自适应方法获得转发概率与转发区域,让转发区域内与上一跳转发节点距离相对远,且与上一跳节点与目的节点的矢量方向相对近的节点以高概率转发分组,从而减少了转播冗余和冲突,提高了转播效率。应用NS-2仿真软件对协议的性能进行仿真,仿真结果表明:与VBF协议相比,AFP提高了分组投递率、减少了端对端延迟,证明了AFP在水下无线传感器网络环境下工作的可行性和有效性。     

一种减轻Xcast网络路由节点负载的动态规划策略

基于显式组播(Xcast)机制,介绍了一种减少组播组中存放自动转发信息的状态节点数量,从而减轻路由路径负担的策略。通过算法描述和分析及实验仿真,此方案可以有效地节省网络资源。     

推测执行中值预测与指令重用技术的研究与分析

值预测和指令重用是通过开发程序执行结果的冗余来解决数据相关的两种不同的新技术。本文首先从这两种新技术的原理出发,深入剖析了它们的技术特性,然后研究了它们与微体系结构其它特征间的相互影响,最后评估了这些技术对微处理器性能的影响。     

移动社会网络中基于活动的消息机会转发

针对移动社会网络中节点移动形成的成簇特性和节点参与活动表现的周期特点,提出了一种基于活动的消息机会转发算法（activity-based message opportunistic forwarding,简称AMOF）.算法思想是：当消息携带节点与目的节点存在相同活动时,选择消息交付概率高的中继节点转发消息;当消息携带节点与目的节点不存在相同活动时,选择消息间接交付概率高的链路来转发消息.仿真结果表明,与经典路由算法（如Epidemic,PRoPHET,CMOT和CMTS）比较,所提出的路由算法不仅能够提高消息的传输成功率,还能有效地降低传输时延和网络负载.