Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Download
Standard view
Full view
of .
Look up keyword
Like this
0Activity
0 of .
Results for:
No results containing your search query
P. 1
Const1

Const1

Ratings: (0)|Views: 5|Likes:
Published by Sean DerSchaf Con

More info:

Published by: Sean DerSchaf Con on Dec 09, 2011
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

12/09/2011

pdf

text

original

 
The Dynamics of Grid Computing
December 9, 2011
Given a set
of 
nodes
ν 
i
|∀
0
< i < N 
+ 1
,ν 
i
. Each
ν 
i
has thefllowing property:1. Inertia : Any state
s
ν 
i,t
at time
t
is dependant on any previous state
s
ν 
i,t
1
.This dependancy is expressed with a factor
i
2. Charisma : It influences any other
ν 
k
with Charisma
i
3. It accepts the influence of any other node with acceptance
A
i,k
=
A
k,i
4. At any time
t
the node
ν 
i
connects or disconnects from the grid withprobability
c
or
d
respectively.5. Ignore the following for first run:(a) Target dependant charisma (intensity) . all targets get same(b) Effect of charisma (positive, negative)(c) memory : each stach will depend only on the step right behind it,not any other6. There is one master node.7.
s
ν 
i,t
=
i
(
s
ν 
i,t
1
)+
k
=
i
A
i,k
k
(
s
ν 
i,t
1
)+
(
t,i
)
.
random.
s
A
is the statevector of 
A
8. Fervor : The state of 
ν 
i
geting a positive feedback while
ν 
k
is present, andzero or negative otherwise. (opposite: Apathy)TASK:1. Experimentally determine
c
and
d
2. Equillibrium conditions and their dependance on different known paramemters.3. state evolution of the master node4. comparison of evolution of two random nodes5. breakdown conditons1

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->