Relevant bibliographies by topics / Computational Grid

Academic literature on the topic 'Computational Grid'

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:

Contents

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

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 Grid"

1

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
2

Goswami, Sukalyan, and Kuntal Mukherjee. "High Performance Fault Tolerant Resource Scheduling in Computational Grid Environment." International Journal of Web-Based Learning and Teaching Technologies 15, no. 1 (January 2020): 73–87. http://dx.doi.org/10.4018/ijwltt.2020010104.

Full text
Abstract:
Virtual resources team up to create a computational grid, which is used in computation-intensive problem solving. A majority of these problems require high performance resources to compute and generate results, making grid computation another type of high performance computing. The optimization in computational grids relates to resource utilization which in turn is achieved by the proper distribution of loads among participating resources. This research takes up an adaptive resource ranking approach, and improves the effectiveness of NDFS algorithm by scheduling jobs in those ranked resources, thereby increasing the number of job deadlines met and service quality agreements met. Moreover, resource failure is taken care of by introducing a partial backup approach. The benchmark codes of Fast Fourier Transform and Matrix Multiplication are executed in a real test bed of a computational grid, set up by Globus Toolkit 5.2 for the justification of propositions made in this article.
APA, Harvard, Vancouver, ISO, and other styles
3

Bernth, Henrik, and Chris Chapman. "A comparison of the dispersion relations for anisotropic elastodynamic finite-difference grids." GEOPHYSICS 76, no. 3 (May 2011): WA43—WA50. http://dx.doi.org/10.1190/1.3555530.

Full text
Abstract:
Several staggered grid schemes have been suggested for performing finite-difference calculations for the elastic wave equations. In this paper, the dispersion relationships and related computational requirements for the Lebedev and rotated staggered grids for anisotropic, elastic, finite-difference calculations in smooth models are analyzed and compared. These grids are related to a popular staggered grid for the isotropic problem, the Virieux grid. The Lebedev grid decomposes into Virieux grids, two in two dimensions and four in three dimensions, which decouple in isotropic media. Therefore the Lebedev scheme will have twice or four times the computational requirements, memory, and CPU as the Virieux grid but can be used with general anisotropy. In two dimensions, the rotated staggered grid is exactly equivalent to the Lebedev grid, but in three dimensions it is fundamentally different. The numerical dispersion in finite-difference grids depends on the direction of propagation and the grid type and parameters. A joint numerical dispersion relation for the two grids types in the isotropic case is derived. In order to compare the computational requirements for the two grid types, the dispersion, averaged over propagation direction and medium velocity are calculated. Setting the parameters so the average dispersion is equal for the two grids, the computational requirements of the two grid types are compared. In three dimensions, the rotated staggered grid requires at least 20% more memory for the field data and at least twice as many number of floating point operations and memory accesses, so the Lebedev grid is more efficient and is to be preferred.
APA, Harvard, Vancouver, ISO, and other styles
4

Kang, Ning, and Yuan Cao. "Research on Computational Fluid Dynamics with Effect of Grid Quality on the Accuracy of Simulated Results of Two Dimensional Low-Speed Parallel Flow." Applied Mechanics and Materials 685 (October 2014): 232–35. http://dx.doi.org/10.4028/www.scientific.net/amm.685.232.

Full text
Abstract:
In the field of computational fluid dynamics, grid generation costs most of work. The accuracy and reliability of the simulated results depend directly on grid quality. The two dimensional parallel flow with low speed was used to study the effect of grid quality on simulated results. Several conclusions are obtained. The computational error decreases with the increase of domain size in flow direction. Too many grids in flow direction will lead to bigger round-off error, while too few grids will make it harder to catch the correct flow. The increase of grid quantity in the direction perpendicular to flow direction will decrease the computational error, but the effect is not obvious. Increasing the grid quantity in the area near the wall will decrease the computational error.
APA, Harvard, Vancouver, ISO, and other styles
5

Coveney, Peter V. "Scientific Grid computing." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 363, no. 1833 (July 18, 2005): 1707–13. http://dx.doi.org/10.1098/rsta.2005.1632.

