Project description

Fast Life

This repository is an experiment to compare different techniques for implementing Conway's game of life to determine performance characteristics of a Python program. The implementations are as follows:

Pure Python Sequential
Pure Python Multiprocessing
C-bindings Sequential
C-bindings Parallel

Each of these implementations will be benchmarked with significantly sized worlds and the same random seeds to determine how their performance scales.

Project details

These details have not been verified by PyPI

Project links

GitHub Statistics

View statistics for this project via Libraries.io, or by using our public dataset on Google BigQuery

Release history Release notifications | RSS feed

0.2

Jul 28, 2020

This version

0.1

Jul 26, 2020

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

fastlife-0.1.tar.gz (9.6 kB view hashes)

Uploaded Jul 26, 2020 Source

Built Distribution

fastlife-0.1-py3-none-any.whl (5.9 kB view hashes)

Uploaded Jul 26, 2020 Python 3

Hashes for fastlife-0.1.tar.gz

Hashes for fastlife-0.1.tar.gz
Algorithm	Hash digest
SHA256	`1e59a7dc0b3cc5612b3dfddab23d55efecb2f95b60618bf1e231f4c8b776f7b8`
MD5	`8af60e8b5a4a7e0307d10c00bc3a1dd6`
BLAKE2b-256	`5b9ab40740bb7f9c66aa592d75cceac30648a365b23b9a31185b4a644bc64b43`

Hashes for fastlife-0.1-py3-none-any.whl

Hashes for fastlife-0.1-py3-none-any.whl
Algorithm	Hash digest
SHA256	`61d031296e99332619168534c60fa241b06c62b5d5a37325623d1cf484d6e7e6`
MD5	`ec8b07134efe8f957ba637abaeae64bb`
BLAKE2b-256	`b62fafa807cfb5667f46133822424b9160dc16279265503ced9e97603d0db071`