Simple model of a distributed system.
Goal: to provide users with a small infrastructure that allows them to create models of distributed processes.
Requirements:
- Maximum ease of entry (you need to write a minimum of code and correct/add a minimum number of files).
- Modeling of distributed processes that exchange messages.
- Simulation of synchronous operation mode (processes that received messages during the clock cycle synchronizations send messages to other processes, which receive them at the beginning of the next clock cycle).
- Simulation of an asynchronous operation (each message is delivered to the process within the time specified by the link weight between processes).
- Simulation of message loss. The
errorRateparameter (0 <= errorRate <= 1) determines the probability of message loss. - Robust algorithms should be relatively resistant to message loss.
Types of algorithms for modeling:
- Topological algorithms;
- Building spanning trees;
- Finding the reachability of a node;
- Finding the shortest path;
- Election algorithms;
- Synchronization algorithms;
- Completion detection algorithms;
- Algorithms for ordered distribution;
- ...
Project layout is corresponding to the standard layout for Go projects.
- cmd directory contains
mainpackage, which is compiled into the resulting executable and can be modified by users; - configs directory contains configuration files that can be also modified by user;
- internal directory contains packages with internal application logic:
- errors package contains error codes for clarification of arisen errors;
- messages package contains implementation of types related to message passing:
- MessageArg.go contains implementation of message argument type;
- Message.go contains implementation of message type;
- MessageQueue.go contains implementation of message queue type;
- network package contains implementation of the network communication model;
- process package contains implementation of the distibuted process model;
- world package contains implementation of distributed environment model;
- pkg directory contains export-free packages implementing special data structures, used in the project:
- test directory contains additional testing supplies;
- user directory contains auxilliary packages that can be modified by users:
- context package contains contextes for working functions of the distributed processes;
- vendor directory contains dependencies;
- .travis.yml is a Travis CI configuration file;
- Gopkg.lock and Gopkg.toml are dependency configuration files;
- Makefile is a script file for GNU Make.
The entire model is implemented in Go.
There are several simple types for implementing common functions. They are located in the different packages in internal directory. The purpose of the lab work is to write a suitable main and a message handler function (more on this later). An example is given in the project.
The main type of the project is World. It creates models of distributed processes (hereinafter - just processes), registers handler functions (common to all system processes) and assigns a handler for a specific process.
The Network type is responsible for inter-process communication and inter-process message delivery. There can be multiple networks in one world and each process can belong to multiple networks. It simulates asynchronous and synchronous modes of sending messages between processes and can also introduce errors in transmission (for example, a message may be lost with some probability).
The Process type models the distributed process itself. Each process must register on its network in order to notify the network of its appearance. The network now knows where to send messages intended for this process. There are one incoming message queue. One execution thread is started - WorkerThread. The workflow analyzes the message which handler function this message corresponds to and calls the corresponding handler.
The names of the other types speak for themselves: ErrorCode, MessageArg, Message, MessageQueue.
A little more about the working function.
It is called with two arguments. The first is the context of the Process type, which makes it possible to determine the network topology (immediate neighbors) and its number. The user can add their own context to the Process class, which the working function will use. This requires:
- Describe your context type and put this description in a
contextpackage. - Add an instance of this type to the map variable
Contexts. - Use it as showed in
workFunctionSETXfunction inmainpackage.
This context will be included in the general context of the Process class and can be used both by the working function itself and by any other functions (this allows, for example, in one working function to define a list of all available processes, not just neighbors, and in another working function, send messages to these processes).
A worker function should check the message, return true if it is ready and can process the message, and false if it cannot process it (for example, if the message is intended for another worker function).
The network topology is described in the config.data file. Its commands:
; create processes from 1 to 11
processes 1 11
bidirected 1
errorRate 0.5
link from 1 to 2 [latency 10]
link from 1 to all [latency 5]
link from all to 3 [latency 2]
link from all to all [latency 1]
setprocesses 2 5 TEST
send from 4 to 10 TEST_BEGIN 1
send from -1 to 1 TEST_BEGIN
launch timer 3
wait 10
For example, there is a ready-made working function workFunctionSETX.
- Go of version 1.16.x;
- GNU make of version 3.81 and above;
- dep of version 0.5.4 and above;
- golangci-lint of version 1.39.0 and above.
Also, if you want to contribute, you should use formatting tools:
To perform tests, use
make test
The coverage report will be placed in the coverage directory. To see coverage results use
go tool cover -func=coverage/count.out
To build the model use
make
The resulting executable will be placed in the bin directory.
To execute, use
bin/model
All dependencies are managed by dep. Here are all of them:
- mt19937 - an implementation of Takuji Nishimura's and Makoto Matsumoto's Mersenne Twister pseudo random number generator in Go.