Skip to content

added MIS Metivier A and Loui Matsushita West Leader Election, no pdfs #48

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
katerieul wants to merge 1 commit into
base: master
Choose a base branch
from
Open

added MIS Metivier A and Loui Matsushita West Leader Election, no pdfs #48

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions .idea/.gitignore
View file
Open in desktop

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

9 changes: 9 additions & 0 deletions .idea/distributed-framework.iml
View file
Open in desktop

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

8 changes: 8 additions & 0 deletions .idea/modules.xml
View file
Open in desktop

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

6 changes: 6 additions & 0 deletions .idea/vcs.xml
View file
Open in desktop

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

2 changes: 2 additions & 0 deletions Makefile
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -26,6 +26,7 @@ leader_undirected_ring_example:

leader_directed_clique_example:
go run example/leader_clique_async_loui_matsushita_west.go 10
go run example/leader_clique_async_loui_matsushita_west_2.go 10

leader_undirected_clique_example:
go run example/leader_clique_async_korach_moran_zaks.go 10
Expand Down Expand Up @@ -66,6 +67,7 @@ graphs_mst_example:
graphs_mis_example:
go run example/graphs_mis_sync_luby.go 20 0.25
go run example/graphs_mis_sync_metivier_c.go 20 0.25
go run example/graphs_mis_sync_metivier_a.go 20 0.25

graphs_ds_example:
go run example/graphs_ds_sync_lrg.go 10 0.70
Expand Down
15 changes: 15 additions & 0 deletions example/graphs_mis_sync_metivier_a.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
package main

import (
"fmt"
"github.com/krzysztof-turowski/distributed-framework/graphs/mis/sync_metivier_a"
"os"
"strconv"
)

func main() {
n, _ := strconv.Atoi(os.Args[len(os.Args)-2])
p, _ := strconv.ParseFloat(os.Args[len(os.Args)-1], 64)
fmt.Println(n, p)
sync_metivier_a.Run(n, p)
}
23 changes: 23 additions & 0 deletions example/leader_clique_async_loui_matsushita_west_2.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,23 @@
package main

import (
"fmt"
"github.com/krzysztof-turowski/distributed-framework/leader/clique/async_loui_matsushita_west_2"
"github.com/krzysztof-turowski/distributed-framework/lib"
"os"
"strconv"
)

func main() {
if len(os.Args) < 2 {
fmt.Println("No size specified.")
return
}
n, err := strconv.Atoi(os.Args[1])
if err != nil || n < 2 {
fmt.Println("Invalid size: ", n)
return
}
nodes, runner := lib.BuildHamiltonianOrientedCompleteGraph(n)
async_loui_matsushita_west_2.Run(nodes, runner)
}
241 changes: 241 additions & 0 deletions graphs/mis/sync_metivier_a/sync_metivier_a.go
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,241 @@
package sync_metivier_a

import (
"encoding/json"
"fmt"
"log"
"math"
"math/rand"

"github.com/krzysztof-turowski/distributed-framework/lib"
)

const (
None = iota
)

type State struct {
InGraph bool
InMIS bool
NeighborInMIS bool
SubPhaseNum int
RandomMin uint64
ReceivedMin uint64
AliveNeighbors map[int]bool
}

const (
phaseMin = iota
phaseClaim
phaseDecline
subPhases = 3
)

type Message struct {
MessageType int
Info uint64
}

const (
SendingMinimum = iota
JoiningMIS
NeverJoiningMIS
)

func setState(node lib.Node, state State) {
newState, _ := json.Marshal(state)
node.SetState(newState)
}

func getState(node lib.Node) State {
encodedState := node.GetState()
var state State
json.Unmarshal(encodedState, &state)
return state
}

func prepareMessage(message Message) []byte {
encoded, _ := json.Marshal(message)
return encoded
}