Full text
Abstract:
We introduce a definition of Grid computing which is adhered to throughout this Theme Issue. We compare the evolution of the World Wide Web with current aspirations for Grid computing and indicate areas that need further research and development before a generally usable Grid infrastructure becomes available. We discuss work that has been done in order to make scientific Grid computing a viable proposition, including the building of Grids, middleware developments, computational steering and visualization. We review science that has been enabled by contemporary computational Grids, and associated progress made through the widening availability of high performance computing.
APA, Harvard, Vancouver, ISO, and other styles
6

Miller, Russ, Naimesh Shah, Mark L. Green, William Furey, and Charles M. Weeks. "Shake-and-Bakeon the grid." Journal of Applied Crystallography 40, no. 5 (September 5, 2007): 938–44. http://dx.doi.org/10.1107/s0021889807034565.

Full text
Abstract:
Computational and data grids represent an emerging technology that allows geographically and organizationally distributed resources (e.g.computing and storage resources) to be linked and accessed in a fashion that is transparent to the user, presenting an extension of the desktop for users whose computational, data and visualization needs extend beyond their local systems. The New York State Grid is an integrated computational and data grid that provides web-based access for users from around the world to computational, application and data storage resources. This grid is used in a ubiquitous fashion, where the users have virtual access to their data sets and applications, but do not need to be made aware of the details of the data storage or computational devices that are specifically employed. Two of the applications that users worldwide have access to on a variety of grids, including the New York State Grid, are theSnBandBnPprograms, which implement theShake-and-Bakemethod of molecular structure (SnB) and substructure (BnP) determination, respectively. In particular, through our grid portal (i.e.logging on to a web site),SnBhas been run simultaneously on all computational resources on the New York State Grid as well as on more than 1100 of the over 3000 processors available through the Open Science Grid.
APA, Harvard, Vancouver, ISO, and other styles
7

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
8

Aloisio, Giovanni, Massimo Cafaro, Euro Blasi, and Italo Epicoco. "The Grid Resource Broker, A Ubiquitous Grid Computing Framework." Scientific Programming 10, no. 2 (2002): 113–19. http://dx.doi.org/10.1155/2002/969307.

Full text
Abstract:
Portals to computational/data grids provide the scientific community with a friendly environment in order to solve large-scale computational problems. The Grid Resource Broker (GRB) is a grid portal that allows trusted users to create and handle computational/data grids on the fly exploiting a simple and friendly web-based GUI. GRB provides location-transparent secure access to Globus services, automatic discovery of resources matching the user's criteria, selection and scheduling on behalf of the user. Moreover, users are not required to learn Globus and they do not need to write specialized code or to rewrite their existing legacy codes. We describe GRB architecture, its components and current GRB features addressing the main differences between our approach and related work in the area.
APA, Harvard, Vancouver, ISO, and other styles
9

Ha, Minho, Cheolung Cheong, Hanshin Seol, Bu-Geun Paik, Min-Jae Kim, and Young-Rae Jung. "Development of Efficient and Accurate Parallel Computation Algorithm Using Moving Overset Grids on Background Multi-Domains for Complex Two-Phase Flows." Applied Sciences 8, no. 10 (October 16, 2018): 1937. http://dx.doi.org/10.3390/app8101937.

Full text
Abstract:
The goal of this study involves developing an efficient and accurate parallel computation method for two-phase flow problems including complex moving foreign bodies. The proposed parallel computing techniques are based on the moving body-fitted grids’ overset on background multidomains with grid-overlapping at their interface. First, the cavitation flow over the hemispherical head form is investigated using the two-phase flow solver, which is validated by comparing the numerical and experimental results. Subsequently, the parallel computing technique based on the multidomain method that divides the computational domain into several smaller subdomains is proposed to facilitate more efficient numerical simulations. At the interface of the subdomains, the grid-overlapping method is proposed for more accurate simulations. The illustrative computations indicate that the accuracy of the parallel computation combined with the grid-overlapping method on multidomains is identical to that of the serial computation based on a single block, albeit with a significant reduction in the computation time. Finally, the moving overset grid technique is combined with the background multidomain method and applied to simulate the gust flow that is generated by the pitching motions of the twin hydrofoils. The overset grid technique includes the following three sequential steps: hole-cutting, finding donor cells, and bilinear interpolation. The prediction results for the inflow gust generated by oscillating hydrofoils closely follow the measured results.
APA, Harvard, Vancouver, ISO, and other styles
10

