网格环境中的资源发现问题

本文主要研究了网格资源发现的几个问题,从表述资源发现问题,资源和请求的表示、匹配的确定及可测量性问题的解决等方面做了分析和探讨.     

数据并行应用的基于伪机群的网格资源选择

为给数据并行应用选择适合的网格资源,文章给出一个伪机群的想法。非专用机群中的主机可根据资源性能偏差率构造出若干伪机群,使同一个伪机群中的资源性能彼此相近。专用机群也可被视为伪机群,故对于任何类型的应用,伪机群思想使网格资源彼此有了可比性。实验表明,拥有最高整体性能的伪机群将使应用取得最短的运行时间。     

网格环境中的资源监测

为了构建和执行网格应用,就必须了解网格资源的类型和可用性。该文提出了一个专门为网格设计的开放和通用的资源监测结构,并描述了这个资源监测结构中的资源监测系统的实现。     

基于资源路由器的网格资源管理系统

论述了实现网格资源管理系统所涉及到的各方面问题。论述的是一种基于资源路由器的网格资源管理系统。介绍了网格资源管理系统的组成及各组成部件的作用及网格资源管理中的3个关键技术,包括资源管理信息库管理、资源描述信息库管理、资源服务的接口设计。     

一种双目立体视觉算法的GPU实现

利用可编程图形硬件GPU实现了非参数局域变换双目立体视觉算法。该算法使用局部非参数统计的结果而不是像素灰度值作为匹配代价，相对于其它基于区域的立体匹配算法，具有物体边界区域处理稳定和适于硬件实现等优点。该文利用GPU的最新特性实现了算法的全部运算都在GPU上执行。由于GPU的并行流水特性，算法在GPU上的运算速度较在CPU上得到提高。     

GPU parameter tuning for tall and skinny dense linear least squares problems

ABSTRACT

Linear least squares problems (LLSPs) routinely arise in many scientific and engineering problems. One of the fastest ways to solve LLSPs involves performing calculations in parallel on graphics processing units (GPUs). However, GPU algorithms are typically designed for one GPU architecture and may be suboptimal or unusable on another GPU. To design optimal algorithms for any GPU with little need for modifying code, tuneable parameters can simplify the transition of GPU algorithms to different GPU architectures. In this paper, we investigate the benefits of using derivative-free optimization (DFO) and simulation optimization (SO) to systematically optimize tuneable parameters for a GPU or hybrid CPU/GPU LLSP solvers. Computational experiments show that both DFO and SO can be effective tools for determining optimal tuning parameters that can speed up the performance of the popular LLSP solver MAGMA by about 1.8x, compared to MAGMA's default parameters for large tall and skinny matrices. Using DFO solvers, we were able to identify optimal parameters after enumerating an order of magnitude fewer parameter combinations than with direct enumeration. Additionally, the proposed approach is faster than a state-of-the-art autotuner and provides better tuning parameters.     

面向SoC设计的网格PSE资源管理器与原型实现

集成电路技术的发展始终存在着两个主要矛盾：集成电路工艺加工能力的快速增长与设计生产力的矛盾,集成电路复杂度增加与设计时间紧缩的矛盾。文章从网格技术的角度,把SoC设计过程中不同的设计资源,包括IP核、EDA设计工具软件、代码、设计专家信息等,通过统一的资源管理机制实现对各种设计资源的管理,解决SoC设计对资源共享和协同的需要,提高SoC设计的整体效率。同时介绍了面向SoC设计网格问题求解环境下资源管理器的原型实现。     

Trust Brokering and Its Use for Resource Matchmaking in Public-Resource Grids

This paper presents a trust brokering system that operates in a peer-to-peer manner. The network of trust brokers operate by providing peer reviews in the form of recommendations regarding potential resource targets. One of the distinguishing features of our work is that it separately models the accuracy and honesty concepts. By separately modeling these concepts, our model is able to significantly improve the performance. We apply the trust brokering system to a resource manager to illustrate its utility in a public-resource Grid environment. The simulations performed to evaluate the trust-aware resource matchmaking strategies indicate that high levels of ‘robustness’ can be attained by considering trust while matchmaking and allocating resources.Dr Azzedin contributed towards the work in this paper while he was at University of Manitoba, Winnipeg, Canada.     

数字资源库系统存储层的设计与研究

本文主要从笔者所参与建设的UNIRES数字资源库系统入手,分析了数字资源库的分层结构设计,并对存储层的逻辑组织结构和系统架构设计进行了着重的分析。最后本文针对海量的数字资源存储分别从时间和空间两个角度提出了相应的优化策略。     

面向项目群管理的资源网格化封装机理研究

针对传统的项目管理中存在的问题及不足,例如难以满足跨组织的制造资源共享、互操作、临时服务等,本文提出了一种基于网格技术的新方法,将项目群的管理与制造网格有机结合起来,以实现对项目群的实施和执行过程进行有效的实时的管理和监控。在此基础上提出了具体实现框架和应用实例,从而通过资源的网格化封装和配置,实现高效的项目管理和监控。     

网格共享目录的动态监测

针对物理资源的动态变化,设计了一个共享目录监测模型。该模型在每个网格结点驻留一个进程,用来主动地监视网格结点的可用性和物理共享目录的内容变化,及时刷新文件信息的逻辑映射。     

