top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Which is the fastest IPC mechanism and why ?

+2 votes
4,317 views
Which is the fastest IPC mechanism and why ?
posted Sep 9, 2013 by Vikram Singh

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

2 Answers

+3 votes

Shared memory is faster because the data is not copied from one address space to another, memory allocation is done only once, andsyncronisation is up to the processes sharing the memory. mostly, shared memory just give more control but if you use your shared memory like a pipe, it probably won't make much difference depending on your kernel implementation.

answer Sep 9, 2013 by anonymous
+2 votes

The answer is simple, there is no ideal fastest solution to the problem. Each has its advantages and disadvantages, but one most definitely stands out above the others....... Shared Memory.

Why would this be one of the fastest? Minimal overhead. Overhead is generated whenever you make a call to another function. Be it a kernel or library, if your IPC makes no calls to any other function, then you've done away with a large bottleneck. Shared memory IPCs have no requirement for third party function calls.

answer Sep 9, 2013 by Luv Kumar
Similar Questions
+1 vote
Which is the best page replacement algorithm and Why? How much time is spent usually in each phases and why?

Which is the best page replacement algorithm and Why? How much time is spent usually in each phases and why?

0 votes
Which order of loops is fastest in matrix multiplication and why ? 
for(i=0;i<n;i++)
  for(j=0;j<n;j++)
     for(k=0;k<n;k++)
        C[i][j]+=A[i][k]*B[k][j];

In this algorithm, there are 6 combinations of loops : the one given above is ijk. The others are ikj,jki,jik,kij and kji. Which one executes the fastest and why?

...