Guan, Steven, Ko-Tsung Hsu, and Parag V. Chitnis. "Fourier Neural Operator Network for Fast Photoacoustic Wave Simulations." Algorithms 16, no. 2 (February 19, 2023): 124. http://dx.doi.org/10.3390/a16020124.

Full text
Abstract:
Simulation tools for photoacoustic wave propagation have played a key role in advancing photoacoustic imaging by providing quantitative and qualitative insights into parameters affecting image quality. Classical methods for numerically solving the photoacoustic wave equation rely on a fine discretization of space and can become computationally expensive for large computational grids. In this work, we applied Fourier Neural Operator (FNO) networks as a fast data-driven deep learning method for solving the 2D photoacoustic wave equation in a homogeneous medium. Comparisons between the FNO network and pseudo-spectral time domain approach were made for the forward and adjoint simulations. Results demonstrate that the FNO network generated comparable simulations with small errors and was orders of magnitude faster than the pseudo-spectral time domain methods (~26× faster on a 64 × 64 computational grid and ~15× faster on a 128 × 128 computational grid). Moreover, the FNO network was generalizable to the unseen out-of-domain test set with a root-mean-square error of 9.5 × 10−3 in Shepp–Logan, 1.5 × 10−2 in synthetic vasculature, 1.1 × 10−2 in tumor and 1.9 × 10−2 in Mason-M phantoms on a 64 × 64 computational grid and a root mean squared of 6.9 ± 5.5 × 10−3 in the AWA2 dataset on a 128 × 128 computational grid.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Computational Grid"

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

Ming, Jiang. "Distributed simulations on a computational Grid." Thesis, University of Birmingham, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.487476.

Full text
Abstract:
In order to simulate a large scale and complex model, a distributed simulation normally may require to harness and organise a huge amount of computing and network resources to support the simulation. A computational Grid is a novel distributed computing system that is able to organise virtually unlimited computing and network resources together to meet the resource requirements of various computational intensive problems. This thesis focuses on the issues of the integration of a distributed simulation and a computational Grid. Particularly, the dynamic and heterogeneous nature of Grid resources and the potentiaJIy high communication latencies between these resources are identified as the main chaJIenges to the performance of a distributed simulation running on a computational Grid. This thesis proposes a generic framework that provides a systematic solution to tackle these challenges and supports the execution, management and optimisation of a distributed simulation program on a computational Grid. A prototype of the framework is also implemented and evaluated. Within the prototype implementation, an adaptive control mechanism for optimising the execution of a Time Warp Parallel Discrete Event Simulation program on a computational Grid is developed and evaluated.
APA, Harvard, Vancouver, ISO, and other styles
3

Cardenas, Baron Yonni Brunie Lionel Pierson Jean-Marc. "Grid caching specification and implementation of collaborative cache services for grid computing /." Villeurbanne : Doc'INSA, 2008. http://docinsa.insa-lyon.fr/these/pont.php?id=cardenas_baron.

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

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
5

Lepping, Joachim [Verfasser]. "Dezentrales grid scheduling mittels computational intelligence / Joachim Lepping." Dortmund : Universitätsbibliothek Technische Universität Dortmund, 2011. http://d-nb.info/1011570572/34.

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

Quirk, J. J. "An adaptive grid algorithm for computational shock hydrodynamics." Thesis, Boston Spa, U.K. : British Library Document Supply Centre, 1991. http://ethos.bl.uk/OrderDetails.do?did=1&uin=uk.bl.ethos.280913.

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

Paulus, Amanda. "A Model-Predictive-Control Based Smart-Grid Aggregator." Thesis, KTH, Optimeringslära och systemteori, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-230958.

