Relevant bibliographies by topics / Computational grids

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Computational grids'

Author: Grafiati
Published: 4 June 2021
Last updated: 6 September 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Computational grids.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Computational grids"

1

Fox, F., and D. Gannon. "Computational grids." Computing in Science & Engineering 3, no. 4 (2001): 74–77. http://dx.doi.org/10.1109/5992.931906.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

MacKinnon, Bryan. "Commercial computational grids." Ubiquity 2003, May (May 2003): 1. http://dx.doi.org/10.1145/782792.782793.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pardhanani, Anand, and Graham F. Carey. "Optimization of computational grids." Numerical Methods for Partial Differential Equations 4, no. 2 (1988): 95–117. http://dx.doi.org/10.1002/num.1690040202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Nikitina, A. V., A. E. Chistyakov, and A. M. Atayan. "NUMERICAL IMPLEMENTATION OF A PARALLEL ALGORITHM FOR SOLVING THE PROBLEM OF POLLUTANT TRANSPORT IN A RESERVOIR ON A HIGH-PERFORMANCE COMPUTER SYSTEM." Vestnik komp'iuternykh i informatsionnykh tekhnologii, no. 202 (April 2021): 27–36. http://dx.doi.org/10.14489/vkit.2021.04.pp.027-036.

Full text
Abstract:
The purpose of this work is to create a software package for a distributed solution of the problem of transporting a pollutant in a reservoir with complex bathymetry and the presence of technological structures. An algorithm has been developed for the parallel solution of the problem of transporting a pollutant (pollutant) in a reservoir on a graphics accelerator controlled by the CUDA (Compute Unified Device Architecture) system; a comparative analysis of the operation of algorithms on a CPU (Central Processing Unit) and on a graphics accelerator GPU (Graphics Processing Unit) made it possible to evaluate their performance. The software implementation of the modules included in the complex is described, the main classes and implemented methods are documented. The results of numerical experiments showed that solving of pollutant transport’s problem based on the CUDA technology is ineffective for small grids (up to 100 ´ 100 computational nodes). In the case of large grids (1000 ´ 1000 computational nodes), the use of CUDA technology reduces the computation time by an order of magnitude. An analysis of the experiments carried out with the developed components of software showed that the maximum value of the ratio of the algorithm operating time that implements the set task of transferring matter in a shallow water on a GPU to the operating time of a similar algorithm on the CPU was 24.92 times, which is achieved on a grid of 1000 ´ 1000 computational nodes. Implementation of methods for decomposition of grid regions is proposed for solving computationally laborious problems of diffusion-convection, including the problem of transporting pollutants in a reservoir with complex bathymetry with technological objects that take into account the architecture and parameters of a MSC (Multiprocessor Computing System) located on the basis of the infrastructure facility of the STU (Scientific and Technological University) “Sirius” (Sochi, Russia). Consideration was made for such a property of a computing system as the time it takes to transmit and receive floating point data. An algorithm for the parallel solution of the task under the control of MPI (Message Passing Interface) technology has been developed, and its efficiency has been assessed. The acceleration values of the proposed algorithm are obtained depending on the number of involved computers (processors) and the size of the computational grid. The maximum number of computers used is 24, the maximum size of the computational grid was 10 000 ´ 10 000 computational nodes. The developed algorithm showed low efficiency for small computational grids (up to 100 ´ 100 computational nodes). In the case of large computational grids ( from 1000  1000 computational nodes), the use of MPI reduces the computation time by several times.
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Wensheng, and Hui Zheng. "A multiscale method for wave propagation in 3D heterogeneous poroelastic media." GEOPHYSICS 84, no. 4 (July 1, 2019): T237—T257. http://dx.doi.org/10.1190/geo2018-0482.1.

