GRID NETWORKING [Www.ebookmaterials.blogspot.com]

7/17/2019 GRID NETWORKING [Www.ebookmaterials.blogspot.com]

http://slidepdf.com/reader/full/grid-networking-wwwebookmaterialsblogspotcom 1/15

www.ebookmaterials.blogspot.com www.ebmfiles.com

Mr. Siva sandeep Mr. Naveen

[email protected] [email protected]

B.TECH. (IT) B.TECH. (IT)

Guided By

Prof. Mr. R. Praveen kumar

Information technology ( Asst. Proffessor )

.R.SI!!H"RTH" ENGINEERING C#$$EGE

i%aya&ada.

Indeing the things!..

"

http://www.ebookmaterials.blogspot.com/

http://www.ebmfiles.com/

mailto:[email protected]









#

$r. %o. &oncept Page %o.

' Inroduion '

* Grid +

+ Types of Grid +

, Ho& i &orks- ,

/oS(/ua0iy of Servie) Guided S1edu0in2

"02ori1m

3 "r1ieure 3

4 Grid Componens 4

5 Grid Sof&are Componens 5

6 E7amp0e89 :nied !evies Caner Resear1

Pro%e

6

'; Business < Te1no0o2ia0 Benefis from Grid

ompuin2

';

'' Comparin2 &i1 o1er disri=ued ompuin2

sysems-

''

'* $imiaion of Grid Compuin2 ''

'+ G0o=us Too0ki '*

', T1e >uure '*

' Con0usion '*








GRI! C#MP:TING

'.' Inroduion89

I"N >#STER

'








When the network is as fast as the computer's internal links, the machine disintegrates

across the net into a set of special purpose appliances.

-- ilder echnology *eport+ ,-ne #000.

?:nied &e sand@ divided &e fa00A+ is the key idea behind grid comp-ting. rid is a type of

para00e0 and disri=ued sysem that enables the sharing+ selection+ and aggregation of

2eo2rap1ia00y disri=ued auonomous resoures dynamia00y a runime depending on their

availability+ capability+ performance+ cost+ and -sers /-alityofservice re/-irements.

rid comp-ting is a critical shift in thinking abo-t how to ma7imie 1e va0ue

of ompuin2 resoures. It allows -s to -nite pools of servers+ storage systems and networks into a

single large system so we can deliver the power of m-ltiplesystems reso-rces to a single -ser point

for a specific p-rpose. o a -ser+ data file+ or an application+ the system appears to be a sin20e@

enormous virua0 ompuin2 sysem.

rid comp-ting is the net logical step in distrib-ted networking. ,-st as the

Internet allows -sers to share ideas and files as the seeds of pro1ects+ grid comp-ting lets -s share the

reso-rces of disparate comp-ter systems. T1e ma%or purpose of a 2rid@ is o virua0ie resoures o

so0ve pro=0ems. $o+ rather than -sing a network of comp-ters simply to comm-nicate and transfer

data+ grid comp-ting taps the -n-sed processor cycles or n-mero-s i.e. tho-sands of comp-ters.

'.* !efiniion89 A means of network comp-ting that harnesses the -n-sed processing cycles of

n-mero-s comp-ters+ to solve intensive problems that are often too large for a single comp-ter to

handle+ s-ch as in life sciences or climate modeling.

'.+ #ri2in89

Its roots lies in early distrib-ted comp-ting pro1ects that date back to the "230s As a

res-lt+ grid has become a centerpiece of the 4-tility comp-ting4 marketing drive taken -p by nearly

every vendor.

'.,P1ases D1isory

5








a) >irs 2eneraion89>">NER (actoring via %etwork7nabled *ec-rsion) and I9F" are the two

first generation grid comp-ting methods. A%7* is 8ased on p-blic key encryption algorithm+ was

-sed factori9e etremely large n-mbers

=) Seond 2eneraion ore e1no0o2ies

G$#B:S8

It is based on glob-s toolkit reso-rce allocation manager+ an etended version of P protocol+ which

enables data access+ partial file access management at high speed.

) T1ird 2eneraion sysems

hese system follows properties of a-tonomy s-ch as

". :etail knowledge of its component and stat-s

