Adaptive algorithms are increasingly acknowledged in leading parallel and distributed research. In the past, algorithms were manually tuned to be executed efficiently on a particular architecture. However, interest ha...
ISBN:
(纸本)9783540241287
Adaptive algorithms are increasingly acknowledged in leading parallel and distributed research. In the past, algorithms were manually tuned to be executed efficiently on a particular architecture. However, interest has shifted towards algorithms that can adapt themselves to the computational resources. A cost model representing the behavior of the system (i.e. system parameters) and the algorithm (i.e algorithm parameters) plays an important role in adaptive parallel algorithms. In this paper, we contribute a computational model based on Bulk Synchronous Parallel processing that predicts performance of a parallelized split-step Fourier transform. We extracted the system parameters of a cluster (upon which our algorithm was executed) and showed the use of an algorithmic parameter in the model that exhibits optimal behavior. Our model can thus be used for the purpose of self-adaption.
Adaptive algorithms are increasingly acknowledged in leading parallel and distributed research. In the past, algorithms were manually tuned to be executed efficiently on a particular architecture. However, interest ha...
详细信息
The emergence of the computational Grid and the potential for seamless aggregation, integration and interactions has made it possible to conceive a new generation of realistic, scientific and engineering simulations o...
详细信息
In this paper we present the structure of the simulator which would allow diving beginners to experience the effect of buoyancy control mechanisms before actually entering the *** believe such training would be less s...
详细信息
The emergence of the computational Grid and the potential for seamless aggregation, integration and interactions has made it possible to conceive a new generation of realistic, scientific and engineering simulations o...
详细信息
The emergence of the computational Grid and the potential for seamless aggregation, integration and interactions has made it possible to conceive a new generation of realistic, scientific and engineering simulations of complex physical phenomena. The inherently heterogeneous and dynamic nature of these application and the Grid presents significant runtime management challenges. In this paper we extend the PRAGMA framework to enable self adapting, self optimizing runtime management of dynamically adaptive applications. Specifically, we present the design, prototype implementation and initial evaluation of policies and mechanisms that enable PRAGMA to autonomically manage, adapt and optimize structured adaptive mesh refinement applications (SAMR) based on current system and application state and predictive models for system behavior and application performance. We use the 3-D adaptive Richtmyer-Meshkov compressible fluid dynamics application and Beowulf clusters at Rutgers University, University of Arizona, and NERSC to develop our performance models, and define and evaluate our adaptation policies. In our prototype, the predictive performance models capture computational and communicational loads and, along with current system state, adjust processors capacities at runtime to enable the application to adapt and optimize its performance.
This paper presents an overview of Pragma, an adaptive runtime infrastructure capable of reactively and proactively managing and optimizing application execution using current system and application state, predictive ...
Service Robotics today requires developing a variety of robotic payload systems all installable on a common mobile robotic base. Kiss-lab (Labor fur Kiinstli-che Intelligenz, Graphische Datenverarbeitung und Sys~ tems...
详细信息
In this paper we address the decomposition problem of electromyographic signals (EMG) and we present a new idea for the decomposition approach introducing the time-scale phase representation. Considering the nature of...
详细信息
In this paper we address the decomposition problem of electromyographic signals (EMG) and we present a new idea for the decomposition approach introducing the time-scale phase representation. Considering the nature of EMG signals, a special set of nonorthogonal conjugated basis functions is used to perform the time-scale analysis. Mapping the modified signal phase into the time-scale phase plane is applied. Its minimization leads towards a very good time localization of individual superimposed signal components.
暂无评论