Expert Overview: Nomme United vs Tartu JK Welco

The upcoming match between Nomme United and Tartu JK Welco is set to be an exciting encounter with high stakes for both teams. Nomme United, playing at home, will aim to leverage their familiarity with the pitch to secure a victory. Conversely, Tartu JK Welco will need to be strategic in their play to counter the home advantage and capitalize on any opportunities that arise.

Statistical analysis indicates a high-scoring affair is likely, with the average total goals expected to reach 4.41. Both teams have demonstrated offensive capabilities throughout the season, making it probable that we will see a match rich in goals. The betting odds suggest confidence in the likelihood of over 1.5 goals occurring, making this a key consideration for bettors.

Betting Predictions

Goals and Scoring Opportunities

• Over 1.5 Goals: With odds at 85.10, this bet is highly favored, reflecting expectations of a dynamic match.
• Over 0.5 Goals HT: At odds of 79.00, it’s likely that both teams will score in the first half.
• Over 2.5 Goals: Odds of 75.60 suggest a high likelihood of a goal-rich match.
• Over 3.5 Goals: Though less likely at odds of 54.50, this bet indicates potential for an explosive encounter.
• Avg. Total Goals: 4.41
• Avg. Goals Scored: 3.47
• Avg. Conceded Goals: 1.14

Timing and Team Performance

• Home Team To Score In 1st Half: With odds at 79.50, Nomme United is expected to strike early.
• Away Team To Score In 1st Half: Odds at 70.00 show Tartu JK Welco has a strong chance to respond quickly.
• Home Team To Score In 2nd Half: At odds of 75.60, Nomme United is also favored to continue their offensive pressure.
• Away Team To Score In 2nd Half: Odds of 84.70 indicate Tartu JK Welco could capitalize later in the game.
• Both Teams Not To Score In 2nd Half: Odds of 73.90 suggest there might be a lull after an eventful first half.
• Both Teams Not To Score In 1st Half: Odds at 67.40 imply an initial defensive approach by both sides.
• Over 1.5 Goals HT: At odds of 65.50, scoring in the first half is anticipated.

Potential Outcomes

mohitbansal94/TermProject-Parallel-Computing/Task-2/saxpy.h
#include
#include
#include
using namespace std;

void saxpy(int n,float alpha,float *X,float *Y,float *Z)
{
for(int i=0;i<n;i++)
{
Z[i]=alpha*X[i]+Y[i];
}
}

void readData(float *A,int n,int rank)
{
int i=0;
ifstream file;
file.open("input.txt");
for(i=0;i>A[i];
}
file.close();
}

void writeData(float *Z,int n,int rank)
{
int i=0;
ofstream file;
file.open(“output.txt”,ios::app);
for(i=0;i<n/size;i++)
{
file<<Z[i]<<endl;
}
file.close();
}mohitbansal94/TermProject-Parallel-Computing/Task-1/Makefile
all:
mpic++ -o MPI main.cpp

run:
mpirun -np $(n) ./MPI

clean:
rm -rf MPI *.txt
#include
#include “mpi.h”
#include “saxpy.h”
using namespace std;

int main(int argc,char **argv)
{
int n,i,j,k,p,size,rank;
float alpha,*X,*Y,*Z;

MPI_Init(&argc,&argv);
MPI_Comm_size(MPI_COMM_WORLD,&size);
MPI_Comm_rank(MPI_COMM_WORLD,&rank);

n=100000000;
X=new float[n];
Y=new float[n];
Z=new float[n];

alpha=2;

readData(X,n,rank);
readData(Y,n,rank);

saxpy(n/size,alpha,X,Y,Z);

writeData(Z,n,rank);

MPI_Finalize();
return(0);
}mohitbansal94/TermProject-Parallel-Computing/Task-1/main.cpp
#include
#include “mpi.h”
#include “transpose.h”
using namespace std;

int main(int argc,char **argv)
{
int i,j,k,n,p,size,rank,totR,totC;
float *A,*B,*C;

MPI_Init(&argc,&argv);
MPI_Comm_size(MPI_COMM_WORLD,&size);
MPI_Comm_rank(MPI_COMM_WORLD,&rank);

n=10000;
A=new float[n*n];
B=new float[n*n];
C=new float[n*n];

totR=n/size;
totC=n/size;

readData(A,n,n,rank);

trans(A,B,n,totR,totC,size,rank);

writeData(C,n,n,size,rank);

MPI_Finalize();
return(0);
}mohitbansal94/TermProject-Parallel-Computing/Task-2/transpose.cpp
#include
#include “mpi.h”
#include “transpose.h”
using namespace std;

