多功能网络监控与辅助教学系统设计

计算机网络教学已经普及,现有的虚拟教室软件由于价格昂贵以及网络监控功能较弱等特点并不适合一般学校使用。针对这些问题,设计了一个基于UDP网络通信协议的多功能网络监控和辅助教学系统方案。此方案由控制台系统和工作站系统组成,在功能上兼顾网络监控和辅助教学,具备自动监控和控制计算机教学网络的功能;根据系统的特点,设计了基于UDP的控制台与工作站之间的数据通信协议。最后给出了此系统实现的主要软件流程图以及对系统的最终实现方式。     

多机器人编队离散模型及队形控制稳定性分析

针对包含绕心运动情况下的多机器人编队进行离散建模,并利用该模型解决保持队形期望前端始终朝着编队前进方向的控制问题.以控制多机器人编队收敛到期望的队形并镇定到预设运动规律上为目标,定义了一类通信拓扑图,基于该类图提出了一种分布式协同控制算法.给出了该控制算法下编队系统渐进稳定的充分必要条件及反馈控制参数的收敛域.证明了在该充分必要条件下可实现编队收敛到期望的队形和预设运动规律上的目标.仿真实验表明,在该算法控制下多机器人编队较好地收敛到期望队形并按预设规律运动,且过程中始终保持队形期望前端朝着编队前进方向,进而验证了该算法的有效性和正确性.     

Abstract communication model for distributed systems

In some distributed and mobile communication models, a message disappears in one place and miraculously appears in another. In reality, of course, there are no miracles. A message goes from one network to another; it can be lost or corrupted in the process. Here, we present a realistic but high-level communication model where abstract communicators represent various nets and subnets. The model was originally developed in the process of specifying a particular network architecture, namely, the Universal Plug and Play architecture. But, it is general. Our contention is that every message-based distributed system, properly abstracted, gives rise to a specialization of our abstract communication model. The purpose of the abstract communication model is not to design a new kind of network; rather, it is to discover the common part of all message-based communication networks. The generality of the model has been confirmed by its successful reuse for very different distributed architectures. The model is based on distributed abstract state machines. It is implemented in the specification language AsmL and is used for testing distributed systems.     

A Distributed Shared-Memory System on a Workstation Cluster Using Fast Serial Links

In this paper, a fast serial link, Serial Transparent Asynchronous First-in First-out Link (STAFF-Link), is introduced. Using such links, we construct a parallel processing system based on a workstation cluster. The workstation cluster implements a distributed sharedmemory mechanism for inter-process communication using a software controlled cache using a STAFF-Link router board. The board has a chained multicast capability with which we have implemented efficient invalidation protocol based on Eager Release Consistency (ERC) model in the DSM system. Performance results on several application programs from the SPLASH2 benchmark suites have been measured.     

Pandora: An Experiment in Distributed Multimedia

