{"id":23421996,"url":"https://github.com/sdasgup3/parallel-sudoku","last_synced_at":"2025-08-31T20:11:26.956Z","repository":{"id":20888680,"uuid":"24176019","full_name":"sdasgup3/parallel-sudoku","owner":"sdasgup3","description":"Parallel Sudoku Implementation using Charm++","archived":false,"fork":false,"pushed_at":"2014-12-15T06:18:54.000Z","size":16124,"stargazers_count":1,"open_issues_count":0,"forks_count":6,"subscribers_count":5,"default_branch":"master","last_synced_at":"2025-04-12T14:15:45.427Z","etag":null,"topics":["charmplusplus","constraints","domain-decomposition","graph-algorithms","graph-coloring","loadbalancing","processor","state-space-search","sudoku-solver","vertices"],"latest_commit_sha":null,"homepage":"","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/sdasgup3.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":"2014-09-18T06:03:18.000Z","updated_at":"2024-02-18T11:46:47.000Z","dependencies_parsed_at":"2022-08-30T14:51:07.928Z","dependency_job_id":null,"html_url":"https://github.com/sdasgup3/parallel-sudoku","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/sdasgup3/parallel-sudoku","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fparallel-sudoku","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fparallel-sudoku/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fparallel-sudoku/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fparallel-sudoku/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/sdasgup3","download_url":"https://codeload.github.com/sdasgup3/parallel-sudoku/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/sdasgup3%2Fparallel-sudoku/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273032934,"owners_count":25034067,"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-08-31T02:00:09.071Z","response_time":79,"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":["charmplusplus","constraints","domain-decomposition","graph-algorithms","graph-coloring","loadbalancing","processor","state-space-search","sudoku-solver","vertices"],"created_at":"2024-12-23T02:25:39.042Z","updated_at":"2025-08-31T20:11:26.886Z","avatar_url":"https://github.com/sdasgup3.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"Parallel Graph Coloring\n=========================\nThe graph coloring problem deals with assigning each vertex of the graph with a color such that the adjacent vertices have distinct colors. Many applications have been shown to be reducible to the graph coloring problem. Some of these include 1) register allocation in the back-end of a complier, and 2) scheduling of multiple tasks to resources under various constraints. Graph coloring is computationally hard. It is NP-complete to determine if a given graph admits k-coloring (except for k=1 or k=2).\n\nState space search is a technique where successive configurations (a.k.a states) are explored until the state with desired property is found. The different states form a tree where child nodes are produced from the parent node by changing some part of the parent state. In typical problems, exploring the entire state space graph is impractical due to execution time and memory constraints. Application of heuristics has been shown to be effective in pruning the search space.\n\n\nLarge-scale systems with distributed memory are a natural fit to solving the\ncomputationally complex graph coloring problem. There are two main\nparallelization strategies, namely domain decomposition and state space\nexploration. In domain decomposition, the graph is divided into sub-graphs, and\neach of these is assigned to a processor. The sub-graph is colored locally at\neach processor. The algorithm operates in time-steps, where at the end of each\ntime-step, the processors exchange coloring information with each other to\nresolve the conflicts for the vertices on the sub-graph boundaries. State space exploration takes a\ndifferent approach to dividing work between processors. A state in the\nstate space tree is a partially colored input graph, and child states are\nproduced from parent states by coloring one of the uncolored vertices. A\nsolution is found if one of the leaves if a legitimately colored input graph.\nEach processor is responsible for exploration of a part of the state space\ntree.\n\nParallelSudoku (An application of graph coloring)\n===================================================\nhttps://fenix.tecnico.ulisboa.pt/downloadFile/3779576294079/projSudoku.pdf\nhttp://www.andrew.cmu.edu/user/hmhuang/project_template/finalreport.html\nhttp://alitarhini.wordpress.com/2011/04/06/parallel-depth-first-sudoku-solver-algorithm/\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsdasgup3%2Fparallel-sudoku","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsdasgup3%2Fparallel-sudoku","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsdasgup3%2Fparallel-sudoku/lists"}