Any idea how to implement this algo rithm using C and C++. I am a ece student with very basic knowledge of C and how to implement the algo rithm. Please help
Input: Machine resource vector R= [ri,rj...] where ri is the no of resource of i and a data dependence graph G=(N,E) where each operation n in N labeled with its resource reservation table.each edge e (m,n) in E is labeled with <S,d> indicationg that n must execute no earlier than d clocks after node ni from Sth previous iteration.
Output: Software pipelined schedule S and an iteration interval T.
Main()
{
II= Min(II);
for(T=T0,T0+1,....Until all nodes in N are scheduled){
RT= an empty reservation table with T rows;
for(n in N in prioritized topological order)
{
s=max=p^ , in E(S(p)+d);
for(s= s0, s0+1...s0+T-1)
if(nodeschedule(RT,T,n,s) break;
if (n can not be schedule in RT) break;
}
}
}