The Scientific World Journal

Research Article

Energy Conservation Using Dynamic Voltage Frequency Scaling for Computational Cloud

Table 1

Derived Data Flow Graphs with respect to their algorithm patterns.
TypeData Flow Graph (DFG)Algorithm
Linear 
(a) Linear		If alg is unknown then
assume alg is linear algorithm
for to then
if
not equals   − then
alg is unknown
break 
end if
end for
end if
Geometric 
(b) Geometric		If alg is unknown then 
 Assume alg is a geometric algorithm 
For shift_h   1 to n − 2 then 
If (table[shift_][shift_h + 2])/(table[shift_][shift_h + 1]) 
not equals (table[shift_][shift_h + 1])/(table[shift_][shift_]) then 
 alg is unknown 
 break 
end if 
end for 
end if
Backtracking  
(c) Backtracking
If alg is unknown then
Assume alg is a backtraking algorithm
For to then
If table[shift_][shift_] is greater than then
alg equals unknown
shift_ equals 		Break 
end if 
If table[shift_][shift_] is equals to 1 then
alg equals unknown
shift_ equals  
break 
end if 
if table[shift_][shift_] equals table[shift_][shift_]
alg equals unknown
shift_ equals  
break 
end if 
for    greater than 1 and −⁢− then
if table[shift_][] equals table[shift_][shift_] then
for to shift_ then
back[table[shift_][]] equals 1;
end for
equals ;
end if
end for
end if
end for
-means clustering 
(d) -means clustering		_mean_tot equals 0;
 if alg equals unknown then
  assume alg is a means algorithm
for   to 2
for   to  
 _mean_tot equals 0
for to less than or equals  
 _mean_tot equals ;
end for
if not equals then
 alg is unknown
equals  
equals 2
break 
end if
end for
end for
end if
Warshall and Floyd’s 
(e) Warshall and Floyd’s		If alg is unknown then
Assume alg is warshal/floyd
For to end of data flow table
shift_ equals 1;
While table[shift_][shift_] not equals end of line
If table[shift_][shift_] greater than no. of edges∧3
then
alg equals unknown
break
end if
++ 
wend 
If not equals no. of edges∧3 then
alg equals unknown
Break
End if
End for
End if
Binary 
(f) Binary		If alg is unknown then
Assume alg is binary
For to less than then
if (table[][]) not equals (table[][])/2) 
alg is unknown
break 
end if
end for
end if
Merge 
(g) Merge		If alg is unknown
Assume alg is a merge algorithm
for to less than  
If (table[shift_][shift_]) not equals (table[shift_][shift_])/2
alg is unknown
break 
end if
end for
for to less than  
if (table[shift_][shift_]) not equals  
alg is unknown
break 
end if
end for
end if