Enhanced π Approximation Through MIMD Parallel Computing: An Efficiency Analysis Utilizing Raspberry Pi
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Multiple Instruction Multiple Data is one of the parallel computing architectures in Flynn's taxonomy, where cores can execute independent sets of instructions on independent sets of data.Parallel computing could be used in scientific subfields such as mathematics to approximate the number pi.One of the methods to approximate π is the Gregory-Leibniz method, which proposes the expansion of the arctan x series, which can then be used as an algorithm to approximate π.This method requires lots of term calculations to obtain the accurate digits of π, hence why parallel computing is needed.Building a cost-effective parallel computing architecture from standard desktop computers is difficult due to the high cost and space requirements.This study will build an MIMD parallel computing done by three Raspberry Pi 3Bs, small and affordable credit card sized single board computer, connected through a message-passing interface to get the performance analysis of MIMD parallel computing.The performance analysis shows that with three Raspberry Pis, there is a huge speedup of 6,2953020 and a faster time of 1.49 seconds compared to 9.38 seconds at 5 million terms.As a result of this discovery, the Raspberry Pi could be used in further projects to develop an affordable parallel computing architecture.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it