Full text
Abstract:
Intermittent energy source usage, such as solar and wind power, is continuously increasing. Intermittent energy sources are highly dependent on prevailing weather conditions, resulting in stochastic electricity generation. The expected stochasticity in electricity generation will cause issues for the current power grid. Moreover, an expected issue for the Swedish power grid is higher peak loads. Thus, there is an emerging need for novel and smart power systems capable of shifting peak loads in the future electricity grid. Model Predictive Control (MPC) is a sophisticated control method that is suitable for smart-grid aggregators. Hence, MPC can be used to optimally control the efficiency of energy use in a smart grid and shift peak loads. The purpose of this thesis is to investigate optimal peak load-shifting and efficiency of electrical substation operation in a smart grid in Ramsjöåsen, Sweden, using an MPC based smart-grid aggregator. Furthermore, the purpose is also to contribute to the theoretical foundation for future peak load-shifting in smart grids. Within the thesis project a mathematical model for the smart grid in Ramsjöåsen is developed, which is then used to simulate different scenarios. The simulated results indicate that an MPC based smart-grid aggregator improves the performance of the smart grid in Ramsjöåsen, as regards to both peak load-shifting and efficiency of electrical substation operation.
Användningen av intermittenta energikällor, såsom sol och vindkraft, ökar ständigt. Intermittenta energikällor är starkt beroende av rådande väderförhållanden, vilket resulterar i stokastisk elproduktion. Den förväntade stokasticiteten i elproduktion kommer att orsaka problem för det nuvarande elnätet. Dessutom förväntas högre toppbelastningar för det svenska elnätet. Således finns ett växande behov av nya och smarta kraftsystem som kan reducera toppbelastningar i det framtida elnätet. Model Predictive Control (MPC) är en sofistikerad styrningsmetod som är lämplig för smart-näts aggregatorer. Därav kan MPC användas för att optimalt styra effektivitet av energianvändning i ett smart nät och minska toppbelastningar. Syftet med detta examensarbete är att undersöka optimal reducering av toppbelastningar och drift-effektivitet av transformatorstationen i ett smart nät i Ramsjöåsen, Sverige, med hjälp av en MPC baserad smart-näts aggregator. Dessutom är syftet att bidra till den teoretiska grunden för framtida topplastskapning i smarta nät. Inom examensarbetsprojektet utvecklas en matematisk modell för smart nätet i Ramsjöåsen, som sedan används för att simulera olika scenarier. De simulerade resultaten indikerar att en MPC baserad smart-näts aggregator förbättrar smart nätets prestanda i Ramsjöåsen, vad gäller både topplastsreducering och drifteffektivitet av transformatorstationen.
APA, Harvard, Vancouver, ISO, and other styles
8

Popescu, Mihaela. "A finite volume, Cartesian grid method for computational aeroacoustics." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0011602.

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

Afgan, Enis. "Utility driven grid scheduling framework." Birmingham, Ala. : University of Alabama at Birmingham, 2009. https://www.mhsl.uab.edu/dt/2009p/afgan.pdf.

Full text
Abstract:
Thesis (Ph. D.)--University of Alabama at Birmingham, 2009.
Title from PDF title page (viewed Sept. 1, 2009). Additional advisors: Brandon Eames, Elliot Lefkowitz, Anthony Skjellum, Alan Sprague. Includes bibliographical references (p. 228-245).
APA, Harvard, Vancouver, ISO, and other styles
10

Sandholm, Thomas. "Managing Service Levels in Grid Computing Systems : Quota Policy and Computational Market Approaches." Licentiate thesis, KTH, Numerical Analysis and Computer Science, NADA, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-4346.

Full text
Abstract:

