{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:EDHRPRQ46DTDFE7Z6JYEZ6WSBM","short_pith_number":"pith:EDHRPRQ4","schema_version":"1.0","canonical_sha256":"20cf17c61cf0e63293f9f2704cfad20b10e1cea3250aa8bf1c780dd2845baba9","source":{"kind":"arxiv","id":"1306.5076","version":2},"attestation_state":"computed","paper":{"title":"Bank Conflict Free Comparison-based Sorting On GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Nodari Sitchinava, Volker Weichert","submitted_at":"2013-06-21T08:57:39Z","abstract_excerpt":"In this paper we present a framework for designing algorithms in shared memory of GPUs without incurring memory bank conflicts. Using our framework we develop the first comparison-based shared memory sorting algorithm that incurs no bank conflicts. It can be used as a subroutine for GPU sorting algorithms to replace current use of sorting networks in shared memory. Using our bank conflict free shared memory sorting subroutine as a black box, we design BCFMergesort, an algorithm for merging sorted streams of data that are larger than shared memory. Our algorithm performs all accesses to global "},"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":"1306.5076","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-06-21T08:57:39Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f539f7747b4b463ce79d2d5d1561d1e9338859ae185a17c58c27bbd5d7cc9c9f","abstract_canon_sha256":"b9ab4141fc9e7abd3eccaf5bfddb8780d57d2300c87b1c786f76487a565905d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.084554Z","signature_b64":"ckMQtMypntExNaPihYWMxXwc0Kah5hH8eMiJmv5UOhtP0pGlKd6EQSS8ssZdP6KPcPZtSro5Nbvz+z9r/iNWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20cf17c61cf0e63293f9f2704cfad20b10e1cea3250aa8bf1c780dd2845baba9","last_reissued_at":"2026-05-18T01:02:50.084062Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.084062Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bank Conflict Free Comparison-based Sorting On GPUs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Nodari Sitchinava, Volker Weichert","submitted_at":"2013-06-21T08:57:39Z","abstract_excerpt":"In this paper we present a framework for designing algorithms in shared memory of GPUs without incurring memory bank conflicts. Using our framework we develop the first comparison-based shared memory sorting algorithm that incurs no bank conflicts. It can be used as a subroutine for GPU sorting algorithms to replace current use of sorting networks in shared memory. Using our bank conflict free shared memory sorting subroutine as a black box, we design BCFMergesort, an algorithm for merging sorted streams of data that are larger than shared memory. Our algorithm performs all accesses to global "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5076","kind":"arxiv","version":2},"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":"1306.5076","created_at":"2026-05-18T01:02:50.084147+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5076v2","created_at":"2026-05-18T01:02:50.084147+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5076","created_at":"2026-05-18T01:02:50.084147+00:00"},{"alias_kind":"pith_short_12","alias_value":"EDHRPRQ46DTD","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"EDHRPRQ46DTDFE7Z","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"EDHRPRQ4","created_at":"2026-05-18T12:27:43.054852+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/EDHRPRQ46DTDFE7Z6JYEZ6WSBM","json":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM.json","graph_json":"https://pith.science/api/pith-number/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/graph.json","events_json":"https://pith.science/api/pith-number/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/events.json","paper":"https://pith.science/paper/EDHRPRQ4"},"agent_actions":{"view_html":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM","download_json":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM.json","view_paper":"https://pith.science/paper/EDHRPRQ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5076&json=true","fetch_graph":"https://pith.science/api/pith-number/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/graph.json","fetch_events":"https://pith.science/api/pith-number/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/action/storage_attestation","attest_author":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/action/author_attestation","sign_citation":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/action/citation_signature","submit_replication":"https://pith.science/pith/EDHRPRQ46DTDFE7Z6JYEZ6WSBM/action/replication_record"}},"created_at":"2026-05-18T01:02:50.084147+00:00","updated_at":"2026-05-18T01:02:50.084147+00:00"}