{"id":23904903,"url":"https://github.com/tsotimus/LRU-Cache-Simulator","last_synced_at":"2025-09-10T12:32:30.126Z","repository":{"id":110383622,"uuid":"255211083","full_name":"tsotimus/LRU-Cache-Simulator","owner":"tsotimus","description":"A JavaScript simulation of hardware cache with k-way associativity and LRU replacement strategy ","archived":false,"fork":false,"pushed_at":"2020-05-05T23:19:05.000Z","size":34,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-21T15:07:13.113Z","etag":null,"topics":["cache","calculator","javascript","js","lru-cache","simulation"],"latest_commit_sha":null,"homepage":"","language":"HTML","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/tsotimus.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}},"created_at":"2020-04-13T02:16:38.000Z","updated_at":"2021-02-09T18:05:52.000Z","dependencies_parsed_at":"2023-09-24T16:56:39.435Z","dependency_job_id":null,"html_url":"https://github.com/tsotimus/LRU-Cache-Simulator","commit_stats":{"total_commits":30,"total_committers":2,"mean_commits":15.0,"dds":"0.43333333333333335","last_synced_commit":"660e5b3e12a38c492685794e710c273bf92cbc1c"},"previous_names":["tsotimus/lru-cache-simulator"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/tsotimus/LRU-Cache-Simulator","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tsotimus%2FLRU-Cache-Simulator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tsotimus%2FLRU-Cache-Simulator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tsotimus%2FLRU-Cache-Simulator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tsotimus%2FLRU-Cache-Simulator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tsotimus","download_url":"https://codeload.github.com/tsotimus/LRU-Cache-Simulator/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tsotimus%2FLRU-Cache-Simulator/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274462643,"owners_count":25290110,"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","status":"online","status_checked_at":"2025-09-10T02:00:12.551Z","response_time":83,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["cache","calculator","javascript","js","lru-cache","simulation"],"created_at":"2025-01-05T00:47:49.698Z","updated_at":"2025-09-10T12:32:29.860Z","avatar_url":"https://github.com/tsotimus.png","language":"HTML","funding_links":[],"categories":[],"sub_categories":[],"readme":"# LRU Cache Simulator\n## How it works\nThe User inputs the cache description as well as the cache.\nThis page then uses JavaScript to Simulate the application of an LRU Cache.\nFor each memory access in the input, the page will print a 'C' if it is served by the cache, and print 'M' if it is served by the memory.\n## How to use it. \nThe first line of the input is used to describe the cache. Using the Example A\n\n- 32 = W\n- 1024 = C\n- 64 = B\n- 4 = k\n\n\n#### Definitions\n\n- **W** is the number of bits in one word. This number will be a multiple of 8\n- **C** is the number of data bytes in the cache. This number will be a power of 2. (In C, we do not count the space needed to store tags, just the space needed to store data.)\n- **B** is the number of bytes in one cache block. This number will be a divisor of C.\n- **k** is the number of lines in a block. This number will be a divisor of B.\n\n#### Example A Input\n32 1024 64 4\n\n409\n\n658\n\n915\n\n1172\n\n661\n\n1429\n\n1168\n\n403\n\n925\n\n1172\n\n\n#### Example A Output\n\n\nMMMM\n\nCMCM\n\nMC\n\n\n**Load of the actual index.html for more detailed instructions.**\n\n## Taks To Do\n- [x] Fix Bug\n- [ ] Finish CSS\n- [ ] Finish Direct Mapping\n- [x] Finish Fully Associative\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftsotimus%2FLRU-Cache-Simulator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftsotimus%2FLRU-Cache-Simulator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftsotimus%2FLRU-Cache-Simulator/lists"}