Changes

WordProcessor

- The Application

This application was built for assignment one. It is a sort of string editor/ translator was made. It accepts files to be processed by taking words from the file itself and using "codex" or dictionary, to match them to specific meanings or words. Then it replaces the string for that line and moves on to the next. Its intended purpose is to take large files and translate them into other languages. I believe this can be a highly parallelizable problem as many of the steps seem that they can be done in synchronous.

The parts to this application are as follows;

-Issues

The main concern with this program is that often times it spends much of its time is looking something up and comparing it to each token generated by a split. This can be quite time consuming as it then has to go through a list of translations to find a matching pair. To increase speeds further, I had implemented the codex as a map.

-Run-time Analysis Big-O

split()

n : Linear

lookup() - Composite function, has 3 separate function calls

n^2(log n) : Log Quadratic worst/ Log Linear best

replace()

n : The complexity of string::Replace is linear according to cplusplus.com/reference/string/string/replace/

Replace and Split were added to this analysis because they may be improved in the future in order to add features to the application itself. This will more than likely increase their complexity and therefore its runtimes. In addition, these functions will be kept on watch as they are called from lookup().

-Profile Results

gprof - More profiles can be found at https://github.com/Pooch11/DPS915/tree/master/TestFiles/Profiles

-Amdahls Predicted speed increase

Given the formula S(n) = 1 / 1 - P + P / N

P = the percentage portion of parallizable code

-Additional Info Available @

- [https://github.com/Pooch11/DPS915] GitHub Link