Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 197449
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 11, 20262026-05-11T16:51:14+00:00 2026-05-11T16:51:14+00:00

Which IPC among message queues, shared memory and semaphores is easiest to convert to

  • 0
  1. Which IPC among message queues, shared memory and semaphores is easiest to convert to network IPC and which is the hardest.

  2. Would it be easier to convert System V shared memory to network IPC or Posix shared memory to network IPC

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-11T16:51:14+00:00Added an answer on May 11, 2026 at 4:51 pm

    As Henrik Gustafsson said:

    1. Message queues are by far the easiest IPC mechanism to convert to network. Semaphores are not designed to convey data, and shared memory typically needs semaphore-controlled access (or an equivalent mechanism) to provide proper control even on a single machine, let alone across a network. That said, System V message queues are probably the least widely used IPC mechanism.

    2. The conversion of any shared memory mechanism is approximately equally hard. The key point to note is that in fact you seldom if ever use ‘just shared memory’; there are other synchronizing tools in use too.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a problem with my program, which is using IPC message queue. Althought
I am working on a university assignment, based largely around IPC and shared memory.
I've been playing with message queues (System V, but POSIX should be ok too)
I have a bunch of programs which use IPC Semaphores to interact (semget). One
I have started reading message queues one of the IPC mechanism on Linux .But
I am trying to implement a real-time application which involves IPC across different modules.
I started to develop an application which consists of two parts. The whole system
I'm looking for some data to help me decide which would be the better/faster
I have a shared library say foo.so which contains a function called initialize() .
I have a little Android project going on which involves some IPC where client

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.