#. ;-st config-re reconfig-re itself dynamically

'. able to recover from malf-nction

5. Protect itself against attack

he third generation grid comp-ting involves -se of different techni/-es s-ch as

<;=+ 1ava+ ,#77 etc.

!ifferen Types89:istrib-ted ob1ect system it is based on &ommon *e/-est 8roker Architect-re

(&>*8A) . ?e can -se 1ava with &>*8A -p to certain etent as it provides distrib-ted ob1ect

thro-gh *;I. ,ava has drawbacks in terms of comp-tation speed.

ini and RMI89,ini is designed to provide a software infrastr-ct-re that can form distrib-ted

comp-ting environment .in this application is -s-ally written in 1ava and comm-nication -sing *;I.

ey concepts of 1ini are $ookup+ !isovery@ $easin2 + Remoe evens and Transaion .

'. Need 89he best candidates for grid are applications that r-n the same or similar comp-tations

on tho-sands or millions of pieces of data+ with no single calc-lation dependent on those that came

before.

*. Grid89

rids are -s-ally 1eero2eneous ne&orks. rid nodes+ generally individ-al comp-ters+

consist of different hardware and -se a variety of operating systems and networking to








connecting them vary in bandwidth. hese reso-rces are -sed among the vario-s pro1ects.

his forms the system as the aggregation of reso-rces for a partic-lar task i.e. virua0

or2aniaion.

Simp0e Grid !ia2ram

+. Types of Grid89

+.'Compuaiona0 Grid89 It is foc-sed on sein2s aside resoures specifically for comp-ting

power .In this type of grid most of machines are 1i21 performane servers.

+.* Saven2in2 Grid89It is most commonly -sed with large n-mbers of deskop ma1ine.

;achines are scavenged for available &PB cycles and other reso-rces. >wners of desktop

machines are -s-ally 2iven onro0 over when their reso-rces are available to grid.

+.+ !aa Grid89It is responsible for ho-sing and providing access to daa aross mu0ip0e

or2aniaions. Bsers are not concerned with where this data is located as long as they access to the

data .

, Ho& i &orks-

rid comp-ting -ses networked cl-sters of &PBs connected over the Internet+ a

company intranet or a corporate ?A%. he res-lting network of &PBs acts as a fo-ndation for a set of

2rid9ena=0in2 sof&are oo0s. hese tools let the grid accept a large comp-ting 1ob and break it down

6








into tens+ h-ndreds or tho-sands of independent tasks. he tools then search the grid for available

reso-rcesC assign tasks to processors+ aggregate the work and spit o-t one final res-lt.

A grid -ser installs the provided 2rid sof&are (for -sing the grid as well as

donating to the grid) on his machine and gets connected with Internet. he -ser establishes his identitywith a erifiae au1oriy. his sof&are may =e auomaia00y reonfi2ured by the grid

management system o kno& 1e ommuniaion address of 1e mana2emen nodes in 1e 2rid

and user or ma1ine idenifiaion informaion.

o -se the grid+ most grid systems re/-ire the -ser to log on to a system -sing a

-ser I: that is enrolled in the grid. >nce logged on+ the -ser can /-ery the grid and s-bmit 1obs. rid

systems -s-ally provide command line tools as well as graphical -ser interfaces (G:Is) for ueries.

&ommand line tools are especially -sef-l when the -ser wants to write a script.

,ob s-bmission -s-ally consists of three parts+ even if there is only one command re/-ired.

$ome inp-t data and possibly the eec-table program or eec-tion script file are sent to the

machine to eec-te the 1ob. $ending the inp-t is called ?sa2in2 1e inpu daa.A

he %o= is e7eued on 1e 2rid ma1ine.

he resu0s of 1e %o= are sent back to the s-bmitter. ?hen there are a large n-mber of s-b

1obs+ the work re/-ired to collect the res-lts and prod-ce the final res-lt is -s-ally

accomplished by a single program

. a /oS (/ua0iy of Servie) 2uided s1edu0in2 a02ori1m

$ched-ler is the main part of grid comp-ting. In the three main phases of sched-ler+ first is resoure

disovery+ second phase involves 2a1erin2 informaion a=ou resoures and 1oosin2 1e =es ma1