An experimental workstation is described which supports digital video and audio in a distributed environment, and which presents this functionality to the user through the medium of a video-extended implementation of the X Window System. The Pandora Workstation is built out of two quite separate parts. A standard UNIX machine (the Pandora Host) brings standard hardware and software computing resources to the system; a highly-specialised processing engine (Pandora's Box) handles the high-bandwidth, time-critical, and device-dependent processing. A 50 Mbit/second ATM network provides for real-time data communication within the system. Nineteen Pandora Workstations have been deployed within Olivetti Research Ltd and the Cambridge University Computer Laboratory, and are used routinely to run distributed applications including video mail, video conferencing, and real-time media delivery services.     

Prophet: automated scheduling of SPMD programs in workstation networks

Obtaining efficient execution of parallel programs in workstation networks is a difficult problem for the user. Unlike dedicated parallel computer resources, network resources are shared, heterogeneous, vary in availability, and offer communication performance that is still an order of magnitude slower than parallel computer interconnection networks. Prophet, a system that automatically schedules data parallel SPMD programs in workstation networks for the user, has been developed. Prophet uses application and resource information to select the appropriate type and number of workstations, divide the application into component tasks and data across these workstations, and assign tasks to workstations. This system has been integrated into the Mentat parallel processing system developed at the University of Virginia. A suite of scientific Mentat applications has been scheduled using Prophet on a heterogeneous workstation network. The results are promising and demonstrate that scheduling SPMD applications can be automated with good performance. Copyright © 1999 John Wiley & Sons, Ltd.     

Efficient distributed SAT and SAT-based distributed Bounded Model Checking

SAT-based Bounded Model Checking (BMC), though a robust and scalable verification approach, still is computationally intensive, requiring large memory and time. Even with the recent development of improved SAT solvers, the memory limitation of a single server rather than time can become a bottleneck for doing deeper BMC search for large designs. Distributing computing requirements of BMC over a network of workstations can overcome the memory limitation of a single server, albeit at increased communication cost. In this paper, we present (a) a method for distributed SAT over a network of workstations using a Master/Client model where each Client workstation has an exclusive partition of the SAT problem and uses knowledge of partition topology to communicate with other Clients, (b) a method for distributing SAT-based BMC using the distributed SAT. For the sake of scalability, at no point in the BMC computation does a single workstation have all the information. We experimented on a network of heterogeneous workstations interconnected with a standard Ethernet LAN. To illustrate, on an industrial design with ∼13 K FFs and ∼0.5 million gates, the non-distributed BMC on a single workstation (with 4 GB memory) ran out of memory after reaching a depth of 120; on the other hand, our SAT-based distributed BMC over 5 similar workstations was able to go up to 323 steps with a communication overhead of only 30%.     

A concurrent network architecture for cost-efficient parallel computing using workstation clusters

Within the past few years, workstation clusters have gained an increasing importance as platforms for parallel high-performance simulation problems. In contrast to the specialized and cost-intensive interconnection network of distributed memory multiprocessor systems, workstation clusters utilize local area networks (LANs) and common communication protocols. Therefore, the cost-efficiency of workstation clusters for parallel tasks is high while the communication performance is limited compared to parallel computer systems. To improve the communication performance of clusters, new protocols can be applied as well as specialized interconnection networks. On one hand, these solutions decrease the cost-efficiency of clusters, while on the other hand the performance of local area networks is increasing because of new technologies such as FastEthernet, GigaEthernet or ATM. In this contribution, we propose increasing the communication performance of clusters through the concurrent network architecture (CNA) with multi-channel communication systems. Through the use of parallel and independent LANs, the communication performance of a cluster can be improved while maintaining the cost-efficiency of the wide-spread LAN technology and protocols. This paper gives an overview of the CNA, the requirements of an implementation and a performance evaluation of a CNA workstation cluster.     

具有通信延迟的多无人机编队飞行控制

针对固定通信拓扑下的具有时变通信延迟的多无人机(multi-UAVs)系统,在一致性协议的基础上提出了分布式的编队控制算法.利用Lyapunov-Krasovskii函数分析了时延多无人机系统的稳定性,并以线性不等式(LMI)的形式给出了系统稳定的条件.当满足稳定性条件时,编队控制算法将使系统中无人机的速度和编队队形分别渐近地收敛至期望速度和期望队形.仿真实例验证了控制算法的有效性.     

Confidence interval prediction for neural network models

To derive an estimate of a neural network's accuracy as an empirical modeling tool, a method to quantify the confidence intervals of a neural network model of a physical system is desired. In general, a model of a physical system has error associated with its predictions due to the dependence of the physical system's output on uncontrollable or unobservable quantities. A confidence interval can be computed for a neural network model with the assumption of normally distributed error for the neural network. The proposed method accounts for the accuracy of the data with which the neural network model is trained.     

Limitations of Cycle Stealing for Parallel Processing on a Network of Homogeneous Workstations

The low cost and availability of clusters of workstations have lead researchers to re-explore distributed computing using independent workstations. This approach may provide better cost/performance than tightly coupled multiprocessors. In practice, this approach often utilizes wasted cycles to run parallel jobs. In this paper we address the feasibility and limitation of such a nondedicated parallel processing environment assuming workstation processes have priority over parallel tasks. We develop a simple analytical model to predict parallel job response times. Our model provides insight into how significantly workstation owner interference degrades parallel program performance. It forms a foundation for task partitioning and scheduling in a nondedicated network environment. A new term, task ratio, which relates the parallel task demand to the mean service demand of nonparallel workstation processes, is introduced. We propose that task ratio is a useful metric for determining how a parallel applications should be partitioned and scheduled in order to make efficient use of a nondedicated distributed system.     

Productivity prediction of MPI programs based on models

A model of parallel program that can be effectively interpreted on the development computer guaranteeing the possibility of a sufficiently precise prediction of real run time for a simulated parallel program at the prescribed computer system is studied. The model is worked out for parallel programs with explicit message passing written in the Java language with MPI library access and is included into the composition of ParJava environment. The model is obtained by transforming the program control tree that can be constructed for Java programs by modifying the abstract syntax tree. To model communication functions, the model LogGP is used which allows taking into consideration the specific character of the communication network of the distributed computer system.     

轮询通信协议下信息物理系统分布式状态估计

本文关注的是一类信息物理系统的分布式状态估计问题. 由于传感器网络通信带宽有限, 当大量节点同时发送数据时, 可能造成数据冲突. 因此, 通过引入轮询协议减轻传感器网络通信负担, 在该协议下每个节点的测量分量将依次且周期性访问网络. 考虑滤波网络拓扑切换概率矩阵是时变的, 因此采用非齐次Markov链描述随机拓扑切换行为. 证明了估计误差以指数衰减的形式收敛,确保了滤波误差系统在均方意义下最终有界. 进一步地, 通过解决特定拓扑依赖的凸优化问题, 获得期望的分布式滤波器参数. 最后, 通过两个例子证明了所设计的分布式状态估计方法的可行性.     

Project Athena as a distributed computer system

Project Athena, established in 1983 to improve the quality of education at MIT (Massachussetts Institute of Technology) by providing campuswide, high-quality computing based on a large network of workstations, is discussed, focusing on the design of Athena's distributed workstation system. The requirements of the system are outlined distributed system models are reviewed, other distributed operating systems are described, and issues in distributed systems are examined. The distributed-system model for Athena is discussed. Athena has three major components; workstations a network, and servers. The approach taken by the Athena developers was to implement a set of network services to replace equivalent time-sharing services, in essence converting the time-sharing Unix model into a distributed operating system     

Design of dynamically reconfigurable real-time software usingport-based objects

The port-based object is a new software abstraction for designing and implementing dynamically reconfigurable real-time software. It forms the basis of a programming model that uses domain-specific elemental units to provide specific, yet flexible, guidelines to control engineers for creating and integrating software components. We use a port-based object abstraction, based on combining the notion of an object with the port-automaton algebraic model of concurrent processes. It is supported by an implementation using domain-specific communication mechanisms and templates that have been incorporated into the Chimera real-time operating system and applied to several robotic applications. This paper describes the port-based object abstraction, provides a detailed analysis of communication and synchronization based on distributed shared memory, and describes a programming paradigm based on a framework process and code templates for quickly implementing applications     

基于GIS的分布式实时协同制图系统的研究

由于Internet网络带宽限制等诸多方面的影响,基于GIS的分布式实时协同制图系统是较难实现的。采用复制式模型构造了一个基于GIS的分布式实时协同制图系统,并且采用动态数据格式作为各站点的交换数据,极大限度地战少了网络数据传输量,提高了系统的响应速度和稳定性,满足了协同制图系统对实时性的要求。     

基于TinyOS的多跳式传感器网络

针对城市环境大气污染的监测,设计一种基于TinyOS的多跳式传感器网络.该网络采用层次化结构,基于TinyOS操作系统,实现传感器网络的多跳式通信.为对大气污染数据进行分析,将一种分布式k-mean聚类算法应用于该传感器网络的数据挖掘.仿真实验表明,该系统能有效地实现数据的多跳传输和分布式数据挖掘.     

The Vidboard: A video capture and processing peripheral for a distributed multimedia system

This paper describes a network-based video capture and processing peripheral, called the Vidboard, for a distributed multimedia system centered around a 1-Gbit/s asynchronous transfer mode (ATM) network. The Vidboard is capable of generating full-motion video streams having a range of presentation (picture size, color space, etc.) and network (traffic, transport, etc.) characteristics. The board is also capable of decoupling video from the real-time constraints of the television world, which allows easier integration of video into the software environment of computer systems. A suite of ATM-based protocols has been developed for transmitting video from the Vidboard to a workstation, and a series of experiments are presented in which video is transmitted to a workstation for display.     

The synthesis of communication protocols

We define a notation (specification language) for describing desired patterns of communication among components of a distributed system through multiport, unreliable channels. Our language specifies the network topology, and the kinds of information transmission desired. We give a polynomial-time algorithm for determining whether a specification is satisfiable; our algorithm can actually construct a protocol that achieves the specified exchange of information, optimized with respect to two possible criteria. Examples suggest that our method can automatically synthesize reasonably complex protocols.     

基于TinyOS的多跳式传感器网络

针对城市环境大气污染的监测,设计一种基于TinyOS的多跳式传感器网络。该网络采用层次化结构,基于TinyOS操作系统,实现传感器网络的多跳式通信。为对大气污染数据进行分析,将一种分布式k-mean聚类算法应用于该传感器网络的数据挖掘。仿真实验表明,该系统能有效地实现数据的多跳传输和分布式数据挖掘。