func receiveMessage(node lib.Node, idx int) Message {
var message Message
receivedMessage := node.ReceiveMessage(idx)
err := json.Unmarshal(receivedMessage, &message)
if err != nil {
return Message{}
}
return message
}

func sendNullMessage(node lib.Node, i int) {
node.SendMessage(i, nil)
}

func initialize(node lib.Node) {
state := State{
true,
false,
false,
None,
None,
None,
map[int]bool{},
}
for i := range node.GetInNeighbors() {
state.AliveNeighbors[i] = true
}
setState(node, state)
}

func phasedSend(
node lib.Node,
state *State,
subPhaseNum int,
idx int,
) {
switch subPhaseNum {
case phaseMin:
node.SendMessage(
idx,
prepareMessage(
Message{
SendingMinimum,
state.RandomMin,
},
))
case phaseClaim:
if state.InMIS {
node.SendMessage(
idx,
prepareMessage(
Message{
JoiningMIS,
state.RandomMin,
},
))
} else {
sendNullMessage(node, idx)
}
case phaseDecline:
if state.NeighborInMIS {
node.SendMessage(
idx,
prepareMessage(
Message{
NeverJoiningMIS,
state.RandomMin,
},
))
state.InGraph = false
} else {
sendNullMessage(node, idx)
}
}
}

func phasedReceive(
node lib.Node,
nodeState *State,
subPhaseNum int,
idx int,
) {
message := receiveMessage(node, idx)
switch subPhaseNum {
case phaseMin:
nodeState.ReceivedMin = min(nodeState.ReceivedMin, message.Info)
case phaseClaim:
if message.MessageType == JoiningMIS {
nodeState.NeighborInMIS = true
}
case phaseDecline:
if message.MessageType == NeverJoiningMIS {
nodeState.AliveNeighbors[idx] = false
}
}
}

func process(node lib.Node, subPhaseNum int) bool {
state := getState(node)
for i := range node.GetInNeighbors() {
if state.AliveNeighbors[i] {
phasedSend(node, &state, subPhaseNum, i)
}

}
for i := range node.GetInNeighbors() {
if state.AliveNeighbors[i] {
phasedReceive(node, &state, subPhaseNum, i)
}

}
if subPhaseNum == phaseMin {
state.InMIS = state.RandomMin < state.ReceivedMin
}
if subPhaseNum == phaseDecline {
state.InGraph = !state.InMIS && !state.NeighborInMIS
}
setState(node, state)
return !state.InGraph
}

func uniform() uint64 {
return rand.Uint64()
}

func check(nodes []lib.Node) {
for i, node := range nodes {
state := getState(node)
if state.InMIS != true && state.InMIS != false {
panic(fmt.Sprint("Incorrect location at ", i))
}

outCnt := 0
inCnt := 0

for j, neighbor := range node.GetInNeighbors() {
if getState(neighbor).InMIS == true {
inCnt++
} else {
log.Println(j, " neighbor of ", i)
outCnt++
}
}

if state.InMIS == true && inCnt > 0 {
panic(fmt.Sprint(i, " and his neighbor ended up in MIS"))
}
if state.InMIS == false && inCnt == 0 {
panic(fmt.Sprint(i, " and his neighbor did not end up in MIS"))
}
}
}

func Run(n int, p float64) (int, int) {
nodes, synchronizer := lib.BuildSynchronizedRandomGraph(n, p)
for _, node := range nodes {
go run(node)
}
synchronizer.Synchronize(0)
check(nodes)
return synchronizer.GetStats()
}

func run(node lib.Node) {
node.StartProcessing()
initialize(node)
finish := false
node.FinishProcessing(finish)
for !finish {
node.StartProcessing()
state := getState(node)
state.RandomMin = uniform()
state.ReceivedMin = math.MaxUint64
setState(node, state)
for i := 0; i < subPhases; i++ {
finish = finish || process(node, i)
}
node.FinishProcessing(finish)
}
}
Loading