UPDATE: THIS REPOSITORY IS DEPRECATED. IT WON'T BE UPDATED AND WILL BE REMOVED.
This project has been split up into several repositories:
- implementation of the EMAS algorithm, see erlang-emas
- underlying multi agent framework was extracted and generalized in erlang-mas
- other projects using custom genetic operators using EMAS to find solutions for given problems, such as:
- finding the minimum of the Rastrigin function, see rastrigin-emas
- solving the LABS problem, see labs-emas
There is also a "Getting started" guide which helps you write your own operators for the genetic algorithm using EMAS and underlying framework in the new way.
The ParaPhrase project aims to produce a new structured design and implementation process for heterogeneous parallel architectures, where developers exploit a variety of parallel patterns to develop component based applications that can be mapped to the available hardware resources, and which may then be dynamically re-mapped to meet application needs and hardware availability.
By using the massive and efficient parallelism enabled by ParaPhrase technologies, this work allows to achieve significant speedups of individual agents as well as build much bigger multi-agent systems.
To run the project on your machine you need:
First you need to clone the repository:
> git clone https://github.com/ParaPhraseAGH/erlang.git
> cd erlang/
To build the project you can use rebar. On Linux:
> ./rebar get-deps
> ./rebar compile
On Windows:
> rebar.cmd get-deps
> rebar.cmd compile
or alternatively (both Windows and Linux, be sure to get-deps first):
> erl -make
which uses the local Emakefile.
To start a VM where you can run the application, first make sure that you are in the main project's folder:
> cd emas/
Then you can run:
> erl -pa ebin/ -pa deps/skel/ebin/
which will start the Erlang VM. Flags -pa declare the classpath where the VM will look for all the necessary .beam files, which in our case are directories ~/ebin/ and ~/deps/skel/ebin/.
To run the application you can type:
1> emas:start(concurrent, 10000, []).
which will start the algorithm. The word emas is the name of the main module of your usecase (we provide the implemenentation of the EMAS algorithm as an example). You can choose to implement a new one, which should be started in the same way as shown above.
The word concurrent defines the version of the program which will be used to execute the program. Currently you can choose from concurrent, hybrid, skel_main and sequential versions. The second parameter is the expected time of the execution in miliseconds and the third one is the option list. By default, the program will write all its results to stdout, so you can see if everything is configured correctly.