Full text
Abstract:
A new multiscale method for wave simulation in 3D heterogeneous poroelastic media is developed. Wave propagation in inhomogeneous media involves many different scales of media. The physical parameters in the real media usually vary greatly within a very small scale. For the direct numerical methods for wave simulation, a refined grid is required in mesh generation to maintain the match between the mesh size and the material variations in the spatial scale. This greatly increases the computational cost and computer memory requirements. The multiscale method can overcome this difficulty due to the scale difference. The basic idea of our multiscale method is to construct computational schemes on two sets of meshes, i.e., coarse grids and fine grids. The finite-volume method is applied on the coarse grids, whereas the multiscale basis functions are computed with the finite-element method by solving a local problem on the fine grids. Moreover, the local problem only needs to be solved once before time stepping. This allows us to use a coarse grid while still capturing the information of the physical property variations in the small scale. Therefore, it has better accuracy than the single-scale method when they use the same coarse grids. The theoretical method and the dispersion analysis are investigated. Numerical computations with the perfectly matched layer boundary conditions are completed for 3D inhomogeneous poroelastic models with randomly distributed small scatterers. The results indicate that our multiscale method can effectively simulate wave propagation in 3D heterogeneous poroelastic media with a significant reduction in computation cost.
APA, Harvard, Vancouver, ISO, and other styles
6

Yadav, Monika. "Energy Conservation In Computational Grids." International Journal of Grid Computing & Applications 3, no. 2 (June 30, 2012): 13–18. http://dx.doi.org/10.5121/ijgca.2012.3202.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jie, Wei, Tianyi Zang, Terence Hung, Stephen J. Turner, and Wentong Cai. "Information Management for Computational Grids." International Journal of Web Services Research 2, no. 3 (July 2005): 69–82. http://dx.doi.org/10.4018/jwsr.2005070103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Weller, Hilary, John Thuburn, and Colin J. Cotter. "Computational Modes and Grid Imprinting on Five Quasi-Uniform Spherical C Grids." Monthly Weather Review 140, no. 8 (August 1, 2012): 2734–55. http://dx.doi.org/10.1175/mwr-d-11-00193.1.

Full text
Abstract:
Abstract Currently, most operational forecasting models use latitude–longitude grids, whose convergence of meridians toward the poles limits parallel scaling. Quasi-uniform grids might avoid this limitation. Thuburn et al. and Ringler et al. have developed a method for arbitrarily structured, orthogonal C grids called TRiSK, which has many of the desirable properties of the C grid on latitude–longitude grids but which works on a variety of quasi-uniform grids. Here, five quasi-uniform, orthogonal grids of the sphere are investigated using TRiSK to solve the shallow-water equations. Some of the advantages and disadvantages of the hexagonal and triangular icosahedra, a “Voronoi-ized” cubed sphere, a Voronoi-ized skipped latitude–longitude grid, and a grid of kites in comparison to a full latitude–longitude grid are demonstrated. It is shown that the hexagonal icosahedron gives the most accurate results (for least computational cost). All of the grids suffer from spurious computational modes; this is especially true of the kite grid, despite it having exactly twice as many velocity degrees of freedom as height degrees of freedom. However, the computational modes are easiest to control on the hexagonal icosahedron since they consist of vorticity oscillations on the dual grid that can be controlled using a diffusive advection scheme for potential vorticity.
APA, Harvard, Vancouver, ISO, and other styles
9

Chetty, M., and R. Buyya. "Weaving computational grids: how analogous are they with electrical grids?" Computing in Science & Engineering 4, no. 4 (July 2002): 61–71. http://dx.doi.org/10.1109/mcise.2002.1014981.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Carcaillet, Richard, Stephen R. Kennon, and George S. Dulikravich. "Optimization of three-dimensional computational grids." Journal of Aircraft 23, no. 5 (May 1986): 415–21. http://dx.doi.org/10.2514/3.45323.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Computational grids"

1

Lu, Kai. "Decentralized load balancing in heterogeneous computational grids." Thesis, The University of Sydney, 2007. http://hdl.handle.net/2123/9382.

