{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7VBMEBSHSVPCFO6KZGHN3GQ5UQ","short_pith_number":"pith:7VBMEBSH","schema_version":"1.0","canonical_sha256":"fd42c20647955e22bbcac98edd9a1da40e971bda98772a94fc2c86e24b901156","source":{"kind":"arxiv","id":"1711.00231","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Load Balancing Strategies for Graph Applications on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ananya Raval, Keshav Pingali, Rupesh Nasre, Sathish Vadhiyar, Vasudevan R, Vivek Kumar","submitted_at":"2017-11-01T07:24:24Z","abstract_excerpt":"Acceleration of graph applications on GPUs has found large interest due to the ubiquitous use of graph processing in various domains. The inherent \\textit{irregularity} in graph applications leads to several challenges for parallelization. A key challenge, which we address in this paper, is that of load-imbalance. If the work-assignment to threads uses node-based graph partitioning, it can result in skewed task-distribution, leading to poor load-balance. In contrast, if the work-assignment uses edge-based graph partitioning, the load-balancing is better, but the memory requirement is relativel"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1711.00231","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-11-01T07:24:24Z","cross_cats_sorted":[],"title_canon_sha256":"356a93cc29c47cc592259731dbe20c6991fe66c2a8e9748daf555e7f5bdf3e1d","abstract_canon_sha256":"4e7c975a99384a86f5acbcc7b45ed609e37676a05bcd3b9fcddccdfe2c20b3a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:34.720776Z","signature_b64":"kbpgi8shlDTrZK6vHu7/JhqxVsGhrLRQesMa+TGFi0iVwulzk9acdL3InEaneNlIHJ9ekRoGDlOWb8n87dQdCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd42c20647955e22bbcac98edd9a1da40e971bda98772a94fc2c86e24b901156","last_reissued_at":"2026-05-18T00:31:34.720199Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:34.720199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Load Balancing Strategies for Graph Applications on GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ananya Raval, Keshav Pingali, Rupesh Nasre, Sathish Vadhiyar, Vasudevan R, Vivek Kumar","submitted_at":"2017-11-01T07:24:24Z","abstract_excerpt":"Acceleration of graph applications on GPUs has found large interest due to the ubiquitous use of graph processing in various domains. The inherent \\textit{irregularity} in graph applications leads to several challenges for parallelization. A key challenge, which we address in this paper, is that of load-imbalance. If the work-assignment to threads uses node-based graph partitioning, it can result in skewed task-distribution, leading to poor load-balance. In contrast, if the work-assignment uses edge-based graph partitioning, the load-balancing is better, but the memory requirement is relativel"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00231","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.00231","created_at":"2026-05-18T00:31:34.720298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00231v1","created_at":"2026-05-18T00:31:34.720298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00231","created_at":"2026-05-18T00:31:34.720298+00:00"},{"alias_kind":"pith_short_12","alias_value":"7VBMEBSHSVPC","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7VBMEBSHSVPCFO6K","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7VBMEBSH","created_at":"2026-05-18T12:31:05.417338+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ","json":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ.json","graph_json":"https://pith.science/api/pith-number/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/graph.json","events_json":"https://pith.science/api/pith-number/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/events.json","paper":"https://pith.science/paper/7VBMEBSH"},"agent_actions":{"view_html":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ","download_json":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ.json","view_paper":"https://pith.science/paper/7VBMEBSH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00231&json=true","fetch_graph":"https://pith.science/api/pith-number/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/graph.json","fetch_events":"https://pith.science/api/pith-number/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/action/storage_attestation","attest_author":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/action/author_attestation","sign_citation":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/action/citation_signature","submit_replication":"https://pith.science/pith/7VBMEBSHSVPCFO6KZGHN3GQ5UQ/action/replication_record"}},"created_at":"2026-05-18T00:31:34.720298+00:00","updated_at":"2026-05-18T00:31:34.720298+00:00"}