基于ADSP21060的并行信号处理系统设计

实时识别目标在现代高科技战争中具有重要军事意义。设计了一个由5片ADSP21060组成的并行处理系统。该系统采用基于环网的数据块处理策略,主DSP将数据分割为长度相等的块,并分配给各从DSP进行处理。以FIR滤波器并行算法为例,验证了本设计在运算速度方面显著优于单DSP系统。该设计可应用到对实时性能要求苛刻的军事领域。     

一种分布式数字海洋云系统研究

海洋数据分布区域广泛且数据量庞大,现有数字海洋系统相对独立,海洋数据信息共享度低,制约了大规模海洋数据的高性能计算。为"数字海洋"系统提供有力的数据支持和计算服务。本文提出一种基于云的分布式数字海洋系统,把不同的海洋数据通过高速网络连接起来建立一个存储云,使用一个专用的网络服务协议,用于高性能广域网络连接的计算机集群所进行的大型分布式数据集的高性能计算。实验结果表明,与现有基于Hadoop分布式数字海洋系统相比,该系统的性能有显著提高、数据高度共享。     

基于区块链的D2D辅助的MEC资源共享架构

随着终端设备智能化发展与设备到设备（D2D）通信技术的逐渐应用,终端设备可以通过直连链路进行资源共享.为提升网络边缘整体服务能力,提出了一种基于区块链的D2D辅助的多接入边缘计算资源共享架构（BD-MEC）.在BD-MEC下,综合考虑时延、能耗和支付开销等因素,设计了一种基于博弈论的多用户卸载方案,以满足不同用户的服务需求.其次,针对拒绝服务或付款等恶意行为,提出了一种基于智能合约的资源共享协议与争议事件处理方法,利用区块链来强制共享双方遵守资源共享协议,以实现安全的资源共享.仿真结果表明,BD-MEC能有效地降低计算任务的时延、能耗和支付开销.     

基于GOS的远程实时可视化系统设计与实现*

提出了一个并行计算程序的远程实时可视化系统.通过实时可视化处理计算程序在计算过程中输出的数据文件,实现了对计算程序计算过程的可视化跟踪和实时分析;同时该系统采用GOS作为网格中间件,屏蔽了复杂的异构环境.     

基于生物启发计算的警用流动人口分析系统

目前对流动人口的管理仅停留在数据查询比对和简单统计上,缺少对数据的深层次分析,难以对决策指挥提供支持。针对流动人口的分析问题,提出了构建一个基于生物启发计算的智能分析系统,用于发现流动人口中各类人员的流动模式以及流动人口的趋势性问题,找出异常的流动信息和模式。该系统综合运用了前沿的生物启发计算技术——基于多层染色体基因表达式编程算法、重叠基因表达进化算法、基于概念相似度神经网络分类模型和层次距离计算的聚类算法搭建了一个警用流动人口的分析平台。同时根据实际需求,提出了一种新的基于智能分析结果的分级报警模型。实验表明系统具有较高的性能和实用性。     

基于区块链的分布式光伏就地消纳交易模式研究

目前配电网中分布式光伏发电渗透率越来越高,利用区块链技术的去中心化、难篡改等特点,有助于分布式发电就地或就近消纳,提高配电网运行的经济性。提出了一种基于区块链的光伏就地消纳交易模式,建立了光伏发电用户和分布式光伏聚合商的效益函数,运用Stackelberg博弈模型确定内部电价,通过边缘计算制定最优用电计划,设计了基于信誉值的就地消纳交易机制,对就地消纳程度低的用户进行惩罚,鼓励用户通过可时移负荷消纳光伏出力。配电网仿真结果表明,在采用区块链的交易模式下,配电网的就地消纳情况得到改善,用户的综合效益得到提升。     

引汉济渭工程运行调度综合服务平台的应用实践

针对引汉济渭工程运行调度的实际需求和特点,基于云计算技术,采用面向服务的体系结构(SOA)和JAVA EE平台技术架构,研发了基于云服务架构的引汉济渭工程运行调度综合服务平台,建立了基于平台、组件、知识图及可视化工具灵活搭建的引汉济渭工程运行调度业务应用系统构建模式,形成基于平台、基于组件、基于主题、基于可视化的应用模式,解决了传统的工程运行调度系统应用性差、功能单一、可扩展性差及应用模式单一等问题。通过平台提供工程运行调度业务服务,为工程联合调度提供技术支撑。     

Janus II: A new generation application-driven computer for spin-system simulations

This paper describes the architecture, the development and the implementation of Janus II, a new generation application-driven number cruncher optimized for Monte Carlo simulations of spin systems (mainly spin glasses). This domain of computational physics is a recognized grand challenge of high-performance computing: the resources necessary to study in detail theoretical models that can make contact with experimental data are by far beyond those available using commodity computer systems. On the other hand, several specific features of the associated algorithms suggest that unconventional computer architectures–that can be implemented with available electronics technologies–may lead to order of magnitude increases in performance, reducing to acceptable values on human scales the time needed to carry out simulation campaigns that would take centuries on commercially available machines. Janus II is one such machine, recently developed and commissioned, that builds upon and improves on the successful JANUS machine, which has been used for physics since 2008 and is still in operation today. This paper describes in detail the motivations behind the project, the computational requirements, the architecture and the implementation of this new machine and compares its expected performances with those of currently available commercial systems.     

CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm: 2D and 3D Ising,Potts, and XY models

We present sample CUDA programs for the GPU computing of the Swendsen–Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the q$q$-state Potts model, and the classical XY model. As for the lattice, both the 2D (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the GPU implementation for 2D models (Komura and Okabe, 2012). We here explain the details of sample programs, and discuss the performance of the present GPU implementation for the 3D Ising and XY models. We also show the calculated results of the moment ratio for these models, and discuss phase transitions.     

Fast finite difference Poisson solvers on heterogeneous architectures

In this paper we propose and evaluate a set of new strategies for the solution of three dimensional separable elliptic problems on CPU–GPU platforms. The numerical solution of the system of linear equations arising when discretizing those operators often represents the most time consuming part of larger simulation codes tackling a variety of physical situations. Incompressible fluid flows, electromagnetic problems, heat transfer and solid mechanic simulations are just a few examples of application areas that require efficient solution strategies for this class of problems. GPU computing has emerged as an attractive alternative to conventional CPUs for many scientific applications. High speedups over CPU implementations have been reported and this trend is expected to continue in the future with improved programming support and tighter CPU–GPU integration. These speedups by no means imply that CPU performance is no longer critical. The conventional CPU-control–GPU-compute pattern used in many applications wastes much of CPU’s computational power. Our proposed parallel implementation of a classical cyclic reduction algorithm to tackle the large linear systems arising from the discretized form of the elliptic problem at hand, schedules computing on both the GPU and the CPUs in a cooperative way. The experimental result demonstrates the effectiveness of this approach.