Full text
Abstract:
With the rapid development of high-speed wide-area networks and powerful yet low-cost computational resources, grid computing has emerged as an attractive computing paradigm. The space limitations of conventional distributed systems can thus be overcome, to fully exploit the resources of under-utilised computing resources in every region around the world for distributed jobs. Workload and resource management are key grid services at the service level of grid software infrastructure, where issues of load balancing represent a common concern for most grid infrastructure developers. Although these are established research areas in parallel and distributed computing, grid computing environments present a number of new challenges, including large-scale computing resources, heterogeneous computing power, the autonomy of organisations hosting the resources, uneven job-arrival pattern among grid sites, considerable job transfer costs, and considerable communication overhead involved in capturing the load information of sites. This dissertation focuses on designing solutions for load balancing in computational grids that can cater for the unique characteristics of grid computing environments. To explore the solution space, we conducted a survey for load balancing solutions, which enabled discussion and comparison of existing approaches, and the delimiting and exploration of the apportion of solution space. A system model was developed to study the load-balancing problems in computational grid environments. In particular, we developed three decentralised algorithms for job dispatching and load balancing—using only partial information: the desirability-aware load balancing algorithm (DA), the performance-driven desirability-aware load-balancing algorithm (P-DA), and the performance-driven region-based load-balancing algorithm (P-RB). All three are scalable, dynamic, decentralised and sender-initiated. We conducted extensive simulation studies to analyse the performance of our load-balancing algorithms. Simulation results showed that the algorithms significantly outperform preexisting decentralised algorithms that are relevant to this research.
APA, Harvard, Vancouver, ISO, and other styles
2

Al, Zain Abdallah Deeb I. "Implementing high-level parallelism on computational GRIDs." Thesis, Heriot-Watt University, 2006. http://hdl.handle.net/10399/203.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gomoluch, Jacek Martin. "Market protocols for computational clusters and grids." Thesis, City University London, 2004. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.407554.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

ARAUJO, ALETEIA PATRICIA FAVACHO DE. "AUTONOMIC PARALELIZATION OF METAHEURISTICS IN COMPUTATIONAL GRIDS." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2008. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=12077@1.

Full text
Abstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
O desenvolvimento de metaheurísticas paralelas autonômicas para serem executadas eficientemente em ambientes de grid é o objetivo desta tese. A aplicação paralela deve ser capaz de se auto-adaptar às mudanças que ocorrem dinamicamente no ambiente, sem que o usuário precise interferir diretamente no código da mesma. Para isso, a metaheurística autonômica deve ser vista como uma aplicação com dois níveis independentes: middleware e estratégia. O middleware é responsável por gerenciar todo o ambiente de execução, de acordo com as características da aplicação. A estratégia hierárquica distribuída permite a cooperação entre todos os processos envolvidos, sem degradar o desempenho da aplicação devido ao aumento da comunicação entre processos. Para validar esta proposta foram desenvolvidas duas implementações paralelas de metaheurísticas, uma para o problema do torneio com viagens espelhado e a outra para o problema da árvore geradora de custo mínimo com restrição de diâmetro. Para ambos os problemas, as implementações desenvolvidas foram testadas no ambiente grid Sinergia, formado por máquinas localizadas em três diferentes cidades do Estado do Rio de Janeiro. As parelizações foram capazes de melhorar, para várias instâncias, os melhores resultados conhecidos na literatura.
The development of autonomic parallel metaheuristics to be efficiently executed in computational grid is the challenge of this thesis. The parallel application must be able to self-adjust to the changes that occur dynamically in the environment, without the user needing to interfere directly in the code of the application. For this, the autonomic metaheuristic should be seen as an application on two independent levels: middleware and strategy. The middleware is responsible for managing the entire execution environment, according to the characteristics of the application. The distributed hierarchical strategy enables the cooperation between all processes involved, without degrading the performance of the application due to increased communication between processes. To validate this proposal, two parallel implementations of metaheuristics were developed, one for the mirrored traveling tournament problem and the other for the diameter constrained minimum spanning tree problem. For both problems, the developed implementations were tested in the grid Synergy environment, formed by machines located in three different cities in the state of Rio de Janeiro. The paralelizations improved, for several instances, the best known results in the literature.
APA, Harvard, Vancouver, ISO, and other styles
5