for app0iaion reuiremen. In third phase the %o= is e7eued. he sched-ling algorithms are mainly

divided into two categoriesD on0ine mode and =a1 mode. In Minimum Comp0eion Time@ grid system

assigns the task to the machine+ that will have earliest completion time+ and in Minimum E7euion

Time+ it assigns the task to the machine that performs task+ in least eec-tion time.

Min9min a02ori1m

F1i0e there are tasks to sched-le

E








>or all tasks to sched-le

>or all hosts

&omp-te the epected completion time

end >or

&omp-te metric

&omp-te minim-m completion time

$ched-le the task

end F1i0e

for all tasks t i in metatask M v (in an arbitrary order)

for all hosts m j (in a fied arbitrary order)

comp-te completion time

do -ntil all tasks with high Fo$ re/-est in M v are mapped

for each task with high Fo$ in M v+ find a host in the Fo$ /-alified

host set that obtains the earliest completion time

find the task t kwith the minim-m earliest completion time

assign task t k to the host ml that gives it the earliest completion time

delete task t k from M v

-pdate CT il for all i

end do

do -ntil all tasks with low Fo$ re/-est in M v are mapped

for each task in M v find the earliest completion time and the

corresponding host

find the task t k with the minim-m earliest completion time

assign task t k to the host ml that gives it the earliest completion time

delete task t k from M v

-pdate CT il for all i

end do

he os (prioriy =ased a02ori1m) finds the minim-m earliest completion time and assign the task to the

host which gives the least completion time to it .inally the low /os tasks are also mapped. his algorithm

improves efficiency by abo-t ''J.

3








. = Tree 0oad =a0anin2 a02ori1ms

he =8A algorithm+ named ree =oad 8alancing Algorithm+ creates a virua0 ineronnein2 ree

(non9y0i onneed 2rap1) among the comp-ters of the system. >n this tree+ each comp-ter of an N

level sends its -pdated load information to the N-1 level comp-ters. he selection of the best comp-ter + to

eec-te a process+ received by the system+ works as a deep search on the interconnecting tree.

6. "RCHITECT:RE8

?e will st-dy the architect-re from the >pen rid $ervices Architect-re (>$A)+ developed

by the members of the lobal rid or-m ().8-ilding on eisting ?eb services

standards+ the #GS" defines a 2rid servie as a Fe= servie that conforms to a partic-lar set

of conventions. ?orking gro-ps in organi9ations like the G0o=a0 Grid >orum and #"SIS are

b-sy defining an array of grid standards in areas like "pp0iaions and pro2rammin2

mode0s@ "r1ieure@ !aa mana2emen@ Seuriy@ Performane@ S1edu0in2 and

resoure mana2emen.

4 Grid Componens89

4.'P ora0K:se

r

Inerfae

89" grid users1ou0d

no see a00 of

1e

omp0e7iies of 1e ompuin2 2rid. rom this perspective+ the -ser sees the grid as a virt-al

comp-ting reso-rce 1-st as the cons-mer of power sees the receptacle as an interface to a virt-al

generator.4.* Seuriy89 At the base of any grid environment+ there m-st be mechanisms to provide sec-rity+

incl-ding a-thentication+ a-thori9ation+ data encryption+ and so on. he rid $ec-rity Infrastr-ct-re

(GSI) component of the lob-s oolkit provides ro=us seuriy me1anisms. he $I incl-des an

#pen SS$ implementation. It provides a sin20e si2n9on me1anism@ so that once a -ser is

a-thenticated+ a proy certificate is created and -sed when performing actions within the grid

2








4.+ Broker89>nce a-thenticated+ the -ser will be la-nching an application. 8ased on the application+

and possibly on other parameters provided by the -ser+ the net step is to identify the available and

appropriate reso-rces to -se within the grid. his task co-ld be carried o-t by a =roker funion

4., S1edu0er89>nce the reso-rces have been identified+ the net logical step is to sched-le the

individ-al 1obs to r-n on them. If a set of standalone 1obs are to be eec-ted with no

interdependencies+ then a speciali9ed sched-ler may not be re/-ired. Gowever+ if yo- want to reserve

a specific reso-rce or ens-re that different 1obs within the application r-n conc-rrently+ then a 1ob