空间信息网格的多级资源管理结构模型

在分析和比较各种资源管理模型的基础上,分析了空间信息资源的特点,提出了一种较为有效的SIG资源管理模型——基于市场的多级资源管理模型。描述了该资源管理模型的体系结构,讨论了如何有效地维护空间信息网格资源的异构性及可扩展性,同时保证资源利用的最大效益。     

一种多用户OFDM系统的资源调度算法

正交频分复用(OFDM)系统中,资源调度是影响整个网络性能的关键问题,而现有的静态资源调度算法和动态资源调度算法不能很好地兼顾系统吞吐量以及用户公平性两发面的性能.在分析现有算法的性能特点的基础上,基于比例公平准则,提出了一种多用户OFDM系统下行链路中的动态调度算法,并进行了数值仿真.仿真结果表明,在基站发射功率及用户吞吐量公平分配的约束下,系统吞吐量性能较好.且算法在用户吞吐量公平性上有所提高,复杂度较低.     

网格计算环境下资源联合分配的映射策略与机制

提出用于网格环境的资源协同调度框架及网格环境下多任务的资源映射策略,用图论中有向无环图解决资源调度过程中任务的优先级限制问题,并在有向无环图上构造兼容图,通过寻找图中最大独立任务集的方法,解决多任务对多资源请求的资源共享问题。给出了网格计算环境下动态资源联合分配的资源管理机制。     

An effective and robust two-phase resource allocation scheme for interdependent tasks in mobile ad hoc computational Grids

This paper addresses the problem of resource allocation to interdependent tasks in mobile ad hoc computational Grids. Dependencies between tasks imply that there can be heavy communication induced by data transfers between tasks executed on separate nodes. The communication in mobile ad hoc Grids is always expensive and unreliable, and therefore plays a critical role in application performance. There are several factors that contribute to communication cost. Unreliable and short-term connectivity can increase communication cost due to frequent failure and activation of links, and ineffective resource allocation can increase communication cost due to multi hop communication between dependent tasks. To reduce communication cost, an effective and robust resource allocation scheme is required. However, the design of such a scheme for mobile ad hoc computational Grids exhibits numerous difficulties due to the constrained communication environment, node mobility, and lack of pre-existing network infrastructure.     

一种铅笔滤镜生成算法及其在GPU上的实现

提出了一种基于卷积算子的铅笔滤镜生成算法,通过分析真实铅笔纹理的结构特征,抽象出铅笔笔画的简单数学模型.根据该模型可以方便地确定其对应的笔刷模板(卷积算子),进而获得用户所需要的铅笔纹理.本文将该算法与图形处理单元(GPu)相结合,借助于GPU的硬件加速功能成功地实现了对视频图像的实时铅笔画风格绘制.     

Octree-based, GPU implementation of a continuous cellular automaton for the simulation of complex, evolving surfaces

Presently, dynamic surface-based models are required to contain increasingly larger numbers of points and to propagate them over longer time periods. For large numbers of surface points, the octree data structure can be used as a balance between low memory occupation and relatively rapid access to the stored data. For evolution rules that depend on neighborhood states, extended simulation periods can be obtained by using simplified atomistic propagation models, such as the Cellular Automata (CA). This method, however, has an intrinsic parallel updating nature and the corresponding simulations are highly inefficient when performed on classical Central Processing Units (CPUs), which are designed for the sequential execution of tasks. In this paper, a series of guidelines is presented for the efficient adaptation of octree-based, CA simulations of complex, evolving surfaces into massively parallel computing hardware. A Graphics Processing Unit (GPU) is used as a cost-efficient example of the parallel architectures. For the actual simulations, we consider the surface propagation during anisotropic wet chemical etching of silicon as a computationally challenging process with a wide-spread use in microengineering applications. A continuous CA model that is intrinsically parallel in nature is used for the time evolution. Our study strongly indicates that parallel computations of dynamically evolving surfaces simulated using CA methods are significantly benefited by the incorporation of octrees as support data structures, substantially decreasing the overall computational time and memory usage.     

基于资源聚集的计算网格备份资源选择算法

资源备份是提高计算网格应用可用性的重要方法．如何为应用选择备份资源是网格资源备份服务要解决的首要问题．文章提出了基于资源聚集的备份资源选择算法．该算法将为应用分配的资源按照资源之间的关系聚集成多个资源集合,然后根据应用的可用性需求为每个资源集合选择备份资源,每个资源集合中的资源共享同一组备份资源．这一算法适用于计算网格,可以在资源备份服务模块中实现．最后,给出了该算法的应用实例．     

一种基于GOR+GPU算法的机器人视觉导航方法

提出一种一般物体识别(GOR)方法.借鉴词袋(BOW)的统计模型,利用SIFT(尺度不变特征变换)检测算子进行特征向量描述.为了增加信息的冗余度,利用物体部件空间关系的统计信息来描述一幅图片中所有特征点的空间(相对距离和角度)关系,增广了原BOW模型中的特征向量.运用无监督判别分类器支持向量机(SVM)来实现分类识别.与此同时,采用GPU加速技术来实现SIFT特征提取与描述,以保证其实时性.然后,存手绘地图辅助导航的基础上,将该方法成功地应用到室内移动机器人导航上.实验结果表明,基于该方法的机器人导航技术具有较强的鲁棒性和有效性.