I had a discussion with @fabian-jung about a mapping function that maps groups of peers to groups
of vertices. The cause of this mapping is that there might be peers that takes special roles in the communication graph like source or sink of data. Therefore particular communication vertices need to be mapped on these peers. The synopsis of this filter mapping could be:
Filter(PeerTag, VertexTag, Mapping)
Where PeerTag is an identifier for a peer group and the VertexTag is an identifier for a vertex group. The Mapping is a normal Mapping that maps peer groups to vertex groups. Data source vertices could be mapped to data source peers e.g.:
I had a discussion with @fabian-jung about a mapping function that maps groups of peers to groups of vertices. The cause of this mapping is that there might be peers that takes special roles in the communication graph like source or sink of data. Therefore particular communication vertices need to be mapped on these peers. The synopsis of this filter mapping could be:
Where PeerTag is an identifier for a peer group and the VertexTag is an identifier for a vertex group. The Mapping is a normal Mapping that maps peer groups to vertex groups. Data source vertices could be mapped to data source peers e.g.: