论文标题
使用消息传递接口的有效生成Mandelbrot集
Efficient Generation of Mandelbrot Set using Message Passing Interface
论文作者
论文摘要
随着对更安全和可靠的系统的越来越多的需求，Mandelbrot Set在加密世界中的使用对每个人来说都是显而易见的。本文档旨在提供一种有效的方法来使用数据并行性生成此集合。第一个伯恩斯坦的条件用于确保在生成mandelbrot集时数据平行。然后，Amdhal定律用于计算理论速度提高，以比较三个分区方案。本文档中讨论的三个分区方案是幼稚的行分割，第一个来了第一批分段和交替的行分段。 C中的消息解析接口（MPI）库用于所有通信。在测试了君主上的所有实现之后，结果表明，幼稚的行分割方法并未像PAR一样执行。但是，当任务数量为$ <16 $时，交替的行细分方法的性能更好，当任务数为$ \ ge 16 $时，首先使用的方法会更好。
With the increasing need for safer and reliable systems, Mandelbrot Set's use in the encryption world is evident to everyone. This document aims to provide an efficient method to generate this set using data parallelism. First Bernstein's conditions are used to ensure that the Data is parallelizable when generating the Mandelbrot Set. Then Amdhal's Law is used to calculate the theoretical speed up, to be used to compare three partition schemes. The three partition schemes discussed in this document are the Naïve Row Segmentation, the First Come First Served Row Segmentation and the Alternating Row Segmentation. The Message Parsing Interface (MPI) library in C is used for all of the communication. After testing all the implementation on MonARCH, the results demonstrate that the Naïve Row Segmentation approach did not perform as par. But the Alternating Row Segmentation approach performs better when the number of tasks are $< 16$, where as the First Come First Served approach performs better when the number of tasks is $\ge 16$.
