Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Supporting Dynamic Migration in Tightly Coupled Grid Applications
 

Summary: Supporting Dynamic Migration in Tightly Coupled Grid
Applications
Liang Chen Qian Zhu Gagan Agrawal
Department of Computer Science and Engineering
Ohio State University, Columbus OH 43210
{chenlia,zhuq,agrawal}@cse.ohio-state.edu
ABSTRACT
In recent years, there has been a growing trend towards supporting
more tightly coupled applications on the grid, including scientific
workflows, applications that use pipelined or data-flow like pro-
cessing, and distributed streaming applications. As availability of
resources can vary over time in a grid environment, dynamic reallo-
cation of resources is very important for these applications, partic-
ularly because of their long-running nature, and because they often
require large-volume data transfers between processing stages.
This paper considers the problem of supporting and efficiently
implementing dynamic resource allocation for tightly-coupled and
pipelined applications in a grid environment. We provide an al-
ternative to basic checkpointing, using the notion of Light-weight
Summary Structure (LSS), to enable efficient migration. The idea

  

Source: Agrawal, Gagan - Department of Computer Science and Engineering, Ohio State University

 

Collections: Computer Technologies and Information Sciences