基于进程通信的电力系统分布式计算模型

当前,在电力系统分布式计算领域,缺乏一种通用的计算模型以满足各种电力系统分布式计算的基础需求。基于此,分析了电力系统分布式计算的特点,从软件设计的角度出发,抽象出其中的节点行为模型,并针对此提出了一种可广泛适用于电力系统分布式计算的,基于进程通信的计算模型。实际应用表明,该模型可以有效地应用于电力系统的分布式计算中。     

因特网上基于节点角色的计算资源共享平台——RB-CRSP

提出了因特网上基于节点角色的计算资源共享平台——RB-CRSP。设计时充分考虑节点的角色性和功能性,把因特网上的网络资源按照角色划分为服务器端节点、协调节点、工作机节点与客户机节点四类实体,通过配合RB-CRSP的应用编程模式,完成并行分布式计算。分析了RB-CRSP中的自适应资源调度策略,该策略考虑了节点的硬件信息与可信誉机制,实现了平台的负载均衡性;在动态的因特网环境下,利用面向工作机的容错方式保证了平台的可靠性。案例程序选择了典型的并行BenchMark程序：N皇后问题,测试结果表明,RB-CRSP可以方便聚集异构环境下的空闲计算资源,平台的性能与机器硬件条件和可靠性密切相关。     

A framework of auto-adapting distributed object for mobile computing

The low bandwidth hinders the development of mobile computing.Besides providing relatively higher bandwidth on communication layer,constructing adaptable upper application is important.In this paper,a framework of autoadapting distributed object is proposed,and evaluating methods of object performance are given as well.Bistributed objects can abjust their behaviors automatically in the framework and keep in relatively good performance to serve requests of remote applications.It is an efficient way to implement the performance transparency for mobile clients.     

LVT: a layered verification technique for distributed computing systems

This paper presents a layered verification technique, called LVT, for the verification of distributed computing systems with multiple component layers. Each lower layer in such a system provides services in support of functionality of the higher layer. By taking a very general view of programming languages as interfaces of systems, LVT treats each layer in a distributed computing system as a distributed programming language. Each relatively higher‐level language in the computing system is implemented in terms of a lower‐level language. The verification of each layer in a distributed computing system can then be viewed as the verification of implementation correctness for a distributed language. This paper also presents the application of LVT to the verification of a distributed computing system, which has three layers: a small high‐level distributed programming language; a multiple processor architecture consisting of an instruction set and system calls for inter‐process message passing; and a network interface. Programs in the high‐level language are implemented by a compiler mapping from the language layer to the multiprocessor layer. System calls are implemented by network services. LVT and its application demonstrate that the correct execution of a distributed program, most notably its inter‐process communication, is verifiable through layers. The verified layers guarantee the correctness of (1) the compiled code that makes reference to operating system calls, (2) the operating system calls in terms of network calls, and (3) the network calls in terms of network transmission steps. The specification and verification involved are carried out by using the Cambridge Higher Order Logic (HOL) theorem proving system. Copyright © 1999 John Wiley & Sons, Ltd.     

Secure group communication schemes for dynamic heterogeneous distributed computing

Nowadays Sensor Networks and Ad Hoc Networks are widely used communication facilities, mainly because of their many application settings. Again, though above types of network are paradigms of communication widespread and well-established in the state of the art, however, they turn out to be among the most important concepts underlying the modern and increasingly expanding User-Centric Networks, which can be used to build dynamic middleware services for heterogeneous distributed computing. In this way, can be addressed the strong dynamic behavior of user communities and of resource collections they use.In this paper we focus our attention on key predistribution for secure communications in those types of networks. In particular, we first analyze some schemes proposed in the literature for enabling a group of two or more nodes to compute a common key, which can be used later on to encrypt or authenticate exchanged messages. The schemes we have chosen are well representative of different design strategies proposed in the state of the art. Moreover, in order to find out under which conditions and in which settings a scheme is more suitable than others, we provide an evaluation and a performance comparison of those schemes. Furthermore, we look at the problem of identifying optimal values for the parameters of such schemes, with respect to a certain desirable security degree and reasonable security assumptions. Finally, we extend one of those schemes, showing both analytically and through experiments, the improvement the new scheme provides in terms of security compared to the basic one.     

A taxonomy and survey of grid resource management systems for distributed computing

