The map-reduce paradigm offers a simple yet powerful approach for leveraging distributed and parallel processing capabilities to increase computational efficiency.

In this project a software prototype is proposed for implementing a map-reduce-like programme for identifying passengers with the most flights from a provided list.

The design emulates a mapper-combiner setup and the deployment of multithreading.

The final programme is provided in the FINAL folder and is comprised of two main files:

• FlightCounterMain.py and
• FlightCounterCommon.py

For reference the files are provided in both .py and .ipynb versions.