Davy, Simon Mark. "Decentralised economic resource allocation for computational grids." Thesis, University of Leeds, 2008. http://etheses.whiterose.ac.uk/1369/.

Full text
Abstract:
Grid computing is the concept of harnessing the power of many computational resources in a transparent manner. It is currently an active research area, with significant challenges due to the scale and level of heterogeneity involved. One of the key challenges in implementing grid systems is resource allocation. Currently, centralised approaches are employed that have limited scalability and reliability, which is a key factor in achieving a usable grid system. The field of economics is the study of allocating scarce resources using economic mechanisms. Such systems can be highly scalable, robust and adaptive and as such are a potential solution to the grid allocation problem. There is also a natural fit of the economic allocation metaphor to grid systems, given the diversity of autonomy of grid resources. We propose that an economic system is a suitable mechanism for grid resource allocation. We propose a simple market mechanism to explore this idea. Our system is a fully decentralised economic allocation scheme, which aims to achieve a high degree of scalability and reliability, and easily allows resources to retain their autonomy. We implement a simulation of a grid system to analyse this system, and explore its performance and scalability, with a comparison to existing systems. We use a network to facilitate communication between participating agents, and we pay particular attention to the topology of the network between participating agents, examining the effects of different topologies on the performance of the system.
APA, Harvard, Vancouver, ISO, and other styles
6

JAGANNATHAN, SUDHARSUN. "A Methodology for assembling overset Generalized Grids." MSSTATE, 2004. http://sun.library.msstate.edu/ETD-db/theses/available/etd-04062004-210109/.

Full text
Abstract:
The first step in the assembly of an overset grid system is to cut holes or to mark points that are inside a solid body and outside the domain of interest. Most existing approaches have been developed for use only with structured grids. A fast and robust approach that can be applied to structured, unstructured, or generalized grid topologies, with a minimum of user inputs, is desired. A new hole cutting process is presented that utilizes a Cartesian Binary tree representation of the geometry to provide a fast and efficient algorithm applicable to generalized grids. An algorithm has also been developed to mark the fringe points and find its donors. The effectiveness of the algorithm is demonstrated by testing it on generalized and structured grids.
APA, Harvard, Vancouver, ISO, and other styles
7

Berten, Vandy. "Stochastic approach to Brokering heuristics for computational grids." Doctoral thesis, Universite Libre de Bruxelles, 2007. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/210707.

Full text
Abstract:
Computational Grids are large infrastructures composed of several components such as clusters, or massively parallel machines, generally spread across a country or the world, linked together through some network such as Internet, and allowing a transparent access to any resource. Grids have become unavoidable for a large part of the scientific community requiring computational power such as high-energy physics, bioinformatics or earth observation. Large projects are emerging, often at an international level, but even if Grids are on the way of being efficient and user-friendly systems, computer scientists and engineers still have a huge amount of work to do in order to improve their efficiency. Amongst a large number of problems to solve or to improve upon, the problem of scheduling the work and balancing the load is of first importance.

This work concentrates on the way the work is dispatched on such systems, and mainly on how the first level of scheduling – generally name brokering, or meta-sheduling – is performed. We deeply analyze the behavior of popular strategies, compare their efficiency, and propose a new very efficient brokering policy providing notable performances, attested by the large number of simulations we performed and provided in the document.

The work is mainly split in two parts. After introducing the mathematical framework on which the following of the manuscript is based, we study systems where the grid brokering is done without any feed-back information, i.e. without knowing the current state of the clusters when the resource broker – the grid component receiving jobs from clients and performing the brokering – makes its decision. We show here how a computational grid behaves if the brokering is done is such a way that each cluster receives a quantity of work proportional to its computational capacity.

The second part of this work is rather independent from the first one, and consists in the presentation of a brokering strategy, based on Whittle's indices, trying to minimize as much as possible the average sojourn time of jobs. We show how efficient the proposed strategy is for computational grids, compared to the ones popular in production systems. We also show its robustness to several parameter changes, and provide several very efficient algorithms allowing to make the required computations for this index policy. We finally extend our model in several directions.


Doctorat en sciences, Spécialisation Informatique
info:eu-repo/semantics/nonPublished

