Ticker

6/recent/ticker-posts

Program of Lamport's Logical Clock in C language.

Hi Friend's today I gonna talk about Lamport’s Logical Clock. 

*Program of Lamport's Logical Clock in C language.

Code :

#include<stdio.h>
#include<conio.h>
int max(int a,int b);
int main()
{
    int i,j,k,p1[20],p2[20],e1,e2,dep[20][20];
    printf("*** Lamport's Logical Clock ***\n");
    printf("Enter the events : ");
    scanf("%d %d",&e1,&e2);
    for(i=0;i<e1;i++)
        p1[i]=i+1;
    for(i=0;i<e2;i++)
        p2[i]=i+1;
    printf("Enter the Dependency matrix:\n");
    printf("\nEnter 1 if E1->E2 \nEnter -1, if E2->E1 \nElse Enter 0 \n\n");
    printf("  ");
    for(i=0;i<e2;i++)
        printf(" e2%d",i+1);
    for(i=0;i<e1;i++){
        printf("\ne1%d ",i+1);
        for(j=0;j<e2;j++){
            scanf("%d",&dep[i][j]);
        }
    }
    for(i=0;i<e1;i++){
        for(j=0;j<e2;j++){
            //change the Time stamp if dependency exist
            if(dep[i][j]==1){
                p2[j]=max(p2[j],p1[i]+1);
                for(k=j;k<e2;k++)
                    p2[k+1]=p2[k]+1;
            }
            //change the Time stamp if dependency exist
            if(dep[i][j]==-1){
                p1[i]=max(p1[i],p2[j]+1);
                for(k=i;k<e1;k++)
                    p2[k+1]=p1[k]+1;
            }
        }
    }
    //to print the outcome of Lamport Logical Clock
    printf("\nP1 : ");
    for(i=0;i<e1;i++){
        printf("%d",p1[i]);
    }
    printf("\nP2 : ");
    for(j=0;j<e2;j++)
    printf("%d",p2[j]);
    getch();
    return 0 ;
}
//to find the maximum timestamp between two events
int max(int a, int b)
{
            if (a>b)
        return a;
    else
    return b;

}


The Output Of this Program :


Post a Comment

4 Comments

  1. This comment has been removed by the author.

    ReplyDelete
  2. You did a little wrong as in case of dep[i][j]=-1
    as your loop is from i to e1 your code should be
    p1[k+1]=p1[k]+1;
    but you are doing
    p2[k+1]=p1[k]+1;
    which is wrong as it is logically wrong and if e1 > e2 you will end in space error

    ReplyDelete
  3. Super article I appreciate your hard work. Thanks for share the valuable information with us.

    Find out the best home tutor & home tuition near your area

    ReplyDelete
  4. IT WORKS GOOD SOME COMMENTS REQUIRED

    ReplyDelete