We study techniques to enforce and provision differentiated service levels in Computational Grid systems. The Grid offers simplified provisioning of peak-capacity for applications with computational requirements beyond local machines and clusters, by sharing resources across organizational boundaries. Current systems have focussed on access control, i.e., managing who is allowed to run applications on remote sites. Very little work has been done on providing differentiated service levels for those applications that are admitted. This leads to a number of problems when scheduling jobs in a fair and efficient way. For example, users with a large number of long-running jobs could starve out others, both intentionally and non-intentionally. We investigate the requirements of High Performance Computing (HPC) applications that run in academic Grid systems, and propose two models of service-level management. Our first model is based on global real-time quota enforcement, where projects are granted resource quota, such as CPU hours, across the Grid by a centralized allocation authority. We implement the SweGrid Accounting System to enforce quota allocated by the Swedish National Allocations Committee in the SweGrid production Grid, which connects six Swedish HPC centers. A flexible authorization policy framework allows provisioning and enforcement of two different service levels across the SweGrid clusters; high-priority and low-priority jobs. As a solution to more fine-grained control over service levels we propose and implement a Grid Market system, using a market-based resource allocator called Tycoon. The conclusion of our research is that although the Grid accounting solution offers better service level enforcement support than state-of-the-art production Grid systems, it turned out to be complex to set the resource price and other policies manually, while ensuring fairness and efficiency of the system. Our Grid Market on the other hand sets the price according to the dynamic demand, and it is further incentive compatible, in that the overall system state remains healthy even in the presence of strategic users.

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

Books on the topic "Computational Grid"

1

P, Hills David, European Computational Aerodynamics Research Project., and European Commission. Directorate-General XII, Science, Research, and Development., eds. Computational mesh adaptation: ECARP--European Computational Aerodynamics Research Project. Braunschweig/Wiesbaden: Vieweg, 1999.

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

Fey, Dietmar. Grid-Computing: Grid Computing fu r Computational Science. Berlin: Springer Berlin, 2009.

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

S, Liou M., and United States. National Aeronautics and Space Administration., eds. Direct replacement of arbitrary grid-overlapping by non-structured grid. [Washington, DC]: National Aeronautics and Space Administration, 1994.

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

J, Barth Timothy, and Ames Research Center, eds. Three-dimensional unstructured grid refinement and optimization using edge swapping. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1993.

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

Timothy, Barth, and Ames Research Center, eds. Three-dimensional unstructured grid refinement and optimization using edge swapping. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1993.

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

J, Barth Timothy, and Ames Research Center, eds. Three-dimensional unstructured grid refinement and optimization using edge swapping. Moffett Field, Calif: National Aeronautics and Space Administration, Ames Research Center, 1993.

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

Craig, Fellenstein, ed. Grid computing. Upper Saddle River, N.J: Prentice Hall Professional Technical Reference, 2004.

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

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
9

Spence, H. E. Contributions of the low-latitude boundary layer to the finite width magnetotail convection model. El Segundo, Calif: The Aerospace Corporation, 1993.

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

Spence, H. E. Contributions of the low-latitude boundary layer to the finite width magnetotail convection model. El Segundo, Calif: The Aerospace Corporation, 1993.

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

Book chapters on the topic "Computational Grid"

1

Shekhar, Shashi, and Hui Xiong. "Computational Grid." In Encyclopedia of GIS, 112. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_162.

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

Shekhar, Shashi, and Hui Xiong. "Geospatial Computational Grid." In Encyclopedia of GIS, 385. Boston, MA: Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-35973-1_504.

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

Fey, Dietmar. "Grid Computing für Computational Science." In Grid-Computing, 3–13. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79747-0_1.

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

Kythe, Prem K. "Grid Generation." In Computational Conformal Mapping, 379–400. Boston, MA: Birkhäuser Boston, 1998. http://dx.doi.org/10.1007/978-1-4612-2002-2_15.

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

Shin, Pil-Sup, Won-Kee Hong, Hiecheol Kim, and Shin-Dug Kim. "Configuration Method of Multiple Clusters for the Computational Grid." In Grid Computing — GRID 2000, 170–80. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44444-0_16.

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

Heymann, Elisa, Miquel A. Senar, Emilio Luque, and Miron Livny. "Adaptive Scheduling for Master-Worker Applications on the Computational Grid." In Grid Computing — GRID 2000, 214–27. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44444-0_20.

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

