husterknupp / psychic-thread-adventure Goto Github PK

I want to have a way to run the algorithm in multiple threads. In a second step I want to be able to set the number of threads. The algorithm should use exactly this set numbers of threads for the calculation.

I want to clock the time needed for

• Mergesort w/o threading
• M. with few threads (fix number of threads)
• M. with dynamically created threads (no fixed number)
• (probably) M. written in functional style, oriented towards http://stackoverflow.com/questions/24855746/understanding-when-and-how-to-use-java-8-lambdas

Count of numbers should be 10, 1.000, 1.000.000.

• I want to find a place for the documentation of these tasks.

I want to show the results of the sorting. For details see #4. These information should be displayed in an easy to understand manner. It will be sufficient to have the results in text form for now. The code will provide required data in a log file.

As discussed in #3 for now, it will be sufficient to simply log the required information.

Problem
No information on any statistic can be consulted, yet.

Solution
Find reasonable positions in the program where to log statistics and do the logging. Use a logging library like log4j.

Acceptance Criterium

• automated descriptions can be found on System.out that reflect the sorting scenario.
• one of the libraries suggested below should be used to measure performance (use JUnitBenchmarks)

Problem
No multithreaded sorting can be benchmarked, yet.
Solution
Based on the single threaded Version of Mergesort I would like to have a way to run the algorithm in multiple threads. In a second step I want to be able to set the number of threads. The algorithm should use exactly this set numbers of threads for the calculation.
Acceptance Criteria
Results of sorting different counts of numbers using two threads can be found in the log.

Problem
No algorithm can be used to measure anything, yet.

Solution
Implement Mergesort algorithm using Java. Do not split execution paths in threads at this point. Develop test driven.

Acceptance Criteria

• Algorithm/method is tested with a numerical sequence of at least 10 numbers
• All tests run

It will be sufficient for the algorithm to be runnable from within an IDE.