skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: GridCopy : moving data fast on the grid.

Abstract

An important type of communication in grid and distributed computing environments is bulk data transfer. GridFTP has emerged as a de facto standard for secure, reliable, high-performance data transfer across resources on the grid. GridCopy provides a simple GridFTP client interface to users and extensible configuration that can be changed dynamically by administrators to make efficient data movement in the Grid easier for users.

Authors:
; ; ; ; ; ;
Publication Date:
Research Org.:
Argonne National Lab. (ANL), Argonne, IL (United States)
Sponsoring Org.:
USDOE Office of Science (SC); National Science Foundation (NSF)
OSTI Identifier:
971456
Report Number(s):
ANL/MCS/CP-58492
TRN: US201004%%17
DOE Contract Number:
DE-AC02-06CH11357
Resource Type:
Conference
Resource Relation:
Conference: International Parallel and Distributed Processing Symposium - IPDPS 2007; Mar. 26, 2007 - Mar. 30, 2007; Long Beach, CA
Country of Publication:
United States
Language:
ENGLISH
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; DATA TRANSMISSION; COMPUTER NETWORKS; G CODES; PERFORMANCE; RELIABILITY

Citation Formats

Kettimuthu, R., Allcock, W., Liming, L., Navarro, J.-P., Foster, I., Mathematics and Computer Science, and Univ. of Chicago. GridCopy : moving data fast on the grid.. United States: N. p., 2007. Web. doi:10.1109/IPDPS.2007.370553.
Kettimuthu, R., Allcock, W., Liming, L., Navarro, J.-P., Foster, I., Mathematics and Computer Science, & Univ. of Chicago. GridCopy : moving data fast on the grid.. United States. doi:10.1109/IPDPS.2007.370553.
Kettimuthu, R., Allcock, W., Liming, L., Navarro, J.-P., Foster, I., Mathematics and Computer Science, and Univ. of Chicago. Mon . "GridCopy : moving data fast on the grid.". United States. doi:10.1109/IPDPS.2007.370553.
@article{osti_971456,
title = {GridCopy : moving data fast on the grid.},
author = {Kettimuthu, R. and Allcock, W. and Liming, L. and Navarro, J.-P. and Foster, I. and Mathematics and Computer Science and Univ. of Chicago},
abstractNote = {An important type of communication in grid and distributed computing environments is bulk data transfer. GridFTP has emerged as a de facto standard for secure, reliable, high-performance data transfer across resources on the grid. GridCopy provides a simple GridFTP client interface to users and extensible configuration that can be changed dynamically by administrators to make efficient data movement in the Grid easier for users.},
doi = {10.1109/IPDPS.2007.370553},
journal = {},
number = ,
volume = ,
place = {United States},
year = {Mon Jan 01 00:00:00 EST 2007},
month = {Mon Jan 01 00:00:00 EST 2007}
}

Conference:
Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • The power grid is a complex network connecting electricity providers with their consumers. With an increasing consumer base requiring more resources and the requirement to integrate significant renewable sources, maintaining the network requires new and innovative management solutions. To manage this complexity and provide precise, real-time views of the grid, Phasor Measurement Units (PMUs) are undergoing widespread deployment. These units provide measurements as often as 60 times per second, with an accurate time identifier attached to each reading, enabling real-time monitoring of the network. However, this new capability generates much more data than the current infrastructure is designed to handle.more » With the expectation that there will eventually be tens of thousands of PMUs monitoring the transmission lines, the power community is looking towards accumulating multiple terabytes of data per day - several orders of magnitude beyond current data acquisition rates. This has led to questions being raised in the power community about whether or not a significant research effort is required to effectively transfer the volume of information generated by these new data streams. This paper answers that question by comparing a worst-case data generation scenario with several alternative networking protocols and historical trends in protocol advancement. Based on this analysis we are able to conclude that transferring the information between the PMUs and the resulting data repositories is feasible. We recognize that there are issues beyond transferring the data that need to be addressed such as effective access to historical data, data transfer latency, cyber security, and data analysis. There is also an extensive engineering trade-off that the power companies will need to make to decide the best mix of networking protocols for their particular PMU deployments, since that requires significant assumptions about proprietary information including deployment cost, deployment schedules, PMU locations, and available resources.« less
  • An efficient numerical method is presented with multi-domain and moving grid capabilities to best suit internal combustion engine applications. Multi-domain capability allows a user to arbitrarily cut the solution domain into many topologically simpler domains. Consequently, simultaneous coupling among components becomes natural and the task of grid generation becomes easier. The moving grid capability allows the computational grid to move and conform to the piston motion. As a result, the grid always fits the flow boundaries and no special remapping or interpolation is needed. The method has been implemented to solve 2D and 3D flows in a body-fitted coordinate system.more » Air ingestion and scavenging flow problems in a generic four-stroke engine and a two-stroke engine are simulated to demonstrate the proposed approach. 18 refs.« less
  • Recently a scheme has been proposed for choosing a moving mesh based on minimizing the time rate of change of the solution in the moving coordinates for one-dimensional systems of PDEs. In this paper we show how to apply this idea to systems where the time derivatives cannot be solved for explicitly, writing the moving mesh equations in an implicit form. We give a geometrical interpretation of the scheme which exposes some of its weaknesses, and suggest some modifications based on this interpretation which increase the efficiency of the scheme. We show how changing the error estimate for time stepmore » selection from the usual strategy can significantly reduce the computation time. We discuss how to apply this moving mesh method to elliptic-parabolic systems. Finally, we present some numerical experiments which illustrate how well the resulting method works.« less
  • The investigators have presented the reasons and advantages of adaptively moving the mesh points for the solution of time-dependent PDEs (partial differential equations) systems developing sharp gradients, and more specifically for combustion problems. Several available adaptive dynamic rezone methods have been briefly reviewed, and the effectiveness of these algorithms for combustion problems has been illustrated by the numerical solution of a simple flame propagation problem. 29 refs., 7 figs.
  • A method is described that allows the simulation of the flow through arbitrarily shaped domains which move in any prescribed time varying fashion. The Navier-Stokes equations in their Lagrangian-Eulerian formulation are discretized on a triangular grid using a finite volume method. The time integration is done with an explicit or implicit time stepping method. In the Lagrangian-Eulerian formulation control volumes are allowed to move and deform in time. This means that if the geometry of the flow domain changes in time, grid nodes can move during the timestep but the connectivity of the nodes has to be kept fixed. Amore » method for the generation of meshes which can be used for this kind of time integration is described and illustrated in this paper.« less