https://github.com/kedyn/cpsc474-project2

Project 2 for Distributing Computing
https://github.com/kedyn/cpsc474-project2

Last synced: 30 days ago
JSON representation

Project 2 for Distributing Computing

• Host: GitHub
• URL: https://github.com/kedyn/cpsc474-project2
• Owner: Kedyn
• License: mit
• Created: 2018-12-03T16:40:22.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2018-12-12T17:26:50.000Z (about 6 years ago)
• Last Synced: 2024-11-07T13:56:09.384Z (3 months ago)
• Language: C
• Size: 8.79 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# CPSC474-Project2

Project 2 for Distributing Computing

We will solve this using: Franklin’s algorithm (week8_1 slides).

We will start by using 5 number of processes, where 0 to 4 are the IDs.

0 has neighbors: 1 and 2 (1 on the left, 2 on the right).  

1 has neighbors: 3 and 0  

2 has neighbors: 0 and 4  

3 has neighbors: 4 and 1  

4 has neighbors: 3 and 2  

```

   0

 /   \

1     2

|     |

3-----4

```

```

         00

        /  \

      10    13

     /        \

   01          05

  /              \

06                08

|                  | 

03                07

  \              /

   09          02

     \        /

      12    11

        \  /

         04

```