{"id":15896731,"url":"https://github.com/d4l3k/axe","last_synced_at":"2025-04-02T19:10:00.563Z","repository":{"id":143036412,"uuid":"272095895","full_name":"d4l3k/axe","owner":"d4l3k","description":"A simple graph partitioning algorithm written in Go. Designed for use for partitioning neural networks across multiple devices which has an added cost when crossing device boundaries.","archived":false,"fork":false,"pushed_at":"2020-06-17T17:43:03.000Z","size":10,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-02-08T09:30:33.631Z","etag":null,"topics":["graph-partitioning","machine-learning","model-parallelism"],"latest_commit_sha":null,"homepage":null,"language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/d4l3k.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","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":"2020-06-13T22:32:03.000Z","updated_at":"2020-06-17T17:43:05.000Z","dependencies_parsed_at":"2023-04-16T08:03:39.021Z","dependency_job_id":null,"html_url":"https://github.com/d4l3k/axe","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/d4l3k%2Faxe","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/d4l3k%2Faxe/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/d4l3k%2Faxe/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/d4l3k%2Faxe/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/d4l3k","download_url":"https://codeload.github.com/d4l3k/axe/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246875906,"owners_count":20848048,"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":["graph-partitioning","machine-learning","model-parallelism"],"created_at":"2024-10-06T09:22:02.591Z","updated_at":"2025-04-02T19:10:00.543Z","avatar_url":"https://github.com/d4l3k.png","language":"Go","funding_links":[],"categories":[],"sub_categories":[],"readme":"# axe\nA simple graph partitioning algorithm written in Go.\n\nDesigned for use for partitioning neural networks across multiple devices which has an added cost when crossing device boundaries.\n\nCurrent algorithm uses a form of simulated anealing to find an approximate global minima and then once the temperature is 0 does greedy optimizination to find the local minima.\n\n## License\n\nCopyright (c) 2020 Tristan Rice\n\nLicensed under the MIT license.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fd4l3k%2Faxe","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fd4l3k%2Faxe","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fd4l3k%2Faxe/lists"}