Neural growing networks as a model of an intelligent multimicroprocessor system with a neuron-ensemble structure

Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 43–62, May–June, 1994.     

The control of an astronomical telescope using a multimicroprocessor system

This paper describes a novel application of a multimicroprocessor system which is specifically suited to many low-cost real-time applications. The system described was developed to control an astronomical telescope. It is based on a twin microprocessor configuration, the two microprocessors being organized in master/slave roles. The master microprocessor deals with input/output and numerical functions while the slave drives the stepping motors. Communication between the two is achieved through interleaving access to common memory.The design requirements of the astronomical telescope are introduced with emphasis on the specific requirements of the astronomers. A brief summary of alternative pulse generation systems is presented. Hardware and software design details of the telescope system are then discussed. The paper concludes with several suggestions for further applications of multimicroprocessor systems.     

A procedure for multimicroprocessor system testing during development

A little investigation would show clear advantages of more than one processor for many applications. From the other side, difficulties exist in prototype testing during design and development. This article describes a test strategy useful in multimicroprocessor system testing, using only one in-circuit emulator, together with test programs, which are described in detail.     

操作系统灵活内核技术

在可扩展操作系统研究中存在两种途径,但这两种途径都存在明显的缺陷.在对这些问题研究的基础上,提出了灵活内核技术,它改变以往可扩展操作系统的研究思路,不仅仅支持通过系统扩展软件对系统进行扩展,而且允许动态配置扩展软件的运行位置,从而使得系统在获得了更强扩展特性的同时,在其它一些性能方面也得到了改善.进一步讨论了灵活内核技术实现的一般性问题,并以Elastos操作系统为例进行了说明.     

实时操作系统内存分配性能检测

主要提出了一种检测实时操作系统内存分配性能的方法，利用概率统计的方法随机产生内存碎片，检测实时操作系统在不同条件下内存分配性能的变化，并采用符合正态分布的随机数产生内存碎片，对嵌入式操作系统VxWorks的内存分配性能进行检测，最后结合实际数据分析了VxWorks的内存分配性能符合实时操作系统的要求，同时验证了该检测方法的可行性和可信性。     

A survey of operating system support for persistent memory

Emerging persistent memory technologies, like PCM and 3D XPoint, offer numerous advantages, such as higher density, larger capacity, and better energy efficiency, compared with the DRAM. However, they also have some drawbacks, e.g., slower access speed, limited write endurance, and unbalanced read/write latency. Persistent memory technologies provide both great opportunities and challenges for operating systems. As a result, a large number of solutions have been proposed. With the increasing number and complexity of problems and approaches, we believe this is the right moment to investigate and analyze these works systematically.To this end, we perform a comprehensive and in-depth study on operating system support for persistent memory within three steps. First, we present an overview of how to build the operating system on persistent memory from three perspectives: system abstraction, crash consistency, and system reliability. Then, we classify the existing research works into three categories: storage stack, memory manager, and OS-bypassing library. For each category, we summarize the major research topics and discuss these topics deeply. Specifically, we present the challenges and opportunities in each topic, describe the contributions and limitations of proposed approaches, and compare these solutions in different dimensions. Finally, we also envision the future operating system based on this study.     

A dynamic associative memory system by adopting an amygdala model

Although several kinds of computational associative memory models and emotion models have been proposed since the last century, the interaction between memory and emotion is almost always neglected in these conventional models. This study constructs a dynamic memory system, named the amygdala-hippocampus model, which intends to realize dynamic auto-association and the mutual association of time-series patterns more naturally by adopting an emotional factor, i.e., the functional model of the amygdala given by Morén and Balkenius. The output of the amygdala is designed to control the recollection state of multiple chaotic neural networks (MCNN) in CA3 of the hippocampus-neocortex model proposed in our early work. The efficiency of the proposed association system is verified by computer simulation using several benchmark time-series patterns. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

基于VxWorks操作系统的自动内存泄漏检测机制

针对当前VxWorks操作系统中内存泄漏检测机制的不足,通过设置内存泄漏门限值和内存驻留时间门限值,并利用中断服务程序及其唤醒的检测任务实现自动内存泄漏检测机制,可满足不同用户环境对内存泄漏检测实时性、便捷性、可靠性的要求。     

Priority queuing in an operating system

