This paper tries to add a characteristic of self-adjusting, in the perspective of fault-tolerant QoS, for the Fault-Tolerant Object Management Framework. Then it defines dynamic reconfiguration as the relations of fau...
详细信息
This paper tries to add a characteristic of self-adjusting, in the perspective of fault-tolerant QoS, for the Fault-Tolerant Object Management Framework. Then it defines dynamic reconfiguration as the relations of fault-tolerant properties (or their implementations), descriptions of computing environment changes and dynamic adjusting algorithms. A Dynamic Reconfiguration Management Framework based on Reflection Model and Publish/Subscribe Model is presented, which gives applications strong support on discovering computing environment changes, dynamically customizing adjusting algorithms, and building a foundation for effective dynamic reconfiguration of applications.
This position paper presents arguments for including the properties of processes involved in various approaches to component-based software development in predicting systems properties. It discusses how processes impa...
详细信息
The state-of-art approaches to embedded real-time software development are very costly. The high development cost can be reduced significantly by using model-based Integration of reusable components. To the ABCD (Arch...
详细信息
The feature of partial reconfiguration provided by currently available Field Programmable Gate Arrays (FPGAs) makes it possible to change hardware modules while others keep working. The combination of this feature and...
详细信息
ISBN:
(纸本)0769523129
The feature of partial reconfiguration provided by currently available Field Programmable Gate Arrays (FPGAs) makes it possible to change hardware modules while others keep working. The combination of this feature and the high gate capacity enables the integration of dynamic systems that can be adapted to changing demands during runtime. Placing the dynamically changing modules along a horizontal communication infrastructure does not only provide communication facilities it also enables the relocation of pre-synthesized modules by bitstream manipulations. The exact placement of an incoming module is determined according to the current resource allocation, which results in an online placement problem. In order to prevent any extra configuration overhead for the relocation process, we developed the REPLICA (Relocation per online Configuration Alteration) filter, which is capable of performing the necessary bitstream manipulations during the regular download process. The filter architecture, a Configuration Manager and an evaluation example are presented in this paper.
Today's Field Programmable Gate Arrays (FPGAs) can be reconfigured partially, which makes it possible to share resources between various functional modules (hardware tasks) over time. This concept is well known in...
详细信息
Describing Service-Oriented Architecture （SOA） is critical in the development of Web based system, in this paper, an approach for describing SOA by extended Darwin is proposed. The requirements for describing SOA, w...
详细信息
Describing Service-Oriented Architecture （SOA） is critical in the development of Web based system, in this paper, an approach for describing SOA by extended Darwin is proposed. The requirements for describing SOA, which are different from that of ordinary architecture, are highlighted firstly, and then a solution for extending Darwin is presented. Using the extended Darwin, service components and connectors can be described explicit by the extended construct, as well as precise operational semantics of SOA by the π-calculus. Finally an example of supply-chain management system is given for manifesting the effect of the extended Darwin.
The concept of partial reconfiguration offers the possibility to dynamically place and remove hardware tasks on reconfigurable architectures, like FPGAs. Common placement algorithms, e.g. Best Fit, are designed for ho...
详细信息
The concept of partial reconfiguration offers the possibility to dynamically place and remove hardware tasks on reconfigurable architectures, like FPGAs. Common placement algorithms, e.g. Best Fit, are designed for homogeneous architectures, since they do not consider any placement constraints of the hardware tasks. Due to the integration of, e.g., dedicated memory, current FPGAs are heterogeneous reconfigurable architectures. In this paper we introduce two heterogeneous placement algorithms, which are able to deal with the constraints of the hardware tasks. Both algorithms are compared to the Best Fit algorithm by using a simulation framework for partially configurable architectures. We propose concepts of an efficient hardware realization of our placement approach with Xilinx Virtex-II FPGAs. Moreover, we present a task placement mechanism to change the position of a hardware task on the FPGA by manipulating the configuration data of the task
Testing plays an important role in the maintenance of component based software development. Test adequacy for component testing is one of the hardest issues for component testing. To tackle this problem, it is a natur...
详细信息
Testing plays an important role in the maintenance of component based software development. Test adequacy for component testing is one of the hardest issues for component testing. To tackle this problem, it is a natural idea to apply mutation testing, which is a fault-based testing method used for measuring test adequacy, for component contracts, whose aim is to improve the testability of the component. Though powerful, mutation testing is usually very computation-expensive, as many mutants need to be produced and executed in mutation testing. In this paper, we propose a contract-based mutation technique for testing components. Based on the discordance between contracts and specification, our approach employs a set of high level contract mutation operators. The experimental results show that these operators can greatly reduce the number of mutants compared with traditional mutation operators. At the same time, the contract-based mutation using our contract mutation operators can provide almost the same ability as that of using traditional mutation operators. Moreover, effective test suite can be produced to reduce the maintenance effort.
This paper introduces an orthogonal evolutionary algorithm for dynamic optimization problems with continuous variables (called ODEA). Its population does not consist of individuals, but rather of "niches". E...
详细信息
暂无评论