Commit 28586317 authored by Kirill Smelkov's avatar Kirill Smelkov

.

parent a9bb4f67
? IStorage.Load -> per storage connection
? random access -> mmap
- scheduler won't use free P if a G is taking time and other Gs are queued after it on the same P:
......
......@@ -270,12 +270,12 @@ func (nt *NodeTable) SubscribeBuffered() (ch chan []NodeInfo, unsubscribe func()
// TODO review peer link dialing / setting / accepting.
//
// Keep in mind that in NEO in general case it is not client/server but peer-to-perr
// Keep in mind that in NEO in general case it is not client/server but peer-to-peer
// e.g. when two S establish a link in between then to exchange/sync data.
//
// Also the distinction beetween S and M should go away as every S should
// Also the distinction between S and M should go away as every S should
// be taught to also become M (and thus separate M nodes go away
// completely) with constant reelection being happenningin the background
// completely) with constant reelection being happening in the background
// like in raft.
// SetLink sets link to peer node.
......
......@@ -23,8 +23,10 @@ would be deadlock.
Conflict:
oid1 S1 C1 C2
oid1 S1 C1 C2 (?) (S1 replies to C2 that C1 already "stored" oid1)
oid1 S2 C2 C1
oid2 S1 C2 C1
oid2 S2 C1 C2
who wins?
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment