Analyzing the performance of a cluster-based architecture for immersive visualization systems

Cluster computing has become an essential issue for designing immersive visualization systems. This paradigm employs scalable clusters of commodity computers with much lower costs than would be possible with the high-end, shared memory computers that have been traditionally used for virtual reality purposes. This change in the design of virtual reality systems has caused some development environments oriented toward shared memory computing to require modifications to their internal architectures in order to support cluster computing. This is the case of VR Juggler, which is considered one of the most important virtual reality application development frameworks based on open source code.     

Algorithm-system scalability of heterogeneous computing

Scalability is a key factor of the design of distributed systems and parallel algorithms and machines. However, conventional scalabilities are designed for homogeneous parallel processing. There is no suitable and commonly accepted definition of scalability metric for heterogeneous systems. Isospeed scalability is a well-defined metric for homogeneous computing. This study extends the isospeed scalability metric to general heterogeneous computing systems. The proposed isospeed-efficiency model is suitable for both homogeneous and heterogeneous computing. Through theoretical analyses, we derive methodologies of scalability measurement and prediction for heterogeneous systems. Experimental results have verified the analytical results and confirmed that the proposed isospeed-efficiency scalability works well in both homogeneous and heterogeneous environments.     

Performance Evaluation of a Multi-Zone Application in Different OpenMP Approaches

We describe a performance study of a multi-zone application benchmark implemented in several OpenMP approaches that exploit multi-level parallelism and deal with unbalanced workload. The multi-zone application was derived from the well-known NAS Parallel Benchmarks (NPB) suite that involves flow solvers on collections of loosely coupled discretization meshes. Parallel versions of this application have been developed using the Subteam concept and Workqueuing model as extensions to the current OpenMP. We examine the performance impact of these extensions to OpenMP and compare with hybrid and nested OpenMP approaches on several large parallel systems.     

A constant-time dynamic storage allocator for real-time systems

Dynamic memory allocation has been used for decades. However, it has seldom been used in real-time systems since the worst case of spatial and temporal requirements for allocation and deallocation operations is either unbounded or bounded but with a very large bound. In this paper, a new allocator called TLSF (Two Level Segregated Fit) is presented. TLSF is designed and implemented to accommodate real-time constraints. The proposed allocator exhibits time-bounded behaviour, O(1), and maintains a very good execution time. This paper describes in detail the data structures and functions provided by TLSF. We also compare TLSF with a representative set of allocators regarding their temporal cost and fragmentation. Although the paper is mainly focused on timing analysis, a brief study and comparative analysis of fragmentation incurred by the allocators has been also included in order to provide a global view of the behaviour of the allocators. The temporal and spatial results showed that TLSF is also a fast allocator and produces a fragmentation close to that caused by the best existing allocators.

Choosing knowledge management strategies by using a combined ANP and DEMATEL approach

Numerous companies are expecting their knowledge management (KM) to be performed effectively in order to leverage and transform the knowledge into competitive advantages. However, here raises a critical issue of how companies can better evaluate and select a favorable KM strategy prior to a successful KM implementation. The KM strategy selection is a kind of multiple criteria decision-making (MCDM) problem, which requires considering a large number of complex factors as multiple evaluation criteria. A robust MCDM method should consider the interactions among criteria. The analytic network process (ANP) is a relatively new MCDM method which can deal with all kinds of interactions systematically. Moreover, the Decision Making Trial and Evaluation Laboratory (DEMATEL) not only can convert the relations between cause and effect of criteria into a visual structural model, but also can be used as a way to handle the inner dependences within a set of criteria. Hence, this paper proposes an effective solution based on a combined ANP and DEMATEL approach to help companies that need to evaluate and select KM strategies. Additionally, an empirical study is presented to illustrate the application of the proposed method.     

DPVoD:基于P2P的视频点播体系结构

可扩展性和可靠性是视频点播系统大规模应用的关键,提出了一种P2P点播系统结构DPVoD.系统基于应用层组播,用户以订制的缓存为其他节点提供服务,并形成相对独立的共享并发流组播树,组播树之问根据拥有的视频数据的重合程度而建立不同的组邻居关系,以此为基础,采用多种机制来提高系统性能:组协同工作、父亲点选择策略、状态控制协议和失效恢复等.定义并分析了可能对系统性能有严重影响的结尾雪崩问题并提出解决方案.对系统基本性能进行了理论分析.仿真结果表明,在静态和动态环境中,DPVoD系统的并发流占用数和利用率、可靠性等性能均优于类似系统.     

面向安全管理的定量安全评估模型

提出面向安全管理的系统安全评估模型贝叶斯功能网络,采用风险分析方法建立反映安全功能和威胁关系的贝叶斯信念网络,可以对功能组件缺失程度及其对系统安全的影响进行量化评估。实验表明,模型不仅可用于系统的安全评估比较,而且能够指出系统存在的缺陷以便优化和改进。     

基于PDM的FRACAS平台研究

协同产品研制模式对故障报告、分析和纠正措施系统(FRACAS)提出了异构信息管理、分布式闭环控制和多级安全管理的新需求。该文构建基于产品数据管理(PDM)的FRACAS平台体系结构,论述该系统的实现方法,包括基于PDM的系统开发技术以及配置技术,并建立了原型系统。     

直流配电盒的可靠性设计与分析

直流配电盒作为配电系统的核心,要求具有较高的可靠性。该文对基于CAN/LIN总线直流配电盒系统的容错设计和具体实现方案进行论述。通过运用马尔可夫随机过程理论和拉普拉斯变换工具,对直流配电盒的失效-修复这一随机过程进行可靠性分析,确定各个部件以及整个系统的可用度、可靠度和平均无故障工作时间。在可靠性分析的基础上,采用Matlab/Simulink对直流配电盒进行仿真,能够比较准确地反映暂态过程中直流配电盒系统的动态特性,直观地体现系统的性能。     

基于UDDI扩展的Web服务QoS模型

在现有UDDI规范中增设QoS认证组件,提出一个Web服务QoS评估模型。定义一组描述Web服务QoS属性分类的tModel,在引入QoS量化概念的基础上,结合QoS认证中心主动监视和服务消费者QoS反馈机制,对UDDI中注册的Web服务QoS进行动态评估和调整,保证了Web服务QoS信息的公平性、可信性和实时性。