Complex in-house tool for calculation of characteristic modes has been shortly introduced. then some bottlenecks were identified and modified into parallel and distributive computing mode. One example has been complet...
详细信息
this paper presents a High Performance computing-based application for 3D structural analysis of buildings. Since the solution of a large linear system of sparse equations supposes the most time-consuming phase, sever...
详细信息
this paper presents a High Performance computing-based application for 3D structural analysis of buildings. Since the solution of a large linear system of sparse equations supposes the most time-consuming phase, several public domain parallel numerical libraries, with state-of-the-art capabilities, have been tested. the parallel application developed allows reducing the analysis time and simulating larger structures. Nevertheless, structural engineers rarely have available high cost parallel machines. thus, a Grid Structural Analysis service, that integrates the parallel application, has been implemented, taking advantage of computers geographically distributed in Internet. this service makes it possible to simulate in a realistic way, and concurrently, a high number of different structural alternatives of large dimension buildings during their design stage, without considering structural simplifications or investing in expensive computers. (c) 2006 Elsevier Ltd. and Civil-Comp Ltd. All rights reserved.
In this paper we propose a systematic approach to performance analysis of workflow applications on the Grid. We introduce an ideal model for the workflow execution time and explain the difference to the real measured ...
详细信息
ISBN:
(纸本)9781424403431
In this paper we propose a systematic approach to performance analysis of workflow applications on the Grid. We introduce an ideal model for the workflow execution time and explain the difference to the real measured times based on a hierarchy of performance overheads for Grid computing. We describe how to systematically measure and compute the overheads from individual activities to entire workflow applications. We adjusted well-known parallel processing metrics to the scope of Grid computing, comprising speedup and efficiency. We have implemented and largely automatised our analysis approach in the context of the ASKALON Grid application development and computing environment. We present experimental results that show detailed overhead analysis of two real-world workflow applications executed in a national Grid environment.
A previous knowledge of the domains of dependence of a Hamilton-Jacobi equation can be useful in its study and approximation. Information of this nature is, in general, difficult to obtain directly from the data of th...
详细信息
A previous knowledge of the domains of dependence of a Hamilton-Jacobi equation can be useful in its study and approximation. Information of this nature is, in general, difficult to obtain directly from the data of the problem. In this paper we formally introduce the concept of an independent sub-domain, discuss its main properties and provide a constructive implicit representation formula. through these results, we propose an algorithm for the approximation of these sets that is shown to be relevant in the numerical resolution, via parallelcomputing.
the development of the Grid has opened new possibilities for scientists and engineers to execute large-scale modeling experiments. this has stimulated the generation and development of tools for the creation and manag...
详细信息
ISBN:
(纸本)9781424403431
the development of the Grid has opened new possibilities for scientists and engineers to execute large-scale modeling experiments. this has stimulated the generation and development of tools for the creation and management of complex computing experiments in the Grid. Among these, tools for the automation of the programming of experiments play a significant role. In this paper we present GriCoL, which we propose as a simple and efficient language for the description of complex Grid experiments.
We present randomized and deterministic algorithms for many-to-one packet routing on an n-node two-dimensional mesh under the store-and-forward model. We consider the general instance of many-to-one routing where each...
详细信息
We present randomized and deterministic algorithms for many-to-one packet routing on an n-node two-dimensional mesh under the store-and-forward model. We consider the general instance of many-to-one routing where each node is the source (resp., destination) of l (resp., k) packets, for arbitrary values of l and k. All our algorithms run in optimal O(root lkn) time and use queues of only constant size at each node to store packets in transit. the randomized algorithms, however, are simpler to implement. Our result closes a gap in the literature, where time-optimal algorithms using constant-size queues were known only for the special cases l = 1 and l = k. (c) 2005 Published by Elsevier B.V.
We give an alternative method for computingthe matrix argmin parallel to A - P parallel to(F), where parallel *** to(F) is the Frobenius norm and P is taken from the set of square matrices simultaneously diagonalized...
详细信息
We give an alternative method for computingthe matrix argmin parallel to A - P parallel to(F), where parallel *** to(F) is the Frobenius norm and P is taken from the set of square matrices simultaneously diagonalized by a given orthogonal trigonometric transform. Specific examples are given. (C) 1999 Elsevier Science Inc. All rights reserved. AMS classification: 65F10;65F35;15A12.
the existent parallel rendering frameworks, e.g. Chromium, can just support separate screens to display the resultant images. While the proposed BH-TDAP1 extended Equalizer can support projection-based seamless displa...
详细信息
ISBN:
(纸本)9781424417865
the existent parallel rendering frameworks, e.g. Chromium, can just support separate screens to display the resultant images. While the proposed BH-TDAP1 extended Equalizer can support projection-based seamless displays to achieve extremely high resolution as well as high performance visualization. the paper introduces some example systems that set up with such extended parallel rendering architecture. the evident advantages of low cost, high reliability, high extensible, make those system worthy to be widely used in practical applications.
gLite is one of the largest distributed computing infrastructures in operation. It provides access to hundreds of different clusters - all installed and maintained in different ways. this paper analyses the difficulti...
详细信息
ISBN:
(纸本)9780769539393
gLite is one of the largest distributed computing infrastructures in operation. It provides access to hundreds of different clusters - all installed and maintained in different ways. this paper analyses the difficulties which users typically experience when moving from their own workstation via clusters or supercomputers to the grid. Based on that analysis, this paper presents tools, which helps to overcome this gap and introduces an advanced commandline interface to the grid.
the goal of this paper is to calculate the performance of the parallel scheme of non-hydrostatic Gravitational Surface Wave using GPU based on CUDA. Here, Navier-Stokes equations used as a model which is simplified by...
详细信息
ISBN:
(纸本)9781538680520
the goal of this paper is to calculate the performance of the parallel scheme of non-hydrostatic Gravitational Surface Wave using GPU based on CUDA. Here, Navier-Stokes equations used as a model which is simplified by removing non-linear and friction terms. In this paper, simple finite different method is used as a numerical method. the discretization of pressure, vertical and horizontal velocity variables uses Arakawa C-Grid which leads to solve Poisson equation. the numerical simulation of propagating waves generated by surface pressure is given. the parallelcomputing is shown satisfied. Using large number of grids (N-x = 1024,N-y = 512), serial and parallel CPU time are observed 20197.66 and 6521.85 seconds respectively. therefore the usage of parallelcomputing in this simulation produces speedup approximately 3 times of serial computing.
暂无评论