共查询到20条相似文献,搜索用时 140 毫秒
1.
插件式应用程序开发以其在软件的分析、设计、开发、维护、更新升级等各个环节的巨大的便利性成为近来十分流行的软件开发技术。该文基于.NET Framework平台设计开发插件应用程序框架,利用程序集实现插件的加载,利用服务注册技术将应用程序框架设计成服务容器,实现插件功能的服务化注册管理,无需实现插件加载与管控所需要的底层技术,极大的简化了插件应用程序的开发及扩展。 相似文献
2.
插件式应用程序开发以其在软件的分析、设计、开发、维护、更新升级等各个环节的巨大的便利性成为近来十分流行的软件开发技术。该文基于.NET Framework平台设计开发插件应用程序框架,利用程序集实现插件的加载,利用服务注册技术将应用程序框架设计成服务容器,实现插件功能的服务化注册管理,无需实现插件加载与管控所需要的底层技术,极大的简化了插件应用程序的开发及扩展。 相似文献
3.
基于插件技术的企业应用集成架构研究 总被引:1,自引:0,他引:1
企业应用集成已经成为实现企业主要战略目标的必需手段和捷径。胜利油田物探研究院在实施企业信息化规划过程中遇到许多实际问题,不同时期实施的企业应用形成一个个信息孤岛,为企业应用集成带来诸多不便。插件式体系结构的灵活性给企业应用集成提供了一种实现途径。插件技术将应用程序分为主程序和插件程序2个部分,两者之间通过接口实现交互,使系统具有较高的可伸缩性。插件机制实现的技术手段之一是OSGi,OSGi规范的核心框架提供了一个通用、安全、可管理的支持以Bundle方式下载并扩展部署的.1ava框架。基于OSGi规范和框架的实现的插件式企业应用集成框架,具有灵活性、松耦合、跨平台、扩展性好等特点,能够很好的适应企业应用集成的需要。 相似文献
4.
企业应用集成已经成为实现企业主要战略目标的必需手段和捷径.胜利油田物探研究院在实施企业信息化规划过程中遇到许多实际问题,不同时期实施的企业应用形成一个个信息孤岛,为企业应用集成带来诸多不便.插件式体系结构的灵活性给企业应用集成提供了一种实现途径.插件技术将应用程序分为主程序和插件程序2个部分,两者之间通过接口实现交互,使系统具有较高的可伸缩性.插件机制实现的技术手段之一是OSGi,OSGi规范的核心框架提供了一个通用、安全、可管理的支持以Bundle方式下载并扩展部署的Java框架.基于OSGi规范和框架的实现的插件式企业应用集成框架,具有灵活性、松耦合、跨平台、扩展性好等特点,能够很好的适应企业应用集成的需要. 相似文献
5.
研究了基于多通道虚拟现实环境的网络通讯模块实现方法,以及复制式网络模型下的应用开发方法,并给出了三维城市地质信息系统的具体应用实例。网络通讯模块采用面向对象(OO)技术对TCP、UDP协议进行封装,以消息形式通过网络传输客户端与服务器端的交互信息。应用程序框架采用虚拟现实插件技术实现功能的即插即用。 相似文献
6.
袁向英 《电脑编程技巧与维护》2014,(2):33-35
在Android应用程序开发过程中,数据库连接技术和插件式开发技术是两个较为关键的技术。前者为Android应用提供数据支撑,后者为Android应用提供功能扩展。着重分析了Android应用程序开发过程中的数据库连接技术和插件式开发技术所遇到的问题及解决方案。 相似文献
7.
浅论插件技术及其C++/VC++实现 总被引:2,自引:0,他引:2
插件技术是一种新兴的技术,鉴于目前插件技术在计算机网络和多媒体中的广泛使用,应用程序可以在运行时调用插件以实现功能扩展。文章探讨了插件技术的基本思想,并利用C++VC++给出了具体的实现方案。 相似文献
8.
用插件式的软件设计方法具有层次化、组件化和容易扩展等特点,可以大幅提高软件的移植性,增强软件的复用度;通过实例展示了插件式软件的开发流程,实现了软件的主体框架和功能插件的设计。 相似文献
9.
10.
11.
We present the free open source plugin execution framework ViennaX for modularizing and parallelizing scientific simulations. In general, functionality is abstracted by the notion of a task, which is implemented as a plugin. The plugin system facilitates the utilization of both, already available functionality as well as new implementations. Each task can define arbitrary data dependencies which are used by ViennaX to build a task graph. The framework supports the execution of this dependence graph based on the message passing interface in either a serial or a parallel fashion. The applied modular approach allows for defining highly flexible simulations, as plugins can be easily exchanged. The framework’s general design as well as implementation details are discussed. Applications based on the Mandelbrot set and the solution of a partial differential equation are investigated, and performance results are shown. 相似文献
12.
Kai Kratzer Joshua T. Berryman Aaron Taudt Johannes Zeman Axel Arnold 《Computer Physics Communications》2014
We present the software package FRESHS (http://www.freshs.org) for parallel simulation of rare events using sampling techniques from the ‘splitting’ family of methods. Initially, Forward Flux Sampling (FFS) and Stochastic Process Rare Event Sampling (SPRES) have been implemented. These two methods together make rare event sampling available for both quasi-static and full non-equilibrium regimes. Our framework provides a plugin system for software implementing the underlying physics of the system of interest. At present, example plugins exist for our framework to steer the popular MD packages GROMACS, LAMMPS and ESPResSo, but due to the simple interface of our plugin system, it is also easy to attach other simulation software or self-written code. Use of our framework does not require recompilation of the simulation program. The modular structure allows the flexible implementation of further sampling methods or physics engines and creates a basis for objective comparison of different sampling algorithms. 相似文献
13.
Grigori Fursin Yuriy Kashnikov Abdul Wahid Memon Zbigniew Chamski Olivier Temam Mircea Namolaru Elad Yom-Tov Bilha Mendelson Ayal Zaks Eric Courtois Francois Bodin Phil Barnard Elton Ashton Edwin Bonilla John Thomson Christopher K. I. Williams Michael O��Boyle 《International journal of parallel programming》2011,39(3):296-327
Tuning compiler optimizations for rapidly evolving hardware makes porting and extending an optimizing compiler for each new platform extremely challenging. Iterative optimization is a popular approach to adapting programs to a new architecture automatically using feedback-directed compilation. However, the large number of evaluations required for each program has prevented iterative compilation from widespread take-up in production compilers. Machine learning has been proposed to tune optimizations across programs systematically but is currently limited to a few transformations, long training phases and critically lacks publicly released, stable tools. Our approach is to develop a modular, extensible, self-tuning optimization infrastructure to automatically learn the best optimizations across multiple programs and architectures based on the correlation between program features, run-time behavior and optimizations. In this paper we describe Milepost GCC, the first publicly-available open-source machine learning-based compiler. It consists of an Interactive Compilation Interface (ICI) and plugins to extract program features and exchange optimization data with the cTuning.org open public repository. It automatically adapts the internal optimization heuristic at function-level granularity to improve execution time, code size and compilation time of a new program on a given architecture. Part of the MILEPOST technology together with low-level ICI-inspired plugin framework is now included in the mainline GCC. We developed machine learning plugins based on probabilistic and transductive approaches to predict good combinations of optimizations. Our preliminary experimental results show that it is possible to automatically reduce the execution time of individual MiBench programs, some by more than a factor of 2, while also improving compilation time and code size. On average we are able to reduce the execution time of the MiBench benchmark suite by 11% for the ARC reconfigurable processor. We also present a realistic multi-objective optimization scenario for Berkeley DB library using Milepost GCC and improve execution time by approximately 17%, while reducing compilation time and code size by 12% and 7% respectively on Intel Xeon processor. 相似文献
14.
15.
本文基于.NET框架及其组件技术,首先提出了一个可定制应用软件编程模型,然后完整设计了一个以复用为目的,支持插件架构的应用框架,最后通过为用户定制插件,以及应用框架对插件的即插即用,实现了应用软件的敏捷定制。 相似文献
16.
17.
18.
19.
Nathaniel Charlton 《Formal Aspects of Computing》2007,19(3):375-399
In this paper we propose and argue for a modular framework for interprocedural program analysis, where multiple program analysis
tools are combined in order to exploit the particular advantages of each. This allows for “plugging together” such tools as
required by each verification task and makes it easy to integrate new analyses. Our framework automates the sharing of information
between plugins using a first order logic with transitive closure, in a way inspired by the open product of Cortesi et al.
We describe a prototype implementation of our framework, which performs static assertion checking on a simple language for
heap-manipulating programs. This implementation includes plugins for three existing approaches—predicate abstraction, 3-valued
shape analysis and a decidable pointer analysis—and for a simple type system. We demonstrate through a detailed example the
increase in precision that our approach can provide. Finally we discuss the design decisions we have taken, in particular
the tradeoffs involved in the choice of language by which the plugins communicate, and identify some future directions for
our work.
R. Lazic, R. Nagarajan and J. C. P. Woodcock 相似文献