950 resultados para Computational grids (Computer systems)


Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP model provides.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

The current trend in the evolution of sensor systems seeks ways to provide more accuracy and resolution, while at the same time decreasing the size and power consumption. The use of Field Programmable Gate Arrays (FPGAs) provides specific reprogrammable hardware technology that can be properly exploited to obtain a reconfigurable sensor system. This adaptation capability enables the implementation of complex applications using the partial reconfigurability at a very low-power consumption. For highly demanding tasks FPGAs have been favored due to the high efficiency provided by their architectural flexibility (parallelism, on-chip memory, etc.), reconfigurability and superb performance in the development of algorithms. FPGAs have improved the performance of sensor systems and have triggered a clear increase in their use in new fields of application. A new generation of smarter, reconfigurable and lower power consumption sensors is being developed in Spain based on FPGAs. In this paper, a review of these developments is presented, describing as well the FPGA technologies employed by the different research groups and providing an overview of future research within this field.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

In this article we present a computational framework for isolating spatial patterns arising in the steady states of reaction-diffusion systems. Such systems have been used to model many different phenomena in areas such as developmental and cancer biology, cell motility and material science. Often one is interested in identifying parameters which will lead to a particular pattern. To attempt to answer this, we compute eigenpairs of the Laplacian on a variety of domains and use linear stability analysis to determine parameter values for the system that will lead to spatially inhomogeneous steady states whose patterns correspond to particular eigenfunctions. This method has previously been used on domains and surfaces where the eigenvalues and eigenfunctions are found analytically in closed form. Our contribution to this methodology is that we numerically compute eigenpairs on arbitrary domains and surfaces. Here we present various examples and demonstrate that mode isolation is straightforward especially for low eigenvalues. Additionally we see that if two or more eigenvalues are in a permissible range then the inhomogeneous steady state can be a linear combination of the respective eigenfunctions. Finally we show an example which suggests that pattern formation is robust on similar surfaces in cases that the surface either has or does not have a boundary.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Mode of access: Internet.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Prepared under contract no. HSM 110-70-406.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

National Highway Traffic Safety Administration, Washington, D.C.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

"Period of performance: September, l968- December, 1973."

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Includes bibliographical references.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

"The results of a research project undertaken by the Department of Industrial Engineering and Administration of the Cornell University College of Engineering under a summer grant [1963] from the New York State Office of Transportation."