APA, Harvard, Vancouver, ISO, and other styles
8

Phinjaroenphan, Panu, and s2118294@student rmit edu au. "An Efficient, Practical, Portable Mapping Technique on Computational Grids." RMIT University. Computer Science and Information Technology, 2007. http://adt.lib.rmit.edu.au/adt/public/adt-VIT20080516.145808.

Full text
Abstract:
Grid computing provides a powerful, virtual parallel system known as a computational Grid on which users can run parallel applications to solve problems quickly. However, users must be careful to allocate tasks to nodes properly because improper allocation of only one task could result in lengthy executions of applications, or even worse, applications could crash. This allocation problem is called the mapping problem, and an entity that tackles this problem is called a mapper. In this thesis, we aim to develop an efficient, practical, portable mapper. To study the mapping problem, researchers often make unrealistic assumptions such as that nodes of Grids are always reliable, that execution times of tasks assigned to nodes are known a priori, or that detailed information of parallel applications is always known. As a result, the practicality and portability of mappers developed in such conditions are uncertain. Our review of related work suggested that a more efficient tool is required to study this problem; therefore, we developed GMap, a simulator researchers/developers can use to develop practical, portable mappers. The fact that nodes are not always reliable leads to the development of an algorithm for predicting the reliability of nodes and a predictor for identifying reliable nodes of Grids. Experimental results showed that the predictor reduced the chance of failures in executions of applications by half. The facts that execution times of tasks assigned to nodes are not known a priori and that detailed information of parallel applications is not alw ays known, lead to the evaluation of five nearest-neighbour (nn) execution time estimators: k-nn smoothing, k-nn, adaptive k-nn, one-nn, and adaptive one-nn. Experimental results showed that adaptive k-nn was the most efficient one. We also implemented the predictor and the estimator in GMap. Using GMap, we could reliably compare the efficiency of six mapping algorithms: Min-min, Max-min, Genetic Algorithms, Simulated Annealing, Tabu Search, and Quick-quality Map, with none of the preceding unrealistic assumptions. Experimental results showed that Quick-quality Map was the most efficient one. As a result of these findings, we achieved our goal in developing an efficient, practical, portable mapper.
APA, Harvard, Vancouver, ISO, and other styles
9

Mohammadi, Javad. "Distributed Computational Methods for Energy Management in Smart Grids." Research Showcase @ CMU, 2016. http://repository.cmu.edu/dissertations/710.

Full text
Abstract:
It is expected that the grid of the future differs from the current system by the increased integration of distributed generation, distributed storage, demand response, power electronics, and communications and sensing technologies. The consequence is that the physical structure of the system becomes significantly more distributed. The existing centralized control structure is not suitable any more to operate such a highly distributed system. This thesis is dedicated to providing a promising solution to a class of energy management problems in power systems with a high penetration of distributed resources. This class includes optimal dispatch problems such as optimal power flow, security constrained optimal dispatch, optimal power flow control and coordinated plug-in electric vehicles charging. Our fully distributed algorithm not only handles the computational complexity of the problem, but also provides a more practical solution for these problems in the emerging smart grid environment. This distributed framework is based on iteratively solving in a distributed fashion the first order optimality conditions associated with the optimization formulations. A multi-agent viewpoint of the power system is adopted, in which at each iteration, every network agent updates a few local variables through simple computations, and exchanges information with neighboring agents. Our proposed distributed solution is based on the consensus+innovations framework, in which the consensus term enforces agreement among agents while the innovations updates ensure that local constraints are satisfied.
APA, Harvard, Vancouver, ISO, and other styles
10

Tantar, Alexandru-Adrian. "Hybrid parallel metaheuristics for molecular docking on computational grids." Thesis, Lille 1, 2009. http://www.theses.fr/2009LIL10166.

