codex-storage/das-research
1
0
Fork 0
mirror of https://github.com/codex-storage/das-research.git synced 2025-02-23 16:28:27 +00:00
Code Issues Packages Projects Releases Wiki Activity

add Neighbor class as placeholder

Browse Source 
Placeholder for per-negighbor structures

Signed-off-by: Csaba Kiraly <csaba.kiraly@gmail.com>
This commit is contained in:
Csaba Kiraly 2023-01-25 18:19:18 +01:00
parent fd59f44143
commit b38d8e13ae
No known key found for this signature in database
GPG Key ID: 0FE274EE8C95166E
2 changed files with 14 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
DAS/simulator.py
View File

@ -61,8 +61,8 @@ class Simulator:
for u, v in G.edges:
val1=rowChannels[id][u]
val2=rowChannels[id][v]
val1.rowNeighbors[id].append(val2)
val2.rowNeighbors[id].append(val1)
val1.rowNeighbors[id].append(Neighbor(val2))
val2.rowNeighbors[id].append(Neighbor(val1))
if (len(columnChannels[id]) < self.shape.netDegree):
self.logger.error("Graph degree higher than %d" % len(columnChannels[id]), extra=self.format)
@ -72,8 +72,8 @@ class Simulator:
for u, v in G.edges:
val1=columnChannels[id][u]
val2=columnChannels[id][v]
val1.columnNeighbors[id].append(val2)
val2.columnNeighbors[id].append(val1)
val1.columnNeighbors[id].append(Neighbor(val2))
val2.columnNeighbors[id].append(Neighbor(val1))
def initLogger(self):
logger = logging.getLogger("DAS")

12
DAS/validator.py
View File

@ -7,6 +7,14 @@ from DAS.block import *
from bitarray import bitarray
from bitarray.util import zeros
class Neighbor:
def __repr__(self):
return str(self.node.ID)
def __init__(self, v):
self.node = v
class Validator:
ID = 0
@ -122,14 +130,14 @@ class Validator:
if line.any():
self.logger.debug("col %d -> %s", columnID, self.columnNeighbors[columnID] , extra=self.format)
for n in self.columnNeighbors[columnID]:
n.receiveColumn(columnID, line)
n.node.receiveColumn(columnID, line)
def sendRow(self, rowID):
line = self.getRow(rowID)
if line.any():
self.logger.debug("row %d -> %s", rowID, self.rowNeighbors[rowID], extra=self.format)
for n in self.rowNeighbors[rowID]:
n.receiveRow(rowID, line)
n.node.receiveRow(rowID, line)
def sendRows(self):
if self.amIproposer == 1: