The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper we present and compare two algorithms to transform and optimize the finite difference time domain (FDTD) method computations in irregular computational areas for multiprocessor systems. Both algorithms are based on a genetic approach with different design of chromosomes. In the first case, a chromosome represents a complete merging algorithm as a sequence of merging functions that are...
A new algorithm for an optimized design of the FDTD (Finite Difference Time Domain) computations involved in simulations of electromagnetic wave propagation in irregular areas is presented in the paper. Computational programs are represented as macro data flow graphs (MDFG) which are to be partitioned and assigned to processors for optimal parallel execution. The proposed hierarchical optimization...
The paper presents a method for optimization of computations involved in solving finite difference time domain (FDTD) problems which enable electromagnetic wave propagation modeling in irregular areas. The method assumes program execution paradigm typical for macro data flow graph (MDFG) program representation. The proposed method enables MDFGs optimization based on three constituent steps. The first...
In this paper, we present and compare two methods for designing and profiling macro data flow graphs, which represent computation and communication patterns for the FDTD (finite difference time domain) problem in irregular computational areas. With the first method, optimized macro data flow graphs (MDFG) for FDTD computations are generated in three main phases: generation of initial MDFG based on...
In this paper, we present methodology, which enables designing and profiling macro data flow graphs that represent computation and communication patterns for the FDTD (finite difference time domain) problem in irregular computational areas. Optimized macro dataflow graphs (MDFG) for FDTD computations are generated in three main phases: generation of initial MDFG based on wave propagation area partitioning,...
In this paper, we present a methodology, which enables designing optimal macro data flow graphs that represent computation and communication patterns for the FDTD problem in irregular computational areas. The macro dataflow graphs are executed in a MIMD system. Communication is implemented with a remote direct memory access facility. To obtain minimal communication overheads, the rotating buffers...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.