https://github.com/r-gg/fb_arc_set

Parallelized solution to the Minimal Feedback Arc Set problem.
https://github.com/r-gg/fb_arc_set

inter-process-communication operating-systems

Last synced: 3 months ago
JSON representation

Parallelized solution to the Minimal Feedback Arc Set problem.

• Host: GitHub
• URL: https://github.com/r-gg/fb_arc_set
• Owner: r-gg
• License: apache-2.0
• Created: 2024-04-27T19:22:05.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2024-04-27T19:27:22.000Z (about 1 year ago)
• Last Synced: 2025-01-21T12:46:56.714Z (4 months ago)
• Topics: inter-process-communication, operating-systems
• Language: C
• Homepage:
• Size: 345 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Minimal Feedback Arc Set 

The algorithm removes cycles in a directed graph by removing the least edges possible. A set of edges that must be removed to make a graph acyclic is also called a **feedback arc set**; and the set with the least edges is a **minimal feedback arc set**.

## Implementation

There are two programs: a **generator** program and a **supervisor** program. 

Multiple generator processes generate random solutions to the problem and report their solutions to one supervisor process.

The supervisor process remembers the best solution so far. The processes communicate with each other by means of a circular buffer, which is implemented using shared semaphores and a shared memory.

## Example

![image](https://github.com/r-gg/fb_arc_set/assets/90387385/1b77a8a4-8046-45be-9117-7324643cb8a9)

### Invocation

![image](https://github.com/r-gg/fb_arc_set/assets/90387385/5d3d6271-c2ce-4db4-84b8-27f65b0b017d)