Profiling Grid Data Transfer Protocols and Servers

Author(s):  
George Kola ◽  
Tevfik Kosar ◽  
Miron Livny
Keyword(s):  
Author(s):  
Priyaa Thavasimani

AbstractData Management of Astronomy Data is often a laborious task and it is even more challenging for the extraordinary amounts of data expected from the world’s largest radio telescope, Square Kilometre Array. There are overt issues in transferring the voluminous data and the traditional data transfer methods are fragile especially for the data transfer between two continents. To address this, a new data transfer framework is proposed and the data transfer is achieved using two steps: international and local transfers. The efficiency of different end-to-end data transfer tools used in is evaluated on different dataset sizes. Further, a comparative study of two IRIS grid data transfer methods is made to understand each methods’ advantages and disadvantages. This study can be used as a reference for the development of future SKA’s data transfer operations.


Author(s):  
Borja Bergua ◽  
Felix Garcia-Carballeira ◽  
Alejandro Calderon ◽  
Luis-Miguel Sanchez ◽  
Jesus Carretero

Author(s):  
Navonil Mustafee ◽  
Simon J.E. Taylor

The computational grid offers services for efficiently scheduling jobs on the grid, but for grid-enabled applications where data handling is a most relevant part, the data grid kicks in. It typically builds on the concept of files, sites and file transfers between sites. These use a data transfer service, plus a replica manager to keep track of where replicas are located. The authors consider a multi-site, grid-aware data warehouse, which is a large distributed repository sharing a schema and data concerning scientific or business domains. Differently from typical grid scenarios, the data warehouse is not simply a set of files and accesses to individual files. It is a single distributed schema and both localized and distributed computations must be managed over that schema. Given this difference, it is important to study approaches for placement and computation over the grid data warehouse and this is our contribution in this book chapter.


Author(s):  
Rogério Luís de Carvalho Costal ◽  
Pedro Furtado

The computational grid offers services for efficiently scheduling jobs on the grid, but for grid-enabled applications where data handling is a most relevant part, the data grid kicks in. It typically builds on the concept of files, sites and file transfers between sites. These use a data transfer service, plus a replica manager to keep track of where replicas are located. The authors consider a multi-site, grid-aware data warehouse, which is a large distributed repository sharing a schema and data concerning scientific or business domains. Differently from typical grid scenarios, the data warehouse is not simply a set of files and accesses to individual files. It is a single distributed schema and both localized and distributed computations must be managed over that schema. Given this difference, it is important to study approaches for placement and computation over the grid data warehouse and this is our contribution in this book chapter.


Author(s):  
M.F. Schmid ◽  
R. Dargahi ◽  
M. W. Tam

Electron crystallography is an emerging field for structure determination as evidenced by a number of membrane proteins that have been solved to near-atomic resolution. Advances in specimen preparation and in data acquisition with a 400kV microscope by computer controlled spot scanning mean that our ability to record electron image data will outstrip our capacity to analyze it. The computed fourier transform of these images must be processed in order to provide a direct measurement of amplitudes and phases needed for 3-D reconstruction.In anticipation of this processing bottleneck, we have written a program that incorporates a menu-and mouse-driven procedure for auto-indexing and refining the reciprocal lattice parameters in the computed transform from an image of a crystal. It is linked to subsequent steps of image processing by a system of data bases and spawned child processes; data transfer between different program modules no longer requires manual data entry. The progress of the reciprocal lattice refinement is monitored visually and quantitatively. If desired, the processing is carried through the lattice distortion correction (unbending) steps automatically.


Sign in / Sign up

Export Citation Format

Share Document