基于S3C44B0X的 VxWorks BSP设计

S3C44B0X固定的中断管理模式与VxWorks的异常处理机制存在着冲突。本文分析VxWorks的异常处理机制后,提出一种解决方案,实现VxWorks在S3C44B0X上的BSP定制。该方案保留VxWorks原有的中断处理机制,从而保证VxWorks移植后的稳定性和可靠性。     

WinCE系统下BootLoader的开发

介绍WinCE.NET系统的定制方法;说明板级支持包(BSP)的基本构成;从开发实例出发,详细阐述如何开发BSP中的重要部件——BootLoader。     

AVS熵解码与DSP实现

阐述了AVS标准的进展情况及AVS标准的特点,重点介绍了AVS熵解码的原理和采用Equator公司MAP-CABSP-15处理器中的协处理器(Vlx)实现AVS熵解码的方法.     

基于PXA255的Windows CE5.0 BSP移植

本文以嵌入式多媒体信息终端为硬件平台,Windows CE5.0为操作系统,Platform Builder 5.0为开发环境,实现了Windows CE.NET 4.2下基于PXA255的BSP在Windows CE 5.0下的移植,并深入分析了Windows CE的BSPSP构,对BSP移植的各种可能性进行了比较.     

基于BSP的并行程序设计

BSP模型是独立于并行体系结构,即可作为并行计算模型又可作为并行程序设计模型。利用该模型进行并行程序设计简单、方便,而且可移植性强,可在多种并行系统上实现。     

A BSP Recursive Divide and Conquer Algorithm to Compute the Inverse of a Tridiagonal Matrix

In this paper we discuss a recursive divide and conquer algorithm to compute the inverse of an unreduced tridiagonal matrix. It is based on the recursive application of the Sherman–Morrison formula to a diagonally dominant tridiagonal matrix to avoid numerical stability problems. A theoretical study of the computational cost of this method is developed, comparing it with the experimental times measured on an IBM SP2 using switch and Ethernet hardware for communications between processors. Experimental results are presented for two and four processors. Finally, the method is compared with a divide and conquer method for solving tridiagonal linear systems.     

Achieving Scalable Parallel Molecular Dynamics Using Dynamic Spatial Domain Decomposition Techniques

To achieve scalable parallel performance in molecular dynamics simulations, we have modeled and implemented several dynamic spatial domain decomposition algorithms. The modeling is based upon the bulk synchronous parallel architecture model (BSP), which describes supersteps of computation, communication, and synchronization. Using this model, we have developed prototypes that explore the differing costs of several spatial decomposition algorithms and then use this data to drive implementation of our molecular dynamics simulator,Sigma. The parallel implementation is not bound to the limitations of the BSP model, allowing us to extend the spatial decomposition algorithm. For an initial decomposition, we use one of the successful decomposition strategies from the BSP study and then subsequently use performance data to adjust the decomposition, dynamically improving the load balance. The motivating reason to use historical performance data is that the computation to predict a better decomposition increases in cost with the quality of prediction, while the measurement of past work often has hardware support, requiring only a slight amount of work to modify the decomposition for future simulation steps. In this paper, we present our adaptive spatial decomposition algorithms, the results of modeling them with the BSP, the enhanced spatial decomposition algorithm, and its performance results on computers available locally and at the national supercomputer centers.     

基于阶段并行模型的算法设计研究

NOWs正成为并行计算领域的一个新的发展热点,以太网构成的微机集群系统是NOWs的一种重要实现形式。阶段并行模型是BSP模型的改进,它更接近于表述实际的机器行为,同时具有编程简单、独立于体系结构和执行性能可预测等特点。文章研究了群集系统中阶段并行模型上的并行算法设计,以FFT算法为例,进行了设计和分析,并给出了测试结果。     

基于Vxworks操作系统的BSP开发

本文基于Vxworks操作系统讲述了板级支持包BSP的概念并分析了Vxworks的启动过程,重点介绍了BSP的设计与开发过程。     

嵌入式操作系统的通用硬件抽象层设计

基于嵌入式操作系统硬件抽象层理论,设计一种用于嵌入式操作系统内核开发的通用硬件抽象层平台。通用硬件抽象层能够为嵌入式操作系统内核的设计开发屏蔽硬件平台的特性,提供统一的硬件相关的服务接口,可以使嵌入式操作系统内核的设计开发不依赖于特定的硬件平台,同时开发的嵌入式操作系统内核具有更强的可移植性。