Maeng, Hye-Seon, Tack-Don Han, and Shin-Dug Kim. "Resource Management Method for Cooperative Web Computing on Computational Grid." In Grid Computing — GRID 2000, 55–64. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44444-0_6.

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

Renner, Uwe. "Computational Statistical Physics – Stochastische Simulation von Diffusionsprozessen." In Grid-Computing, 325–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79747-0_15.

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

Rockstuhl, Carsten, Thomas Paul, Thomas Pertsch, and Falk Lederer. "Computational Photonics – Grid Computing in der Nanooptik." In Grid-Computing, 367–84. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79747-0_17.

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

Brinkmann, Matthias, and Malte Hagemann. "Computational Photonics – Das Design von organischen Leuchtdioden." In Grid-Computing, 385–90. Berlin, Heidelberg: Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-79747-0_18.

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

Conference papers on the topic "Computational Grid"

1

Wang, Wei. "Engineering Computational Service Grid: A Flexible Engineering Computational Environment Based on Grid Computing." In 2009 WRI World Congress on Computer Science and Information Engineering. IEEE, 2009. http://dx.doi.org/10.1109/csie.2009.264.

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

Wu, Yongwei, Yulai Yuan, Guangwen Yang, and Weimin Zheng. "Load prediction using hybrid model for computational grid." In 2007 8th IEEE/ACM International Conference on Grid Computing. IEEE, 2007. http://dx.doi.org/10.1109/grid.2007.4354138.

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

Musunoori, S. B., F. Eliassen, and V. S. W. Eide. "QoS-driven service configuration in computational grids." In The 6th IEEE/ACM International Workshop on Grid Computing, 2005. IEEE, 2005. http://dx.doi.org/10.1109/grid.2005.1542760.

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

Katanoda, H. "Influence of Computational Grid Spacing on Gas/Particle Flow of Cold Spray." In ITSC2011, edited by B. R. Marple, A. Agarwal, M. M. Hyland, Y. C. Lau, C. J. Li, R. S. Lima, and A. McDonald. DVS Media GmbH, 2011. http://dx.doi.org/10.31399/asm.cp.itsc2011p0609.

Full text
Abstract:
Abstract The grid-spacing dependency of the numerical solutions of the supersonic gas/particle impinging flow of the cold spray is investigated. The control parameters of the grid spacing in the nozzle are the radial grid spacing normal to the nozzle wall, the axial grid spacing at the nozzle exit, and the radial number of grids in the nozzle. The working gas is nitrogen with a pressure and a temperature of 2MPa and 600K at the stagnant chamber. The solid particle to be accelerated by the supersonic gas flow is spherical copper 5µm in diameter. The numerical results reveal that the computational result with coarsest grid poorly captures the supersonic gas flow in the nozzle. However, the impinging velocity of the particle onto the substrate differs less than 3.5% between those results obtained from the finest and coarsest grids.
APA, Harvard, Vancouver, ISO, and other styles
5

Pirzadeh, Shahyar. "An adaptive unstructured grid method by grid subdivision, local remeshing, and grid movement." In 14th Computational Fluid Dynamics Conference. Reston, Virigina: American Institute of Aeronautics and Astronautics, 1999. http://dx.doi.org/10.2514/6.1999-3255.

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

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
7

Limaye, K., B. Leangsuksun, Yudan Liu, Z. Greenwood, S. L. Scott, R. Libby, and K. Chanchio. "Reliability-aware resource management for computational grid/cluster environments." In The 6th IEEE/ACM International Workshop on Grid Computing, 2005. IEEE, 2005. http://dx.doi.org/10.1109/grid.2005.1542744.

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

Aydin, G., M. S. Aktas, G. C. Fox, H. Gadgil, M. Pierce, and A. Saya. "SERVOGrid complexity computational environments (CCE) integrated performance analysis." In The 6th IEEE/ACM International Workshop on Grid Computing, 2005. IEEE, 2005. http://dx.doi.org/10.1109/grid.2005.1542750.

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

