Skip to content
master
Switch branches/tags
Code

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
 
 
 
 
 
 
 
 
 
 
 
 

Project 2: Concurrent UNIX Processes and Shared Memory

This program reads in a list of strings and writes them to two separate output files based on whether or not the string is a palindrome. The output files are palin.out for palindromes, and nopalin.out for strings that aren't palindromes.

The program reads the strings into shared memory and forks off multiple processes to concurrently process the strings using a version of the Peterson's algorithm.

How to Build and Run

To build run make. Then run ./master < strings.

Important: The program reads in a maximum of 256 strings of 256 length.

For more information read cs4760Assignment2Fall2017Hauschild.pdf.

About

A program demonstrating concurrent UNIX processes and shared memory.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published