void readData(float *A,int n,int size,int rank)
{
int i=0,j=0;
ifstream file;
file.open(“input.txt”);
for(i=0;i<n*size;i++)
{
for(j=0;j>A[j+i*n*size];
}
}
file.close();
}

void writeData(float *C,int n,int size,int p,int rank)
{
int i,j;
ofstream file;
if(rank==0)
{
file.open(“output.txt”);
for(i=0;i<n*size;i++)
{
for(j=0;j<n*size;j++)
{
file<<C[j+i*n*size]<<" ";
}
file<<endl;
}
file.close();
}
else
{
for(i=(n*size)/p*rank+totR*(totC+1);i<(n*size)/p*(rank+1);i++)
for(j=totC*(totR+1);j<(n*size);j+=totR+1)
C[j+i*(n*size)]=0;

MPI_Send(C,(n*size)*(totR+1),MPI_FLOAT,(p-1)%p,(rank+1)%p,MPI_COMM_WORLD);

if(rank==0)
MPI_Recv(C,(n*size)*(totR+1),MPI_FLOAT,p-1,p,MPI_COMM_WORLD,MPI_STATUS_IGNORE);

if(rank!=(p-1))
MPI_Send(C,(n*size)*(totR+1),MPI_FLOAT,(rank+1)%p,(rank+2)%p,MPI_COMM_WORLD);

if(rank!=(p-2))
MPI_Recv(C,(n*size)*(totR+1),MPI_FLOAT,(rank+2)%p,(rank+1)%p,MPI_COMM_WORLD,MPI_STATUS_IGNORE);

}

void transpose(float *A,float *B,int n,int totR,int totC,int p,int rank)
{
int i,j,k,l,tempRow,tempCol,tempRowSend,tempColSend,r,c,iStart,iEnd,jStart,jEnd,rowStart,colStart,rowEnd,colEnd,sender,receiver;

iStart=(n*totR)/p*rank+totR*(totC+1);
iEnd=(n*totR)/p*(rank+1)+totR*(totC+1)-1;

jStart=totC*(totR+1);
jEnd=n*totC+jStart;

tempRow=(n*totR)/p;
tempCol=totC*n;

for(k=iStart;k<iEnd;k+=totR+1)
for(l=jStart;l<jEnd;l+=totR+1)
{
B[l+k*n]=A[k+l*n];
}

if(rank==0)
{
tempRowSend=tempRow/totC;
tempColSend=tempCol/totC;

rowStart=totR*(totC+1);
colStart=totC*n+totC*(totR+1);
rowEnd=rowStart+(tempRowSend-1)*totC+totC;
colEnd=colStart+(tempColSend-1)*totR+totR;

for(k=rowStart;k<rowEnd;k+=totC)
for(l=colStart;l<colEnd;l+=totR)
B[l+k*n]=A[k+l*n];
}
else if(rank!=((int)(p/2))-1 && rank!=((int)(p/2)))
{
tempRowSend=tempRow/totC;
tempColSend=tempCol/totC;
rowStart=totR*(totC+1)+((k-iStart)/((totR+1)))*tempRowSend*totC+totC*((k-iStart)%((totR+1)));
colStart=totC*n+totC*(totR+1)+((l-jStart)/((totR+1)))*tempColSend*totR+totR*((l-jStart)%((totR+1)));
rowEnd=rowStart+(tempRowSend-1)*totC+totC;
colEnd=colStart+(tempColSend-1)*totR+totR;

for(k=rowStart;k<rowEnd;k+=totC)
for(l=colStart;l<colEnd;l+=totR)
B[l+k*n]=A[k+l*n];

sender=((int)(p/2))-((int)(rank/2))+(((int)(rank%2))*(((int)(p%2))+((int)(p%4))))*(((int)((double)p/(double)4))+(int)((double)p/(double)4));
receiver=((int)(p/2))+(((int)(rank%2))*(((int)(p%4))+((int)(p%2))))*(((int)((double)p/(double)4))+(int)((double)p/(double)4))+(int)(rank/2);

MPI_Sendrecv(B,tempCol,totRow,MPI_FLOAT,sender,B,tempRow,totCol,MPI_FLOAT,receiver,MPI_COMM_WORLD,MPI_STATUS_IGNORE);

tempRowSend=tempRow/totRow;
tempColSend=tempCol/totCol;
rowStart=totRow*(totCol+1)+((k-iStart)/((totRow+1)))*tempRowSend*totCol+totCol*((k-iStart)%((totRow+1)));
colStart=totCol*n+totCol*(totRow+1)+((l-jStart)/((totRow+1)))*tempColSend*totRow+totRow*((l-jStart)%((totRow+1)));
rowEnd=rowStart+(tempRowSend-1)*totCol+totCol;
colEnd=colStart+(tempColSend-1)*totRow+totRow;

for(k=rowStart;k<rowEnd;k+=totCol)
for(l=colStart;l<colEnd;l+=totRow)
B[l+k*n]=A[k+l*n];
}
else if(rank==((int)(p/2))-1 || rank==((int)(p/2)))
{
tempRowSend=tempRow/totC;
tempColSend=tempCol/totC;
rowStart=totR*(totC+1)+((k-iStart)/((totR+1)))*tempRowSend*totC+totC*((k-iStart)%((totR+1)));
colStart=totC*n+totC*(totR+1)+((l-jStart)/((totR+1)))*tempColSend*totR+totR*((l-jStart)%((totR+1)));
rowEnd=rowStart+(tempRowSend-1)*totC+totC;
colEnd=colStart+(tempColSend-1)*totR+totR;

for(k=rowStart;k<rowEnd;k+=totC)
for(l=colStart;l<colEnd;l+=totR)
B[l+k*n]=A[k+l*n];

if(rank==(((int)(p/2))-(((int)(p%4))/2)))
receiver=((int)(p/2))+(((int)(p%4))/2)+(((int)(rank%2))*(((int)(p%4))+((int)(p%2))))*(((int)((double)p/(double)4))+(int)((double)p/(double)4)));
else
receiver=((int)(p/2))-(((int)(p%4))/2)-(((int)((!(rank%2))))*(((int)(p%4))+((int)(p%2))))*(((int)((double)p/(double)4))+(int)((double)p/(double)4)));

MPI_Sendrecv(B,tempCol,totRow,MPI_FLOAT,sender,B,tempRow,totCol,MPI_FLOAT,receiver,MPI_COMM_WORLD,MPI_STATUS_IGNORE);

tempRow=tempColumn/n;
tempColumn=tempColumn/n;

if(rank==((((!(((int)((!(rank%2))))*(((int)(p%4))+((int)(p%2))))*(((int)((double)p/(double)4))+(int)((double)p/(double)4)))))?
(((((((!((( ( p % ( ( int ) ( p / ( int ) ( p / ( int ) ( p / ( int ) ( p / (( int ) ( p / ( int ) ( p / ( int ) p )) + ( int ) p % ( int ) p )) + ( int ) p % ( int ) p )) + ( int ) p % ( int ) p )) + ( int ) p % ( int ) p )) + ( int ) p % ( int ) p )) + ( int ) p % ( int ) p )) + ( int ) p % ( int ) p )) + (( int )( size / size ))) : (((((((!((( !((((!((((!((((!((((!((((!((((!((((!((((!((((!((((!((((!((((!((((!(((( !(((( !(!(!(!(!(!(!(!(!(!(!(!(!(!(!(!( (( !( !!( !(!( !( !( !( !( !( !( !( !( !( !( !( !( !(!( !( !( !( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( !!( (!( size / size ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) ))))))))) )))))), ((( ((( (( (((( (((( (((( (((( (((( (( (( (( (( (( (( (( (( (( (

)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
)
),
),
),
),
),
),
),
),
),
),
),
),
),
),
),
),
),
),
),

: ((( (((( ((( ((( ((( ((( ((( ((( ((( ((( ((( ((( ((( ((( ((( (
(!(((!( (( (!( (!(!( (!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (!( (!(!( (
size / size
));
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);
);

,sender));
,receiver));

if(rank==((((!(((!!(size / size ))*(((!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!(!!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!(
!!!(
size / size
))*(((!!!((((!!!((((!!!((((!!!((((!!!((((!!!((((!!!((((!!!((((!!!((((!!!({
!!!,
!!!,
!!!,
!!!,
!!!,
!!!,
!!!,
!!!,
!!!,
!!!,
!!!,