Full text
Abstract:
Cette thèse porte sur les méta-heuristiques hiérarchiques parallèles adaptatives pour l'échantillonnage conformationnel. Étant un problème hautement combinatoire et multlmodal, l'échantillonnage conformationnel requière la construction d'approches hybrides à large échelle. Après une analyse dei modèles mathématiques, nécessitant l'examen des différentes formulations du champ de force, nous avons proposé une étude des opérateurs de variation et des méthodes de recherche locale adaptés au problème ainsi que leur hybridation dynamique et adaptative. Cette étude nous a conduit à la proposition de mécanismes d'adaptation des paramètres des algorithmes utilisés en fonction du processus d'évolution. Dans cette thèse, nous proposons également des algorithmes adaptatifs hybndes hiérarchiques distribués, fortement extensibles. L'expérimentation, basée sur l'utilisation de multiples modèles parallèles, démontre la grande efficacité de ces algorithmes. En effet, les résultats obtenus montrent que des RMSD moyens en dessous de 1.0 A peuvent être obtenus sur des instances difficiles des problèmes de prédiction de la structure des protéines et de docking moléculaire. La validation des approches hybrides proposées a été effectuée sur Grid'5000, une grille expérimentale d'échelle nationale composée d'environ 5000 coeurs de calcul. Une image système a été développée en utilisant Globus pour permettre des déploiements distribués à large échelle. L'approche hiérarchique distribuée construite a été ainsi déployée sur plusieurs grappes, avec près de 1000 coeurs de calcul
The thesis proposes an extensive analysis of adaptive hierarchical parallel metaheuristics for ab initio conformational sampling. Standing as an NP, combinatorial, highly multi-modal optimization problem, conformational sampling requires for high-performance large scale hybrid approaches to be constructed. Following an incremental definition, minimum complexity conformational sampling mathematical models are first analyzed, entailing a review of different force field formulations. A comprehensive analysis is conducted on a large set of operators and local search algorithms including adaptive and dynamic mechanisms. As determined by the analysis outcomes, complex a priori and online parameter tuning stages are designed. finally, highly scalable hierarchical hybrid distributed algorithm designs are proposed. Experimentation is carried over multiple parallelization models with afferent cooperation topologies. Expenmentations resulted in unprecedented results to be obtained. Multiple perfect conformational matches have been determined, on highly difficult protein structure prediction and molecular docking benchmarks, with RMSD average values below 1.0A. The validation of the proposed hybrid approaehes was performed on Grid'5000, a French computational grid, with almost 5000 computational cores. A Globus Toolkit hased Grid'SOOO system image has been developed, sustaining large scale distributed deployments. The constructed hierarchical hybrid distributed algorithm has been deployed on multiple clusters, with almost 1000 computing cores. Finally, a parallel AutoDock version was developed using the ParadisEO framework, integrating the developed algorithms
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Computational grids"

1

Fainchtein, Rosalinda de. A user's guide to AMR1D: An instructional adaptive mesh refinement code for unstructured grids. Washington, D.C: Goddard Space Flight Center, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abarbanel, Saul. Multi-dimensional asymptotically stable 4th-order accurate schemes for the diffusion equation. Hampton, Va: Langley Research Center, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Venkatakrishnan, V. A perspective on unstructured grid flow solvers. Hampton, Va: Institute for Computer Applications in Science and Engineering, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rock, S. G. A three-dimensional thermo-chemical nonequilibrium chimera flow solver for moving grids, Part I: Steady state. Washington: American Institute of Aeronautics and Astronautics, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Nicolaides, R. A. Covolume solutions of three dimensional div-curl equations. Hampton, Va: Institute for Computer Applications in Science and Engineering, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mavriplis, Dimitri J. Unstructured mesh algorithms for aerodynamic calculations. Hampton, Va: Institute for Computer Applications in Science and Engineering, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Hall, Daniel James. Three-dimensional elliptic grid generation. [Downsview, Ont.]: Dept. of Aerospace Science and Engineering, University of Toronto, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Mavriplis, Dimitri J. Unstructured mesh generation and adaptivity. Hampton, Va: Institute for Computer Applications in Science and Engineering, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Boris, Diskin, Melson N. Duane, and Langley Research Center, eds. Plane smoothers for multiblock grids: Computational aspects. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Boris, Diskin, Melson N. Duane, and Langley Research Center, eds. Plane smoothers for multiblock grids: Computational aspects. Hampton, Va: National Aeronautics and Space Administration, Langley Research Center, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Computational grids"

