{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:WAA5HWDRTAWZNDMHO5U4KTD6RC","short_pith_number":"pith:WAA5HWDR","schema_version":"1.0","canonical_sha256":"b001d3d871982d968d877769c54c7e88a7127ab5ea28cac1c6301e28814bebf9","source":{"kind":"arxiv","id":"1608.07200","version":2},"attestation_state":"computed","paper":{"title":"Bulk-synchronous pseudo-streaming algorithms for many-core accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abe Wits, Jan-Willem Buurlage, Tom Bannink","submitted_at":"2016-08-25T15:38:47Z","abstract_excerpt":"The bulk-synchronous parallel (BSP) model provides a framework for writing parallel programs with predictable performance. In this paper we extend the BSP model to support what we will call pseudo-streaming algorithms for accelerators. We also generalize the BSP cost function to these algorithms, so that it is possible to predict the running time for programs targeting many-core accelerators and to identify possible bottlenecks. Several examples of algorithms within this new framework will be explored. We extend the BSPlib standard by proposing a small number of new BSP primitives to create an"},"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":"1608.07200","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-08-25T15:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"78734e4d77cb3a8a7d33ff16f9f9efca20ccf9a5d2705d6b0a000a669ab0d6c5","abstract_canon_sha256":"6c9903937035ccd68ce978df86d252fd54db20f07a7d00ec4dff26e8af8702b9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:05.511395Z","signature_b64":"fA+3gH+v1ztyg4+fBNBDIVqO6CWs8gHp2p+eWdFbq7g3PwxpxLpQgw0PYPjpYM9CJBnHh+ngKuEFuQOYbUYVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b001d3d871982d968d877769c54c7e88a7127ab5ea28cac1c6301e28814bebf9","last_reissued_at":"2026-05-18T00:48:05.510833Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:05.510833Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bulk-synchronous pseudo-streaming algorithms for many-core accelerators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abe Wits, Jan-Willem Buurlage, Tom Bannink","submitted_at":"2016-08-25T15:38:47Z","abstract_excerpt":"The bulk-synchronous parallel (BSP) model provides a framework for writing parallel programs with predictable performance. In this paper we extend the BSP model to support what we will call pseudo-streaming algorithms for accelerators. We also generalize the BSP cost function to these algorithms, so that it is possible to predict the running time for programs targeting many-core accelerators and to identify possible bottlenecks. Several examples of algorithms within this new framework will be explored. We extend the BSPlib standard by proposing a small number of new BSP primitives to create an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07200","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":"1608.07200","created_at":"2026-05-18T00:48:05.510921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.07200v2","created_at":"2026-05-18T00:48:05.510921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07200","created_at":"2026-05-18T00:48:05.510921+00:00"},{"alias_kind":"pith_short_12","alias_value":"WAA5HWDRTAWZ","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"WAA5HWDRTAWZNDMH","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"WAA5HWDR","created_at":"2026-05-18T12:30:48.956258+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/WAA5HWDRTAWZNDMHO5U4KTD6RC","json":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC.json","graph_json":"https://pith.science/api/pith-number/WAA5HWDRTAWZNDMHO5U4KTD6RC/graph.json","events_json":"https://pith.science/api/pith-number/WAA5HWDRTAWZNDMHO5U4KTD6RC/events.json","paper":"https://pith.science/paper/WAA5HWDR"},"agent_actions":{"view_html":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC","download_json":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC.json","view_paper":"https://pith.science/paper/WAA5HWDR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.07200&json=true","fetch_graph":"https://pith.science/api/pith-number/WAA5HWDRTAWZNDMHO5U4KTD6RC/graph.json","fetch_events":"https://pith.science/api/pith-number/WAA5HWDRTAWZNDMHO5U4KTD6RC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC/action/storage_attestation","attest_author":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC/action/author_attestation","sign_citation":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC/action/citation_signature","submit_replication":"https://pith.science/pith/WAA5HWDRTAWZNDMHO5U4KTD6RC/action/replication_record"}},"created_at":"2026-05-18T00:48:05.510921+00:00","updated_at":"2026-05-18T00:48:05.510921+00:00"}