This document summarizes a research paper that analyzes the performance of a parallel merge sort algorithm implemented using MPI (Message Passing Interface). It first provides background on merge sort and parallel computing. It then describes the methodology used, which divides the sorting problem across processes in a tree structure. The processes communicate by sending sub-problems and sorted data to each other. Finally, it evaluates the communication and computation costs and presents results on the performance of the parallel merge sort approach.