The resource management system is the central component of distributed network computing systems. There have been many projects focused on network computing that have designed and implemented resource management systems with a variety of architectures and services. In this paper, an abstract model and a comprehensive taxonomy for describing resource management architectures is developed. The taxonomy is used to identify approaches followed in the implementation of existing resource management systems for very large‐scale network computing systems known as Grids. The taxonomy and the survey results are used to identify architectural approaches and issues that have not been fully explored in the research. Copyright © 2001 John Wiley & Sons, Ltd.     

嵌入式通讯平台的设计与实现

介绍了一个基于客户/服务器模式下的嵌入式通讯平台的设计原理,分析了它的软硬件组成、Socket通信流程和串口类的封装,阐述了在Delphi环境下COM(component object model)的实现原理,以及如何利用套接字控件完成COM服务器和COM客户端之间的数据传递,此外,结合实例说明了串口通信的流程.     

一种针对可信计算平台的分布式可信验证机制

可信计算技术在提高系统安全性的同时,也给用户使用计算机带来了诸多限制。为了解决自由软件等未授权程序的可信验证问题,提出了一种基于可信计算的分布式可信验证机制（DTVMTC）。该机制以庞大的Internet用户群为基础,通过网络数据统计的方法,实现对应用程序的可信验证,从而解决了对无可信来源但实际可信的应用程序进行可信验证的问题,保障了用户使用可信计算平台的自由。在Windows平台实现了DTVMTC的原型,实验结果表明DTVMTC能够实现预定目标且具有良好的性能。     

A partitioning methodology that optimizes the communication cost for reconfigurable computing systems

This paper focuses on the design process for reconfigurable architecture. Our contribution focuses on introducing a new temporal partitioning algorithm. Our algorithm is based on typical mathematic flow to solve the temporal partitioning problem. This algorithm optimizes the transfer of data required between design partitions and the reconfiguration overhead. Results show that our algorithm considerably decreases the communication cost and the latency compared with other well known algorithms.     

Distributed Model Checking: From Abstract Algorithms to Concrete Implementations

Distributed Model Checking (DMC) is based on several distributed algorithms, which are often complex and error prone. In this paper, we consider one fundamental aspect of DMC design: message passing communication, the implementation of which presents hidden tradeoffs often dismissed in DMC related literature. We show that, due to such communication models, high level abstract DMC algorithms might face implicit pitfalls when implemented concretely. We illustrate our discussion with a generic distributed state space generation algorithm.     

Bayanihan: building and studying web-based volunteer computing systems using Java

Project Bayanihan is developing the idea of volunteer computing, which seeks to enable people to form very large parallel computing networks very quickly by using ubiquitous and easy-to-use technologies such as web browsers and Java. By utilizing Java’s object-oriented features, we have built a flexible software framework that makes it easy for programmers to write different volunteer computing applications, while allowing researchers to study and develop the underlying mechanisms behind them. In this paper, we show how we have used this framework to write master-worker style applications, and to develop approaches to the problems of programming interface, adaptive parallelism, fault-tolerance, computational security, scalability, and user interface design.     

高能物理云平台中的弹性计算资源管理机制

虚拟化技术作为一种新的资源管理技术,正在高能物理领域得到越来越广泛的应用。静态虚拟机集群方式已经逐渐不能满足多作业队列对于计算资源动态的需求。为此,实现了一种云计算环境下面向多作业队列的弹性计算资源管理系统。系统通过高吞吐量计算系统HTCondor运行计算作业,使用开源的云计算平台Openstack管理虚拟计算节点,给出了一种结合虚拟资源配额服务,基于双阈值的弹性资源管理算法,实现资源池整体伸缩,同时设计了二级缓冲池以提高伸缩效率。目前系统已部署在高能所公共服务云IHEPCloud上,实际运行结果表明,当计算资源需求变化时系统能够动态调整各队列虚拟计算节点数量,同时计算资源的CPU利用率相比传统的资源管理方式有显著的提高。     

Robust scalable stabilisability conditions for large-scale heterogeneous multi-agent systems with uncertain nonlinear interactions: towards a distributed computing architecture