The analysis of a preemptive priority queuing system with K(⩾2) classes of jobs is undertaken. The system consists of a single processor representing a model of discrete dynamic scheduling problems associated with M_k/G_k/1/∞ endogenous priority queues. The processor schedules jobs which arrive according to a Markov arrival process. The process of service is arbitrary. With each job are associated particular endogenous dynamic priorities, called scheduling by “mean bounded priorities with arrival pattern” (MBPAP). The main goal is, for the case of an arrival pattern of jobs, to present an original scheduling strategy, to derive the waiting time w_k(t) and to discuss the implementation of the priorities. This queuing system is investigated.     

基于Java的数据通信综合网管共享存储

动态实时告警数据和静态系统资源数据的存取是影响数据通信综合网管系统性能的主要因素,针对这两类数据各自不同的特点,重点讨论两种基于Java共享存储设计与实现,系统整体性能得以提升．     

Petri网的水产品溯源系统模型

提出了一种基于射频识别(RFID)的Petri网在水产品全程质量追踪和溯源系统应用的方法,以构建高效的基于物联网技术的水产品溯源与安全预警平台.根据实际水产品业务流和信息流,利用Petri网进行建模,然后在CPN Tools环境进行仿真.仿真结果表明:该建模方法简单、可行,能够验证工作流模型的有效性,而且便于计算机形式化表达和优化分析,有利于工作流管理系统的实现和性能提高,一定程度上提高了供应链的效率,从而降低了流通的成本和质量风险.     

操作系统内核的动态可信度量模型

动态可信度量是可信计算的研究热点和难点,针对由操作系统内核动态性所引起的可信度量困难问题,提出一种操作系统内核的动态可信度量模型,使用动态度量变量描述和构建系统动态数据对象及其关系,对内核内存进行实时数据采集,采用语义约束描述内核动态数据的动态完整性,通过语义约束检查验证内核动态数据是否维持其动态完整性。给出了模型的动态度量性质分析与证明,模型能够有效地对操作系统内核的动态数据进行可信度量,识别对内核动态数据的非法篡改。     

Performance considerations for an operating system transactionmanager

Results of a previous comparison study (A. Kumar and M. Stonebraker, 1987) between a conventional transaction manager and an operating system (OS) transaction manager indicated that the OS transaction manager incurs a severe performance penalty and appears to be feasible only in special circumstances. Three approaches for enhancing the performance of an OS transaction manager are considered. The first strategy is to improve performance by reducing the cost of lock acquisition and by compressing the log. The second strategy explores the possibility of still further improvements from additional semantics to be built into an OS transaction system. The last strategy is to use a modified index structure that makes update operations less expensive to perform. The results show that the OS will have to implement essentially all of the specialized tactics for transaction management that are currently used by a database management system (DBMS) in order to match DBMS performance     

Evolving an operating system for the Web

Considering the drive to standardize operating system technology and the frantic pace of innovative application development on the Internet and World Wide Web, what is left for OS developers to do? The paper discusses some of the basic functions of operating systems and considers the development of a Web-oriented OS     

Algorithmic programming language for multimicroprocessor systems with bus architecture

Translated from Kibernetika, No. 4, pp. 66–70, July–August, 1988.     

基于轻量操作系统的虚拟机内省与内存安全监测

针对在传统特权虚拟机中利用虚拟机内省实时监测其他虚拟机内存安全的方法不利于安全模块与系统其他部分的隔离,且会拖慢虚拟平台的整体性能的问题,提出基于轻量操作系统实现虚拟机内省的安全架构,并提出基于内存完整性度量的内存安全监测方案。通过在轻量客户机中实现内存实时检测与度量,减小了安全模块的可攻击面,降低了对虚拟平台整体性能的影响。通过无干涉的内存度量和自定义的虚拟平台授权策略增强了安全模块的隔离性。基于Xen中的小型操作系统Mini-OS实现了虚拟机内省与内存检测系统原型,评估表明该方案比在特权虚拟机中实现的同等功能减少了92%以上的性能损耗,有效提高了虚拟机内省与实时度量的效率。     

A model of a virtual memory system

Summary We present a queueing network model of a virtual memory computer system including the effect of memory sharing among processes. Page fault and file request system overheads are explicitly taken into account. The fact that some memory pages have to be saved in the secondary memory at the moment of a page fault, is also taken into consideration. We obtain an approximate solution using an equivalence and decomposition approach. The effect of system and program behavior parameters (primary memory size, drum and disk characteristics, program locality, input-output rates and different pages ratios) as well as that of the total number of processes, are examined for two different system organizations. In the first one, all the processes share real core; in the second, processes having issued a file request lose their memory space until the I/O is performed.