{"id":25631294,"url":"https://github.com/boompig/hoard","last_synced_at":"2026-05-13T12:37:57.383Z","repository":{"id":26042145,"uuid":"29485376","full_name":"boompig/hoard","owner":"boompig","description":"My implementation of hoard parallel memory allocator","archived":false,"fork":false,"pushed_at":"2015-01-20T02:49:08.000Z","size":836,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-04-09T22:00:52.018Z","etag":null,"topics":["c","memory-allocation"],"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/boompig.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}},"created_at":"2015-01-19T18:33:32.000Z","updated_at":"2022-06-28T06:41:50.000Z","dependencies_parsed_at":"2022-08-24T14:44:41.723Z","dependency_job_id":null,"html_url":"https://github.com/boompig/hoard","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/boompig%2Fhoard","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boompig%2Fhoard/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boompig%2Fhoard/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/boompig%2Fhoard/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/boompig","download_url":"https://codeload.github.com/boompig/hoard/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240230918,"owners_count":19768745,"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":["c","memory-allocation"],"created_at":"2025-02-22T20:19:39.852Z","updated_at":"2025-10-27T08:38:12.972Z","avatar_url":"https://github.com/boompig.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# About\n\nThis is a scalable, parallel memory allocator. It is based on the original Hoard paper [found here](http://people.cs.umass.edu/~emery/pubs/berger-asplos2000.pdf). We wrote this during our advanced operating system course, and included is our report and performance based on the benchmarks (also included).\n\n# Authors\n\nDaniel Kats and Tony Hong\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fboompig%2Fhoard","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fboompig%2Fhoard","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fboompig%2Fhoard/lists"}