Dynamically reconfigurable resource-aware component framework: architecture and concepts

Applications executed on a shared distributed platform compete for resources provided by the platform. In case these applications have highly fluctuating resource demands, a software architecture is required that provides support for runtime resource management. In position paper [1], we have proposed such architecture and have introduced its key concepts and entities. In this paper, we introduce a metamodel that captures the key concepts and we identify lifecycle models for both applications and individual components. A set of dynamic reconfiguration strategies is introduced and their relationship to the stages of the application lifecycle is given. Keywords: Component framework – networked services – resource management – dynamic reconfiguration – application lifecycle – component lifecycl

Membrane-based design and management methodology for parallel dynamically reconfigurable embedded systems

International audiencePartial and dynamic reconfiguration provides a relevant new dimension to design efficient parallel embedded systems. However, due to the encasing complexity of such systems, ensuring the consistency and parallelism management at runtime is still a key challenge. So architecture models and design methodology are required to allow for efficient component reuse and hardware reconfiguration management.This paper presents a distributed persistence management model and its implementation for reconfigurable multiprocessor systems on dynamically reconfigurable circuits. The proposed approach is inspired from the well-known component based models used in software applications development. Our model is based on membranes wrapping the systems components. The objective is to improve design productivity and ensure consistency by managing context switching and storage using modular distributed hardware controllers. These membranes are distributed and optimized with the aim to design self-adaptive systems by allowing dynamic changes in parallelism degree and contexts migration. Simulation and synthesis results are given to show performances and effectiveness of our methodology

A quasi-static cluster-computing approach for dynamic channelassignment in cellular mobile communication systems

Efficient management of the radio spectrum can be accomplished by making use of channel assignment techniques, which work by allocating different channels of the spectrum to the cells of the network in a conflict-free manner (i.e., the co-channel interference is minimized). The problem of dynamically reallocating the channels in response to change in user location patterns, which occurs frequently for a microcell network architecture, is even more difficult to tackle in a timely manner. Most existing approaches use various sequential search-based heuristics which cannot produce high-quality allocation fast enough to cope with the frequent traffic requirement variations. In this paper, we propose a quasi-static approach which combines the merits of both static and dynamic schemes. The static component of our approach uses a parallel genetic algorithm to generate a suite of representative assignments based on a set of different estimated traffic scenarios. At on-line time, the dynamic component observes the actual traffic requirement and retrieves the representative assignment of the closest scenario from the off-line table. The retrieved assignment is then quickly refined by using a fast parallel local search algorithm. Our extensive simulation experiments have indicated that the proposed quasi-static system outperforms other dynamic channel assignment techniques significantly in terms of both blocking probabilities and computational overhead.published_or_final_versio