1

Foster, Ian, and Carl Kesselman. "Computational Grids." In Vector and Parallel Processing — VECPAR 2000, 3–37. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44942-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ziegler, Wolfgang. "Computational Grids." In Studies in Big Data, 247–76. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08411-9_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Anderson, J. D. "Transformations and Grids." In Computational Fluid Dynamics, 105–25. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-540-85056-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Anderson, J. D. "Transformations and Grids." In Computational Fluid Dynamics, 101–22. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/978-3-662-11350-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Maliska, Clovis R. "Unstructured Grids." In Fundamentals of Computational Fluid Dynamics, 333–86. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-18235-8_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Foster, Ian. "High-Performance Computational Grids." In High Performance Computing Systems and Applications, 17–18. Boston, MA: Springer US, 1998. http://dx.doi.org/10.1007/978-1-4615-5611-4_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Carey, G. F., J. Schmidt, and M. Sharma. "Adaptive Grids for Semiconductor Modelling." In Computational Electronics, 37–41. Boston, MA: Springer US, 1991. http://dx.doi.org/10.1007/978-1-4757-2124-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kiss, Tamas, Alexandru Tudose, Gabor Terstyanszky, Peter Kacsuk, and Gergely Sipos. "Utilizing Heterogeneous Data Sources in Computational Grid Workflows." In Making Grids Work, 225–36. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-78448-9_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Sander, Oliver. "Grids and the Dune Grid Interface." In Lecture Notes in Computational Science and Engineering, 91–194. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-59702-3_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Baraglia, R., G. Capannini, M. Pasquali, D. Puppin, L. Ricci, and A. D. Techiouba. "Backfilling Strategies for Scheduling Streams of Jobs On Computational Farms." In Making Grids Work, 103–15. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-78448-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Computational grids"

1

Lu, Dong, and Peter A. Dinda. "Synthesizing Realistic Computational Grids." In the 2003 ACM/IEEE conference. New York, New York, USA: ACM Press, 2003. http://dx.doi.org/10.1145/1048935.1050167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

CARCAILLET, R. "Optimization of three-dimensional computational grids and generationof flow adaptive computational grids." In 24th Aerospace Sciences Meeting. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1986. http://dx.doi.org/10.2514/6.1986-156.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Pasiliao, Eduardo. "Target Tracking on Computational Grids." In 47th AIAA Aerospace Sciences Meeting including The New Horizons Forum and Aerospace Exposition. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2009. http://dx.doi.org/10.2514/6.2009-1634.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Schulter, Alexandre, Kleber Vieira, Carlos Westphall, Carla Westphall, and Sekkaki Abderrahim. "Intrusion Detection for Computational Grids." In 2008 New Technologies, Mobility and Security (NTMS). IEEE, 2008. http://dx.doi.org/10.1109/ntms.2008.ecp.54.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wanschoor, R., and E. Aubanel. "Mesh partitioning for computational grids." In Proceedings. Second Annual Conference on Communication Networks and Services Research, 2004. IEEE, 2004. http://dx.doi.org/10.1109/dnsr.2004.1344745.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Bagnasco, Andrea, Arianna Poggi, and Anna Marina Scapolla. "Computational GRIDs and Online Laboratories." In 1st International ELeGI Conference on Advanced Technology for Enhanced Learning. BCS Learning & Development, 2005. http://dx.doi.org/10.14236/ewic/el2005.22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Rousculp, C. L. "Computational MHD on Lagrangian Grids." In DENSE Z-PINCHES: 5th International Conference on Dense Z-Pinches. AIP, 2002. http://dx.doi.org/10.1063/1.1531353.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kang, Woochul, and Andrew Grimshaw. "Failure Prediction in Computational Grids." In 40th Annual Simulation Symposium (ANSS'07). IEEE, 2007. http://dx.doi.org/10.1109/anss.2007.21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Mazaheri, Ali, and Bil Kleb. "Exploring Hypersonic, Unstructured-Grid Issues through Structured Grids." In 18th AIAA Computational Fluid Dynamics Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2007. http://dx.doi.org/10.2514/6.2007-4462.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Chan, William, and Pieter Buning. "Zipper grids for force and moment computation on overset grids." In 12th Computational Fluid Dynamics Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1995. http://dx.doi.org/10.2514/6.1995-1681.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Computational grids"

