Inter-process communication (pipes, shared memory) in Operating Systems - Mini Project: Build & Apply

Inter-process Communication with Pipes and Shared Memory

📖 Scenario: You are working on a simple operating system simulation where two processes need to share information. One process will send a message, and the other will receive it. You will create data structures and configurations to simulate communication using pipes and shared memory.

🎯 Goal: Build a basic setup that represents inter-process communication using pipes and shared memory. You will create the initial data structures, configure communication parameters, implement the core logic for sending and receiving messages, and finalize the setup to simulate the communication.

📋 What You'll Learn

Create a dictionary to represent pipes with exact pipe names and empty message lists

Create a dictionary to represent shared memory segments with exact segment names and initial empty strings

Add a configuration variable for maximum message size

Implement a function to send a message through a pipe if it does not exceed the maximum size

Implement a function to write a message to shared memory

Add a final step to simulate receiving a message from a pipe and reading from shared memory

💡 Why This Matters

🌍 Real World

Inter-process communication is essential in operating systems to allow processes to exchange data safely and efficiently.

💼 Career

Understanding pipes and shared memory helps in roles like system programming, OS development, and software engineering where process communication is critical.

1

Create initial data structures for pipes and shared memory

Create a dictionary called pipes with keys 'pipe1' and 'pipe2', each having an empty list as value. Also create a dictionary called shared_memory with keys 'segment1' and 'segment2', each having an empty string as value.

Operating Systems

# Create pipes and shared_memory dictionaries with specified keys and empty values
# Your code here

Hint

Use dictionary syntax with exact keys and empty list or string values.

2

Add configuration for maximum message size

Create a variable called max_message_size and set it to 100 to limit the size of messages sent through pipes.

Operating Systems

pipes = {'pipe1': [], 'pipe2': []}
shared_memory = {'segment1': '', 'segment2': ''}
# Set max_message_size to 100
# Your code here

Hint

Just assign the number 100 to the variable max_message_size.

3

Implement functions to send messages through pipes and write to shared memory

Define a function called send_pipe_message(pipe_name, message) that adds message to pipes[pipe_name] only if the length of message is less than or equal to max_message_size. Also define a function called write_shared_memory(segment_name, message) that sets shared_memory[segment_name] to message.

Operating Systems

pipes = {'pipe1': [], 'pipe2': []}
shared_memory = {'segment1': '', 'segment2': ''}
max_message_size = 100
# Define send_pipe_message and write_shared_memory functions
# Your code here

Hint

Use len(message) to check size and append to the list for pipes. For shared memory, assign the message string directly.

4

Simulate receiving a message from a pipe and reading from shared memory

Create a variable called received_message that removes and stores the first message from pipes['pipe1'] if it is not empty. Also create a variable called shared_mem_content that stores the content of shared_memory['segment1'].

Operating Systems

pipes = {'pipe1': [], 'pipe2': []}
shared_memory = {'segment1': '', 'segment2': ''}
max_message_size = 100

def send_pipe_message(pipe_name, message):
    if len(message) <= max_message_size:
        pipes[pipe_name].append(message)

def write_shared_memory(segment_name, message):
    shared_memory[segment_name] = message

# Remove first message from pipes['pipe1'] if available and store in received_message
# Store shared_memory['segment1'] content in shared_mem_content
# Your code here

Hint

Use pop(0) to remove the first message from the pipe list safely.

Practice

1. Which of the following best describes a pipe in inter-process communication?

easy

A. A way to create new processes in the operating system

B. A memory area shared by multiple processes simultaneously

C. A method to encrypt data between processes

D. A channel that sends data in a stream from one process to another

Solution

1. Step 1: Understand what a pipe does

   A pipe is used to send data in a continuous stream from one process to another, allowing communication.

2. Step 2: Compare with other options

   Shared memory allows direct access to the same data, encryption is unrelated, and process creation is a different concept.

3. Final Answer:

   A channel that sends data in a stream from one process to another -> Option D

4. Quick Check:

   Pipe = Stream data channel [OK]

Hint: Pipes stream data between processes, shared memory shares data directly [OK]

Common Mistakes:

• Confusing pipes with shared memory
• Thinking pipes create processes
• Assuming pipes encrypt data

2. Which of the following is the correct syntax to create a pipe in a Unix-like operating system using C?

easy

A. pipe(int *fd);

B. pipe(fd);

C. pipe(int fd[2]);

D. pipe(fd[2]);

Solution

1. Step 1: Recall the pipe function signature

   The pipe function requires an integer array of size 2 passed by reference to store file descriptors.

2. Step 2: Match the correct syntax

   The correct syntax is pipe(fd); where fd is an integer array of size 2 declared before the call.

3. Final Answer:

   pipe(fd); -> Option B

4. Quick Check:

   pipe needs int array of size 2 [OK]

Hint: pipe() needs int array of size 2 as argument [OK]

Common Mistakes:

• Omitting the type in the argument
• Passing pointer instead of array
• Passing array without size

3. Consider the following pseudo-code using shared memory:

1. Create shared memory segment
2. Process A writes value 10 to shared memory
3. Process B reads value from shared memory
4. Process B writes value 20 to shared memory
5. Process A reads value from shared memory

What value will Process A read in step 5?

medium

A. 20

B. 10

C. 0

D. Undefined or error

Solution

1. Step 1: Track writes and reads in shared memory

   Process A writes 10, then Process B reads 10, then Process B writes 20.

2. Step 2: Determine what Process A reads after Process B's write

   Since shared memory is common, Process A will read the updated value 20.

3. Final Answer:

   20 -> Option A

4. Quick Check:

   Shared memory shows last written value [OK]

Hint: Shared memory shows latest written value to all processes [OK]

Common Mistakes:

• Assuming Process A reads its own old value
• Thinking reads cause errors
• Confusing shared memory with pipes

4. A programmer tries to use a pipe for communication but notices the reading process blocks indefinitely. What is the most likely cause?

medium

A. Shared memory was used instead of a pipe

B. The pipe was created with incorrect syntax

C. The writing process has not sent any data yet

D. The pipe buffer size is too large

Solution

1. Step 1: Understand pipe blocking behavior

   A reading process blocks if no data is available to read from the pipe.

2. Step 2: Identify the cause of blocking

   If the writing process has not sent data, the reader waits indefinitely for input.

3. Final Answer:

   The writing process has not sent any data yet -> Option C

4. Quick Check:

   Reader blocks if no data sent [OK]

Hint: Reader waits until writer sends data through pipe [OK]

Common Mistakes:

• Blaming syntax errors for blocking
• Confusing pipe with shared memory
• Assuming buffer size causes blocking

5. You want two processes to share a large data structure efficiently and allow both to read and write it. Which IPC method is best and why?

hard

A. Use shared memory because it allows direct access to the same data

B. Use sockets because they work over networks

C. Use message queues because they guarantee message order

D. Use pipes because they provide fast streaming of data

Solution

1. Step 1: Analyze requirements for sharing large data structure

   Efficient sharing with read/write access means processes need direct access to the same memory.

2. Step 2: Compare IPC methods

   Pipes stream data but are unidirectional and less efficient for large shared data. Message queues and sockets add overhead and are for message passing, not direct shared access.

3. Final Answer:

   Use shared memory because it allows direct access to the same data -> Option A

4. Quick Check:

   Shared memory = direct, efficient data sharing [OK]

Hint: Shared memory is best for large, read/write shared data [OK]

Common Mistakes:

• Choosing pipes for large data sharing
• Confusing message queues with shared memory
• Thinking sockets are best for local IPC