{"id":17772135,"url":"https://github.com/dranikpg/study-concurrency","last_synced_at":"2025-04-01T15:46:30.087Z","repository":{"id":111494770,"uuid":"382367794","full_name":"dranikpg/study-concurrency","owner":"dranikpg","description":"Concurrency study list","archived":false,"fork":false,"pushed_at":"2021-11-04T20:24:33.000Z","size":44,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-02-07T10:18:40.616Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C++","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/dranikpg.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-07-02T14:15:07.000Z","updated_at":"2024-07-09T20:07:01.000Z","dependencies_parsed_at":"2023-03-10T04:30:26.107Z","dependency_job_id":null,"html_url":"https://github.com/dranikpg/study-concurrency","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/dranikpg%2Fstudy-concurrency","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dranikpg%2Fstudy-concurrency/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dranikpg%2Fstudy-concurrency/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dranikpg%2Fstudy-concurrency/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dranikpg","download_url":"https://codeload.github.com/dranikpg/study-concurrency/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246667756,"owners_count":20814732,"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":[],"created_at":"2024-10-26T21:38:04.866Z","updated_at":"2025-04-01T15:46:30.070Z","avatar_url":"https://github.com/dranikpg.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"My notes while studying concurrency in depth:\n\n[The first part](https://github.com/dranikpg/study-concurrency/tree/main/01-memory-model) explores the notion of memory models and why we need synchronization. How do atomics work. What is cache coherency.\n\n[The second part](https://github.com/dranikpg/study-concurrency/tree/main/02-locking) is about different kinds of locks and their bare C implementation. Takes a brief look on C++/Rust standart libraries and popular crates\n\n[The third part](https://github.com/dranikpg/study-concurrency/tree/main/03-fibers) is my implementation of **stackful** cooperative coroutines (fibers) in Rust\n\nThe fourth part is about the GO scheduler (TODO)\n\n[The fifth part](https://github.com/dranikpg/study-concurrency/tree/main/05-async-cpp) explores C++ async by implementing a custom runtime with timer futures based on effective wakeups\n\n[The sixth part](https://github.com/dranikpg/study-concurrency/tree/main/06-async-rust) is a Rust version of the fifth part\n\n[The seventh part](https://github.com/dranikpg/study-concurrency/tree/main/07-lock-free) Takes a look the lock free Treiber stack and explores ways of managing memory manually and concurrently - with simple hazard pointers.\n\n[The eight part](https://github.com/dranikpg/study-concurrency/tree/main/08-concurrent-gc) is a simple STW concurrent mark-and-sweep garbage collector in C++.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdranikpg%2Fstudy-concurrency","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdranikpg%2Fstudy-concurrency","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdranikpg%2Fstudy-concurrency/lists"}