1

Tran, C. V. Wide-Area, Heterogeneous, Distributed Computing: Toward Computational Grids. Fort Belvoir, VA: Defense Technical Information Center, December 1998. http://dx.doi.org/10.21236/ada358636.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gatsonis, Nikolaos A. A Hierarchical Multiscale Particle Computational Method for Simulation of Nanoscale Flows on 3D Unstructured Grids. Fort Belvoir, VA: Defense Technical Information Center, August 2009. http://dx.doi.org/10.21236/ada505291.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Jablonowski, Christiane. Introducing Enabling Computational Tools to the Climate Sciences: Multi-Resolution Climate Modeling with Adaptive Cubed-Sphere Grids. Office of Scientific and Technical Information (OSTI), July 2015. http://dx.doi.org/10.2172/1195406.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Venkata, Ramana G., Joseph Oliger, and Joel Ferziger. 3D Composite Grids for Flow Computations: the Grid Generation. Fort Belvoir, VA: Defense Technical Information Center, May 1991. http://dx.doi.org/10.21236/ada252105.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Rene, Schubert. Computing the Meridional Overturning Circulation from NEMO Output. GEOMAR, November 2021. http://dx.doi.org/10.3289/sw_3_2021.

Full text
Abstract:
With this script, the Meridional Overturning Circulation (MOC) can be computed from NEMO ocean-model output for the whole globe or the Atlantic (AMOC), Indic (IMOC) and Pacific (PMOC) subbasins. The MOC is computable in z- and sigma coordinates. Moreover, for nested configurations, it is possible to combine data from both host and nest grids. Finally, it is possible to take into account of that the ORCA model grid is curvilinear north of 20°N: it is possible to compute the northward velocity component from the velocity field in x- and y- directions and to sum up the meridional flux over latitudional bands instead of in x-direction. When both steps are applied, the resulting MOC shows however strong variability in meridional direction. It needs to be clarified, whether this is realistic or not. The software is provided in the form of the jupyter notebook "MOC.ipynb" which includes more informations on the possibilites of the computations and an extensive appendix section with comparisons to computations with cdftools, as well as with details on the computation of the MOC including nest data and taking the curvilinearity of the grid into account. Necessary python modules are listed at the beginning of the document.
APA, Harvard, Vancouver, ISO, and other styles
6

Rasskazova, V. V., I. D. Sofronov, A. N. Shaporenko, D. E. Burton, and D. S. Miller. Reconnection methods for an arbitrary polyhedral computational grid. Office of Scientific and Technical Information (OSTI), August 1996. http://dx.doi.org/10.2172/402431.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cai, Yongyang, Kenneth Judd, Greg Thain, and Stephen Wright. Solving Dynamic Programming Problems on a Computational Grid. Cambridge, MA: National Bureau of Economic Research, January 2013. http://dx.doi.org/10.3386/w18714.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sengupta, Subrata. International Conference on Numerical Grid Generation in Computational Fluid Dynamics. Fort Belvoir, VA: Defense Technical Information Center, April 1989. http://dx.doi.org/10.21236/ada211082.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Abhyankar, Shrirang, Slaven Peles, and Draguna Vrabie. Power Grid Computational Challenges and Metrics for Hardware Accelerator Evaluation. Office of Scientific and Technical Information (OSTI), October 2019. http://dx.doi.org/10.2172/1989488.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Steinhoff, John. Computation of Separating High Reynolds Number Incompressible Flows Using Uniform Cartesian Grids. Fort Belvoir, VA: Defense Technical Information Center, July 2002. http://dx.doi.org/10.21236/ada410942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Computational grids' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography