{"id":19439582,"url":"https://github.com/zavierferodova/computation-challenge","last_synced_at":"2025-02-25T07:23:13.913Z","repository":{"id":113336916,"uuid":"391516527","full_name":"zavierferodova/Computation-Challenge","owner":"zavierferodova","description":"Python script to fill your computer memory with processor bits word size","archived":false,"fork":false,"pushed_at":"2021-10-11T15:06:48.000Z","size":3,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-07T21:38:58.778Z","etag":null,"topics":["processor-architecture","processor-maximum-access","processor-memory-access"],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/zavierferodova.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2021-08-01T03:39:33.000Z","updated_at":"2023-05-11T11:38:08.000Z","dependencies_parsed_at":null,"dependency_job_id":"fd89e380-dc02-407b-ada6-04cb65645a69","html_url":"https://github.com/zavierferodova/Computation-Challenge","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zavierferodova%2FComputation-Challenge","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zavierferodova%2FComputation-Challenge/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zavierferodova%2FComputation-Challenge/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/zavierferodova%2FComputation-Challenge/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/zavierferodova","download_url":"https://codeload.github.com/zavierferodova/Computation-Challenge/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240619951,"owners_count":19830295,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["processor-architecture","processor-maximum-access","processor-memory-access"],"created_at":"2024-11-10T15:25:00.837Z","updated_at":"2025-02-25T07:23:13.870Z","avatar_url":"https://github.com/zavierferodova.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Computation-Challenge\nThis script used for testing computer processor bits word size RAM access usage.\n\n**Warning !!** \u003cbr\u003e\nThe calculation process from this script will filled much of your computer RAM memory like Processor RAM Access calculation theory.\n\n## Example\nIf you pass value 32 that means x86 processor architecture to `architecture_processor_computation()` function, the RAM of computer will used more than 4 GB.\n\n```python\n# usememory.py\n\n....\n\narchitecture_processor_computation(32)\n```\n\nThe process will be like this :\n- First script will count processor memory address length by passed argument.\n- 2\u003csup\u003e32\u003c/sup\u003e = 4.294.967.296 bytes of memory address count.\n- 1 byte of memory address are contains 8 bit of value. Then script will multiply value of 2\u003csup\u003e32\u003c/sup\u003e with 8.\n- 2\u003csup\u003e32\u003c/sup\u003e \u0026#x2715;\t8 = 34.359.738.368 bits memory cell.\n- After that script will power value of 2\u003csup\u003e32\u003c/sup\u003e \u0026#x2715;\t8 with 2, because 1 of bit are contains two value 1 and 0.\n- (2\u003csup\u003e32\u003c/sup\u003e \u0026#x2715;\t8)\u003csup\u003e2\u003c/sup\u003e = _____ This calculation will filled every single cell of memory address with value.\n- Cause of every single cell memory is filled by value, the computer memory will used for about 4 GB.\n- Because this script is using Python that auto allocate memory size, the result of RAM usage will take more than 4 GB.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzavierferodova%2Fcomputation-challenge","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fzavierferodova%2Fcomputation-challenge","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fzavierferodova%2Fcomputation-challenge/lists"}