即时通讯软件的安全性分析

在互联网服务中,即时通讯已成为了最流行的服务模式之一,人们对即时通讯的依赖程度也与日俱增。但是, 频频出现的病毒和黑客攻击使广大用户深受其害,即时通讯的安全问题也日益严峻。为了从根本上解决问题,本文对即时通讯软件的架构和协议进行了深入分析,目的是找出漏洞根源,给开发者和使用者提供防止漏洞的依据。     

A parallel and scalable algorithm for ADI method with pre-propagation and message vectorization

It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose “P-scheme” which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.

In order to overcome this difficulty, we propose an improved version of the P-scheme with “message vectorization” which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16,386 problems, respectively.     

Windows中的消息传递机制

本文讨论了VisualBasic中的消息传递机制以及如何在Windows的任务内及任务间进行数据交换．     

On collaborative content distribution using multi-message gossip

We study epidemic schemes in the context of collaborative data delivery. In this context, multiple chunks of data reside at different nodes, and the challenge is to simultaneously deliver all chunks to all nodes.     

数据压缩的综合字典模型

文中提出一种无损的数据压缩的字典方法，被称为综合字典方法，该方法在较大程度上消除数据文件中多种形式的冗余，达到较好的压缩效果。     

移动消息类业务的发展演进趋势分析

随着国内外SMS业务的巨大成功，移动消息类业务的市场潜力初步显露，并逐步呈现了SMS与EMS、UMS、MMS、IM等多种不同标准的消息类业务互相竞争的局面。通过对移动消息业业务发展历史的回顾，在对SMS的成功要素与UMS、MMS业务对比分析基础上，探讨了移动消息类业务发展演进趋势。     

虚拟企业模型并行仿真研究

随着各种全新的制造理念,特别是虚拟企业的出现,企业模型的规模不断扩大,使目前存在的大多数企业模型仿真系统的效率大大下降。该文针对此问题,通过深入分析虚拟企业模型结构,并在已有的构件化企业建模体系CEMS及其仿真系统的基础上,结合异步仿真技术和多线程技术提出了一种分层式企业模型仿真体系结构,为虚拟企业模型的快速高效的仿真提供了一种有效的方法。     

基于Boost消息机制研究与实现

消息通信机制可以有效的简化系统设计,增强系统的可扩展性。Boost Signal/Slot机制,为在进行消息机制开发提供了有力的工具。以Boost为基础,分析了Boost消息机制的实现方式,通过引入一个简单实例,演示了利用Boost构造消息机制的基本方法。     

An improved algorithm for finding the median distributively

Given two processes, each having a total-ordered set ofn elements, we present a distributed algorithm for finding median of these 2n elements using no more than logn +O(logn) messages, but if the elements are distinct, only logn +O(1) messages will be required. The communication complexity of our algorithm is better than the previously known result which takes 2 logn messages.     

Energy profile of rollback-recovery strategies in high performance computing

Extreme-scale computing is set to provide the infrastructure for the advances and breakthroughs that will solve some of the hardest problems in science and engineering. However, resilience and energy concerns loom as two of the major challenges for machines at that scale. The number of components that will be assembled in the supercomputers plays a fundamental role in these challenges. First, a large number of parts will substantially increase the failure rate of the system compared to the failure frequency of current machines. Second, those components have to fit within the power envelope of the installation and keep the energy consumption within operational margins. Extreme-scale machines will have to incorporate fault tolerance mechanisms and honor the energy and power restrictions. Therefore, it is essential to understand how fault tolerance and energy consumption interplay. This paper presents a comparative evaluation and analysis of energy consumption of three different rollback-recovery protocols: checkpoint/restart, message logging and parallel recovery. Our experimental evaluation shows parallel recovery has the minimum execution time and energy consumption. Additionally, we present an analytical model that projects parallel recovery can reduce energy consumption more than 37% compared to checkpoint/restart at extreme scale.