Abstract
Fundamental measure of process power in an exceedingly database management system is that the performance of the kind utility it provides. Once sorting an outsized file on a serial computer, performance is proscribed by factors involving processor speed, memory capability, and I/O information measure. during this paper, we investigate the practicableness and potency of a parallel sort-merge algorithm through implementation on the JASMZN paradigm, a backend multiprocessor designed around a quick packet bus. We describe the look and implementation of a parallel type utility. We then gift and analyze the results of measurements corresponding to a spread of file sizes and processor configurations. Our results show that victimization current, off-the-rack technology coupled with a efficient distributed software package, three- and five-microprocessor configurations give a awfully cost-effective style of massive files. The three-processor configuration sorts a hundred Mbyte go into one, that