"Create N process in a ring. Send a message round the ring M times so that a total of N * M messages get sent. Time how long this takes for different values of N and M."

• Add a global make that runs tests in all exercises
• Add a travis integration to this repo so tests are run on each PR/commit

Add excercise that uses message passing with two node and where one node overflows the other. Let's discuss this tomorrow @hernanex3

Cassandra

1. https://academy.datastax.com/resources/ds101-introduction-cassandra
2. https://academy.datastax.com/resources/ds201-foundations-apache-cassandra
3. https://academy.datastax.com/resources/ds220-data-modeling
4. https://aphyr.com/posts/294-jepsen-cassandra
5. https://lostechies.com/ryansvihla/2014/10/20/domain-modeling-around-deletes-or-using-cassandra-as-a-queue-even-when-you-know-better/

Kafka and distributed logs

1. https://engineering.linkedin.com/distributed-systems/log-what-every-software-engineer-should-know-about-real-time-datas-unifying
2. https://bravenewgeek.com/building-a-distributed-log-from-scratch-part-1-storage-mechanics/
3. https://bravenewgeek.com/building-a-distributed-log-from-scratch-part-2-data-replication/
4. https://bravenewgeek.com/building-a-distributed-log-from-scratch-part-3-scaling-message-delivery/
5. https://bravenewgeek.com/building-a-distributed-log-from-scratch-part-4-trade-offs-and-lessons-learned/
6. https://kafka.apache.org/documentation/#gettingStarted
7. https://notamonadtutorial.com/interview-with-jay-kreps-about-apache-kafka-46fbfdb870ca
8. https://kafka.apache.org/documentation.html#design
9. http://www.confluent.io/blog/stream-data-platform-1/
10. http://www.confluent.io/blog/stream-data-platform-2/
11. https://www.confluent.io/blog/using-logs-to-build-a-solid-data-infrastructure-or-why-dual-writes-are-a-bad-idea/
12. https://aphyr.com/posts/293-jepsen-kafka

instead of printing, the processing could consist in pushing a value (for example the priority atom vip/normal) to a list in the state of the loop process. Then you could add a call to the server that returns the current state.

Using this you could have a proper unit test instead of just checking the console output.

http://book.mixu.net/distsys/

In the exercise the result is a list of lists, but it should be a list of tuples.

READMEs:

• Installing
• Filter numbers
• Filter in
• Filter out
• Filter in values
• Hello world
• Hello pattern
• Lists
• Reverse
• Remove Consecutive
• Even Fibonacci Numbers
• Reduce
• Rotate Lists
• Run-length Encoding of a List
• Any
• Bank Accounts
• Calculate BMI
• Insert element at position
• Filter Fibonacci Numbers
• Maps
• Mapping a Map
• Merge Map
• List to Map
• Records to Maps
• Maps to Records
• Proplist to Map
• Parallel Map
• Calculator
• Priority
• Ring Benchmark
• Shopping Cart
• Remote Function
• Shortly

I've checked out the erlings repository and then run make in the top level as instructed, however I do not see the correct output - I get an error as below:

... erlings (master) $ make
cd otp/shopping_cart && ../../rebar3 as test  otp/shopping_cart  libraries/shortly  sequential/filter_fibonacci_numbers  sequential/bank_accounts  sequential/hello  sequential/calculate_bmi  sequential/insert_element_at  sequential/filter_numbers  sequential/hello_pattern  sequential/maps  sequential/lists  sequential/installing  distributed/remote_fun  concurrent/ring_benchmark  concurrent/priority  otp  libraries  sequential  distributed  concurrent  ct
===> Command 'otp/shopping_cart' not found
make: *** [Makefile:16: otp/shopping_cart] Error 1

Would appreciate any help you can give. Tested with Erlang 18.3 and Erlang 20.1

In readme add list of links to read for learning erlang the language and the system

Make $EXERCISE fails due to problem related to Common Test

I'm trying to run the tests as instructed in the README.md files, but I'm getting this error related to Common Test Hooks:

bash-3.2$ pwd
/Users/lambda/code/erlings
bash-3.2$ make sequential/filter_numbers
cd sequential/filter_numbers && ../../rebar3 as test ct
===> Verifying dependencies...
===> Compiling filter_numbers
===> Running Common Test suites...
%%% filter_numbers_SUITE: 
%%% filter_numbers_SUITE ==> run_eunit: FAILED
%%% filter_numbers_SUITE ==> {fail,"cth_readable_failonly:on_tc_fail/3 CTH call failed"}
%%% undefined ==> end_per_suite: FAILED
%%% undefined ==> {fail,"cth_readable_failonly:on_tc_fail/3 CTH call failed"}
Failed 1 tests. Passed 0 tests. 
Results written to "/Users/lambda/code/erlings/sequential/filter_numbers/_build/test/logs/index.html".
===> Failures occurred running tests: 1
make: *** [sequential/filter_numbers] Error 1

I was able to run eunit from the exercises subdirectories with no problem:

joaquin-lambda:filter_numbers lambda$ pwd
/Users/lambda/code/erlings/sequential/filter_numbers
joaquin-lambda:filter_numbers lambda$ rebar3 eunit
===> Verifying dependencies...
===> Compiling filter_numbers
===> Performing EUnit tests...
...
Finished in 0.047 seconds
3 tests, 0 failures

As @juanbono pointed out, this is related to erlang/rebar3#2063

Things I tried:

• I was able to run eunit from the rebar3 binary that came with the repo.
• I wasn't able to run ct with the rebar3 binary thar came with the repo.
• I was able to run ct using my installed version of rebar3

Simple bit.ly clone. Receives long urls and returns another but shorter. Should support simple http post/get for that, and also use websocket to show in '/new' the new links shortened.

• allow to become different servers (more than once)
• add another server example (e.g. factorial)
• add a test
• link to joe armstrong post
  https://joearms.github.io/published/2013-11-21-My-favorite-erlang-program.html

Check https://people.kth.se/~johanmon/dse.html and see if there are any exercises we can add.

https://github.com/unq-lids-sistemas-distribuidos/curso

https://people.kth.se/~johanmon/dse.html

in the main readme, and/or add excercise number in the folder

Create a simple Erlang cluster of two nodes, one should receive and become the function received.

Create an exercise to practice state machines, and logging.