Eratosthenes

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

(★ 10)

⚔️ Parallel Design of Eratosthenes Screening Method Based on MPI

Eratosthenes 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

**English** | [中文](./README.zh-CN.md)

## Catalogue

```text
Eratosthenes
└───Eratosthenes        Main project code
│   └───Base            Serial program
│   └───MPI_prime       MPI optimized original version
│   └───noEvent         Uneven optimization
│   └───brastBetter     To optimize broadcasting
│   └───CacheOptimize   cache optimization 
│   └───result          Result file
│       └───result_Initial.txt       MPI optimized original version results 
│       └───result_EvenOP.txt        Uneven optimization results
│       └───result_Bcast.txt         Broadcast optimization results
│       └───result_Cache_Final.txt   Cache optimization results
│       └───Result.xlsx              Summary of Results Analysis
│   
│   └───Parallel design***.pdf       Internship Report
│   └───report.pptx                  Report PPT
```

## Algorithm Introduction

> Eratosthenes was an ancient Greek mathematician who was searching for prime numbers within the integer N, A unique method was adopted: first write the numbers of 2 to N on paper:
>
> Draw a circle above 2 and then cross out the other multiples of 2; The first number that is neither circled nor crossed out is 3. Circle it and then cross out the other multiples of 3; The first number that has not been circled or crossed out now is 5. Circle it and cross out the other multiples of 5... and so on, until all numbers less than or equal to N are circled or crossed out. At this point, the circled and uncut numbers are exactly prime numbers less than N.

- As shown in the following figure

![img](https://cdn.jsdelivr.net/gh/binwenwu/picgo_demo/img/20240331153002.png)

- The pseudocode is as follows

```pseudocode
Input: an integer n > 1

Let A be an array of Boolean values, indexed by integers 2 to n,
initially all set to true.

for i = 2, 3, 4, ..., not exceeding √n:
	if A[i] is true:
		for j = i2, i2+i, i2+2i, i2+3i, ..., not exceeding n :
			A[j] := false
			
Output: all i such that A[i] is true.
```

## Environment

- [MSMPI](https://docs.microsoft.com/en-us/message-passing-interface/microsoft-mpi) - Microsoft MPI (MS-MPI) is a Microsoft implementation of the [Message Passing Interface standard](https://www.mpi-forum.org/) for developing and running parallel applications on the Windows platform.
- [Visual Studio 2019](https://visualstudio.microsoft.com/zh-hans/vs/older-downloads/) - Development tool
- Other configurations - See PDF report

## Features

- Comparative experiment
- Detailed annotations
- Acceleration ratio

Eratosthenes

Eratosthenes 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Eratosthenes

Eratosthenes 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README