Large-scale dynamic systems are becoming highly pervasive in their occurrence with applications ranging from system biology, environment monitoring, sensor networks, and power systems. They are characterised by high dimensionality, complexity, and uncertainty in the node dynamic/interactions that require more and more computational demanding methods for their analysis and control design, as well as the network size and node system/interaction complexity increase. Therefore, it is a challenging problem to find scalable computational method for distributed control design of large-scale networks. In this paper, we investigate the robust distributed stabilisation problem of large-scale nonlinear multi-agent systems (briefly MASs) composed of non-identical (heterogeneous) linear dynamical systems coupled by uncertain nonlinear time-varying interconnections. By employing Lyapunov stability theory and linear matrix inequality (LMI) technique, new conditions are given for the distributed control design of large-scale MASs that can be easily solved by the toolbox of MATLAB. The stabilisability of each node dynamic is a sufficient assumption to design a global stabilising distributed control. The proposed approach improves some of the existing LMI-based results on MAS by both overcoming their computational limits and extending the applicative scenario to large-scale nonlinear heterogeneous MASs. Additionally, the proposed LMI conditions are further reduced in terms of computational requirement in the case of weakly heterogeneous MASs, which is a common scenario in real application where the network nodes and links are affected by parameter uncertainties. One of the main advantages of the proposed approach is to allow to move from a centralised towards a distributed computing architecture so that the expensive computation workload spent to solve LMIs may be shared among processors located at the networked nodes, thus increasing the scalability of the approach than the network size. Finally, a numerical example shows the applicability of the proposed method and its advantage in terms of computational complexity when compared with the existing approaches.     

Cooperative computing and integrated system management: A critical comparison of architectural approaches

New information processing service structures based on client-server concepts gain growing importance in both scientific and commercial computing because theyprovide a high flexibility with respect to the positioning of building blocks of a distributed application. The price for this flexibility, however, is a more complex system management. The paper discusses the new management requirements in a cooperative computing environment. The management platforms needed in this context must provide appropriate models for cooperation, services for supporting distributed management applications and an information model as a basis for the modeling of resources relevant to system management. The paper presents and evaluates approaches to solutions existing so far in research and development.     

MidHDC: Advanced topics on middleware services for heterogeneous distributed computing. Part 2

Currently distributes systems support different computing paradigms like Cluster Computing, Grid Computing, Peer-to-Peer Computing, and Cloud Computing all involving elements of heterogeneity. These computing distributed systems are often characterized by a variety of resources that may or may not be coupled with specific platforms or environments. All these topics challenge today researchers, due to the strong dynamic behavior of the user communities and of resource collections they use.The second part of this special issue presents advances in allocation algorithms, service selection, VM consolidation and mobility policies, scheduling multiple virtual environments and scientific workflows, optimization in scheduling process, energy-aware scheduling models, failure Recovery in shared Big Data processing systems, distributed transaction processing middleware, data storage, trust evaluation, information diffusion, mobile systems, integration of robots in Cloud systems.     

A cost-effective cloud computing framework for accelerating multimedia communication simulations

Multimedia communication research and development often requires computationally intensive simulations in order to develop and investigate the performance of new optimization algorithms. Depending on the simulations, they may require even a few days to test an adequate set of conditions due to the complexity of the algorithms. The traditional approach to speed up this type of relatively small simulations, which require several develop–simulate–reconfigure cycles, is indeed to run them in parallel on a few computers and leaving them idle when developing the technique for the next simulation cycle. This work proposes a new cost-effective framework based on cloud computing for accelerating the development process, in which resources are obtained on demand and paid only for their actual usage. Issues are addressed both analytically and practically running actual test cases, i.e., simulations of video communications on a packet lossy network, using a commercial cloud computing service. A software framework has also been developed to simplify the management of the virtual machines in the cloud. Results show that it is economically convenient to use the considered cloud computing service, especially in terms of reduced development time and costs, with respect to a solution using dedicated computers, when the development time is longer than one hour. If more development time is needed between simulations, the economic advantage progressively reduces as the computational complexity of the simulation increases.     

A uniform approach for programming distributed heterogeneous computing systems

Large-scale compute clusters of heterogeneous nodes equipped with multi-core CPUs and GPUs are getting increasingly popular in the scientific community. However, such systems require a combination of different programming paradigms making application development very challenging.In this article we introduce libWater, a library-based extension of the OpenCL programming model that simplifies the development of heterogeneous distributed applications. libWater consists of a simple interface, which is a transparent abstraction of the underlying distributed architecture, offering advanced features such as inter-context and inter-node device synchronization. It provides a runtime system which tracks dependency information enforced by event synchronization to dynamically build a DAG of commands, on which we automatically apply two optimizations: collective communication pattern detection and device-host-device copy removal.We assess libWater’s performance in three compute clusters available from the Vienna Scientific Cluster, the Barcelona Supercomputing Center and the University of Innsbruck, demonstrating improved performance and scaling with different test applications and configurations.