Efkolidis, Nikolaos, Prodromos Minaoglou, Kyriaki Aidinli, and Panagiotis Kyratsis. "Computational design used for jewelry." In 10th International Symposium on Graphic Engineering and Design. University of Novi Sad, Faculty of technical sciences, Department of graphic engineering and design,, 2020. http://dx.doi.org/10.24867/grid-2020-p60.

Full text
Abstract:
Nowadays more and more computer-aided technologies and computational techniques are applied to product design. Jewelry belongs to those products. Jewelry is considered as part of human civilization and adopted to human’s needs. In recent years, computational design is applied in order to overcome the limitations of traditional CAD systems, when reaching an increased level of complexity and geometrical controls. Computational design supports the evolution of creative design and develops models as a form of the computational exploration. Furthermore, additive manufacturing (AM) pieces of equipment are widely used to create models and prototype parts in various applications. AM plays an important role, when developing jewelry models, as it is utilized with an aim to produce high-quality models in rather reduced numbers and complex shapes. In the current paper, a computer-based design tool was applied in order to develop algorithms for the generation of new artistic forms for the design of a set of jewelry. Then, Stereolithography (SLA) technique is chosen for the prototype models construction.
APA, Harvard, Vancouver, ISO, and other styles
10

Cecchi, Dr Marco, and Dr Jader Monari. "SETI@GRID: exploiting computational grids to boost SETI data analysis." In 57th International Astronautical Congress. Reston, Virigina: American Institute of Aeronautics and Astronautics, 2006. http://dx.doi.org/10.2514/6.iac-06-a4.1.09.

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

Reports on the topic "Computational Grid"

1

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
2

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
3

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
4

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
5

Saunders, Bonita V. The application of numerical grid generation to problems in computational fluid dynamics. Gaithersburg, MD: National Institute of Standards and Technology, 1997. http://dx.doi.org/10.6028/nist.ir.6073.

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

Nell, Ryan, and Will Nichols. Mapping the Concentration Distribution of Contaminant Plumes to the Computational Grid of the Plateau to River Model (Ver. 8.3). Office of Scientific and Technical Information (OSTI), June 2020. http://dx.doi.org/10.2172/1635525.

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

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
8

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
9

Beddhu, M., M. Y. Jiang, D. L. Whitfield, L. K. Taylor, and A. Arabshahi. Computational physical oceanography -- A comprehensive approach based on generalized CFD/grid techniques for planetary scale simulations of oceanic flows. Final report, September 1, 1995--August 31, 1996. Office of Scientific and Technical Information (OSTI), February 1997. http://dx.doi.org/10.2172/663439.

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

Wissink, Andrew, Jude Dylan, Buvana Jayaraman, Beatrice Roget, Vinod Lakshminarayan, Jayanarayanan Sitaraman, Andrew Bauer, James Forsythe, Robert Trigg, and Nicholas Peters. New capabilities in CREATE™-AV Helios Version 11. Engineer Research and Development Center (U.S.), June 2021. http://dx.doi.org/10.21079/11681/40883.

Full text
Abstract:
CREATE™-AV Helios is a high-fidelity coupled CFD/CSD infrastructure developed by the U.S. Dept. of Defense for aeromechanics predictions of rotorcraft. This paper discusses new capabilities added to Helios version 11.0. A new fast-running reduced order aerodynamics option called ROAM has been added to enable faster-turnaround analysis. ROAM is Cartesian-based, employing an actuator line model for the rotor and an immersed boundary model for the fuselage. No near-body grid generation is required and simulations are significantly faster through a combination of larger timesteps and reduced cost per step. ROAM calculations of the JVX tiltrotor configuration give a comparably accurate download prediction to traditional body-fitted calculations with Helios, at 50X less computational cost. The unsteady wake in ROAM is not as well resolved, but wake interactions may be a less critical issue for many design considerations. The second capability discussed is the addition of six-degree-of-freedom capability to model store separation. Helios calculations of a generic wing/store/pylon case with the new 6-DOF capability are found to match identically to calculations with CREATE™-AV Kestrel, a code which has been extensively validated for store separation calculations over the past decade.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Computational Grid' 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