{"id":18350359,"url":"https://github.com/tnas/reordering-library","last_synced_at":"2026-02-12T06:32:44.580Z","repository":{"id":94324802,"uuid":"82069776","full_name":"tnas/reordering-library","owner":"tnas","description":"Parallel Algorithms for Sparse Matrices Reordering","archived":false,"fork":false,"pushed_at":"2018-01-02T14:56:56.000Z","size":70780,"stargazers_count":7,"open_issues_count":1,"forks_count":6,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-09-07T17:55:38.715Z","etag":null,"topics":["algorithms","matrix","parallel","reordering","sparse"],"latest_commit_sha":null,"homepage":"","language":"Fortran","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/tnas.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":"2017-02-15T14:34:07.000Z","updated_at":"2025-07-17T11:21:33.000Z","dependencies_parsed_at":"2023-03-13T17:02:06.949Z","dependency_job_id":null,"html_url":"https://github.com/tnas/reordering-library","commit_stats":null,"previous_names":[],"tags_count":5,"template":false,"template_full_name":null,"purl":"pkg:github/tnas/reordering-library","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tnas%2Freordering-library","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tnas%2Freordering-library/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tnas%2Freordering-library/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tnas%2Freordering-library/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tnas","download_url":"https://codeload.github.com/tnas/reordering-library/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tnas%2Freordering-library/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29360644,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-12T01:03:07.613Z","status":"online","status_checked_at":"2026-02-12T02:00:06.911Z","response_time":55,"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":["algorithms","matrix","parallel","reordering","sparse"],"created_at":"2024-11-05T21:26:20.154Z","updated_at":"2026-02-12T06:32:44.565Z","avatar_url":"https://github.com/tnas.png","language":"Fortran","readme":"## Non-Specultive Data-Driven Parallelizations of Irregular Algorithms for Sparse Matrices Reordering\n\nThis project aims the parallelization of some algorithms for the bandwidth and wavefront reduction problems. \nThe related algorithms are:\n* Reverse Cuthill McKee - RCM (Bandwidth Reduction)\n* Sloan (Wavefront Reduction)\n\n### Dependencies\nOn linux, execute the command to install libraries used by the program:\n\n\u003ccode\u003e\nsudo apt-get install cmake libboost-all-dev gfortran libblas-dev\n\u003c/code\u003e\n\n### Running\n\u003ccode\u003e\n./reordering-library -m \u0026lt;path of .mtx file\u0026gt; -a \u0026lt;algorithm\u0026gt; -p \u0026lt;number of threads\u0026gt; -b \u0026lt;percent of chunk\u0026gt;\n\u003c/code\u003e\n\n\u003cbr\u003e\n\n\u003ccode\u003e\n  \u0026lt;algorithm\u0026gt;\n\u003c/code\u003e\n\n * \t0: Serial RCM\n * \t1: Serial Sloan\n * \t2: HSL RCM\n * \t3: HSL Spectral\n * \t4: HSL Sloan\n * \t5: Unordered RCM\n * \t6: Leveled RCM\n * \t7: Bucket RCM\n * \t8: Relaxed Order Sloan\n * \t9: Boost RCM\n * 10: Boost Sloan\n * 11: Logical Bag Sloan\n * 12: Shrinked RCM\n\n\u003ccode\u003e\n  \u0026lt;percent of chunk\u0026gt;\n\u003c/code\u003e\n\n * It is recommended the value of 0.5.\n \nExample:\n\n\u003ccode\u003e\n  ./reordering-library -m ./Matrices/rail_5177.mtx -a 5 -p 4 -b .5\n\u003c/code\u003e\n\n* In this example, the matrix rail_5177 is processed by the Unordered RCM algorithm. It is executed with 4 threads.\n \n### Profiling\n\u003ccode\u003e\nvalgrind --leak-check=yes myprog arg1 arg2\n\u003c/code\u003e\n\n* For memory check, Valgrind has been used.\n\n\u003ccode\u003e\nvalgrind --tool=callgrind program [program_options]\n\u003c/code\u003e\n\n* For performance profiling, Callgrind has been used.\n\n\u003ccode\u003e\nkcachegrind callgrind.out.XXX\n\u003c/code\u003e\n\n* For graphical performance visualization, KCachegrind has been used. The file callgrind.out.XXX is yielded by Callgrind, and XXX is the process identifier. \n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftnas%2Freordering-library","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftnas%2Freordering-library","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftnas%2Freordering-library/lists"}