sched-ler sho-ld be -sed to coordinate the eec-tion of the 1obs. T1e G0o=us Too0ki does no

in0ude su1 a s1edu0er@ =u 1ere are severa0 s1edu0ers avai0a=0e 1a 1ave =een esed &i1

and an =e used in a lob-s grid environment.

4. !aa Mana2emen89If any data incl-ding application mod-les m-st be moved or made accessible

to the nodes where an applications 1obs will eec-te+ then there needs to be a sec-re and reliable

method for moving files and data to vario-s nodes within the grid. he lob-s oolkit contains a data

management component + rid Access to $econdary $torage (G"SS) (facilities like Grid >TP)

4.3 o= and Resoure Mana2emen89. he rid *eso-rce Allocation ;anager (GR"M) provides

the services to act-ally la-nch a 1ob on a partic-lar reso-rce+ check its stat-s+ and retrieve its res-lts

when it is complete.

5. Grid Sof&are Componen89

5.' Mana2emen Componen8 here is a component that keeps track of the reso-rces available

to the grid and which -sers are members of the grid.here are measuremen omponens and

"dvaned 2rid mana2emen sof&ares.

5.* !onor Sof&are89It m-st be able to receive the eec-table file or select the proper one from

copies preinstalled on the donor machine. he software is eec-ted and the o-tp-t is sent back to the

re/-ester .

5.+ Su=mission Sof&are89 Bs-ally any member machine of a grid can be -sed to s-bmit 1obs to the

grid and initiate grid /-eries. Gowever+ in some grid systems+ this f-nction is implemented as a

separate component installed on su=mission nodes or su=mission 0iens.

5., S1edu0ers89 his software locates a machine on which to r-n a grid 1ob that has been s-bmitted

by a -ser. $ched-lers -s-ally react to the immediate grid load and arranged hierarchically.

"0








5. Communiaions89 A grid system may incl-de software to help 1obs comm-nicate with each

other Gowever+ the app0iaion may imp0emen an a02ori1m that re/-ires that the s-b 1obs

comm-nicate some information among them.T1e open sandard Messa2e Passin2 Inerfae (MPI)

and any of several variations is often incl-ded as part of the grid system for 1-st this kind

comm-nication.

5.3 #=servaion@ Mana2emen and Measuremen89his software is referred to as a sensor@ for

implementing c-stom load sensors for other than &PB or storage reso-rces. It forms the basis for grid

resoure =rokerin2+ or to mana2e prioriies more fair0y.

6. E7amp0e #f Grid Compuin289 United Devices Cancer Research Proect

he :nied !evies Caner Resear1 Pro%e will research to -ncover new cancer dr-gs thro-gh the

combination of 1emisry@ ompuers@ speia0ied sof&are@ or2aniaions and individua0s who

are committed to fighting cancer. he research centers on proteins+ which have been determined to be

a

possible target for cancer therapy+ wo-ld go thro-gh a process called virua0 sreenin2+ special

analysis software ($i2and>i) will identify molec-les that interact with these proteins+ and will

determine which of the molec-lar candidates has a high likelihood of being developed into a dr-g.

he

process is similar to finding the right key to open a special lock H by looking at millions -pon

millions of molec-lar keys.

Pariipans in the Bnited :evices &ancer *esearch Pro1ect (s1o&n =e0o&) are sent a ligand

library over the Internet. heir P& will analy9e the molec-les -sing docking software called

$i2and>i =y "e0rys. he =igandit software analy9es the mo0eu0ar daa =y usin2 a 1ree9

""








dimensiona0 mode0 to attempt to interact with a protein binding site. ?hen a ligand docks

s-ccessf-lly with a protein the res-lting interaction is scored and the interactions that generate the

highest scores are recorded and filed for f-rther eval-ation.

';. Business < Te1no0o2ia0 Benefis >rom Grid Compuin28

Inrease produiviy =y providin2 users 1e resoures 1ey need on demand@ respond uik0y o

1an2in2 =usiness and marke demands@ reae virua0 or2aniaions 1a an s1are resoures

and daa@ e7p0oiin2 underui0ied resoures @ para00e0 CP: apaiy @Resoure =a0anin2 e.

Characteristic Cluster !rid P"P

ResourceManagement (i.e.

memory, objects, storage,

network access, etc)

&entrali9ed :istrib-ted :istrib-ted

Resource #wnership

$ing-lar

(>ften locked to a

single node to

prevent data

corr-ption)

$ing-lar or m-ltiple+

varies from platform

to platform

$ing-lar+ m-ltiple+ or

distrib-ted+ depending o

circ-mstance and

architect-re

Me1od of Resoure

"00oaion K S1edu0in2

&entrali9ed+

allocated according

config-ration

:ecentrali9ed %A+ there is no single

permanent host for

centrali9ed data or

reso-rce management.7verything is transient.

"#








$%ternal Representation$ingle Image $ingle or m-ltiple

image(s)

Bnknown+ it is

circ-mstantial

&nter#pera(ilit)

-aranteed within

a cl-ster

7nforced within a

framework

;-ltiple competing

standards

*uggested $+uipments;ostly highend+

high capability

systems

Gighend or

commodity systems

Any type+ incl-ding

wireless device and

embedded systems.

*caling # "6 way

(Altho-gh+

theoretically "#3J

is possible)

wo to tho-sands

-nits connection

heoretically+ infinite (I

act-ality+ it depends on

network backbone

transmission speed+

n-mber of clients+ type o

transmission protocol!.

Discover) echanism:efined

membership ($tatic

or :ynamic)

&entrali9ed inde+ as

well as+ m-ltiple

decentrali9ed

mechanisms.

Always decentrali9ed

discovery mechanism.

11. Limitations of Grid Computing:-

rid systems are less dynamic+ scalable and fa-lt tolerant as compared to P#P systems

%ot every application is s-itable or enabled for r-nning on a grid.

&ell-lar wireless networks are more constrained than traditional wired networks beca-se of

the limitations of bandwidth+ processing power and memory.

12. Globus Grid Toolkit :-

he open so-rce lob-s oolkit is a f-ndamental enabling technology for the 4ridK+ which

incl-des software services and libraries for reso-rce monitoring+ discovery and management+ pl-s

sec-rity and file management. In addition to being a central part of science and engineering

"'








pro1ects that total nearly a halfbillion dollars internationally+ the lob-s oolkit is a s-bstrate on

which leading I companies are b-ilding significant commercial rid prod-cts.

'+. T1e >uure898efore grid comp-ting moves into the commercial mainstream+ &7>s need to

learn more abo-t the technology and its possibilities+ and identify ways they can -se it. 8-t other

problems needed to be solved like are seuriy@ sandardiaion and ne& prooo0s for bringing

together a n-mber of operating systems+ vendor platforms and applications+ before grid comp-ting

becomes tr-ly widespreadHpartic-larly in the contet of interenterprise grids+ -tility models and

-ltimately a global grid. A n-mber of nonprofit gro-ps s-ch as the G0o=a0 Grid >orum@ 1e G0o=us

Pro%e and 1e Ne& Produiviy Iniiaive are working on sec-rity and standardi9ation iss-es.

',. Con0usion89$o we see+ grid comp-ting LisL 1e u0imae ki00erA e1no0o2y. he grid

comp-ting can be implemented -sing different technologies like <;=+ 1ava+ &>*8A and dynamia00y

a00oaes 1e resoures. he basic part is the s1edu0er of 1e 2rid ompuin2. he grid can be

implemented in inrane or on Inerne. he grid is -sed for large comp-tations in fields s-ch as

=ioe1no0o2y@ auomo=i0e@ media0 and many fie0ds. he grid can be implemented depending on

re/-irements of the application+ sec-rity+ and priority for task to be done. he sched-ler is the core item of

the gridC the algorithm can be depending on priority or reso-rces available or type of network available.

Altho-gh there is some limitation on wireless environment+ b-t it is f-t-re of comp-ting which will

eplore new ways for comp-ting in enterprise environment.

'.Referenes89

www.google.com

www.s-n.fr

"5



http://www.google.com/

http://www.sun.fr/

http://www.google.com/

http://www.sun.fr/






"





Documents

GRID NETWORKING [Www.ebookmaterials.blogspot.com]