{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:KQGKJD7BNS3VGHIEW7SIE62ZDN","short_pith_number":"pith:KQGKJD7B","schema_version":"1.0","canonical_sha256":"540ca48fe16cb7531d04b7e4827b591b4ca65d7f3835a9ae0264c70db2a70d70","source":{"kind":"arxiv","id":"1707.08357","version":1},"attestation_state":"computed","paper":{"title":"Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajay Singh, Anila Kumari, G Monika, Sathya Peri","submitted_at":"2017-07-26T10:24:36Z","abstract_excerpt":"Writing concurrent programs for shared memory multiprocessor systems is a nightmare. This hinders users to exploit the full potential of multiprocessors. STM (Software Transactional Memory) is a promising concurrent programming paradigm which addresses woes of programming for multiprocessor systems.\n  In this paper, we implement BTO (Basic Timestamp Ordering), SGT (Serialization Graph Testing) and MVTO(Multi-Version Time-Stamp Ordering) concurrency control protocols and build an STM(Software Transactional Memory) library to evaluate the performance of these protocols. The deferred write approa"},"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":"1707.08357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-26T10:24:36Z","cross_cats_sorted":[],"title_canon_sha256":"777cfc317a73fd360c93f869d18cf10bf0598cd094dcdf75ad9605b598825450","abstract_canon_sha256":"7a30034c6ff13c2375253aac2d8dc94fee2428c743848e13b4d10a05eb35ab7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:24.447977Z","signature_b64":"CZSbIyio6eF0CGbi/eeDnwdXJweh084DwcZ/efPchKXyH9srgLgcEVRIcgkRgudF6+ge+OZACU14KCWmSibZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"540ca48fe16cb7531d04b7e4827b591b4ca65d7f3835a9ae0264c70db2a70d70","last_reissued_at":"2026-05-18T00:39:24.447390Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:24.447390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Comparison of Various STM Concurrency Control Protocols Using Synchrobench","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ajay Singh, Anila Kumari, G Monika, Sathya Peri","submitted_at":"2017-07-26T10:24:36Z","abstract_excerpt":"Writing concurrent programs for shared memory multiprocessor systems is a nightmare. This hinders users to exploit the full potential of multiprocessors. STM (Software Transactional Memory) is a promising concurrent programming paradigm which addresses woes of programming for multiprocessor systems.\n  In this paper, we implement BTO (Basic Timestamp Ordering), SGT (Serialization Graph Testing) and MVTO(Multi-Version Time-Stamp Ordering) concurrency control protocols and build an STM(Software Transactional Memory) library to evaluate the performance of these protocols. The deferred write approa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.08357","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":"1707.08357","created_at":"2026-05-18T00:39:24.447489+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.08357v1","created_at":"2026-05-18T00:39:24.447489+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.08357","created_at":"2026-05-18T00:39:24.447489+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQGKJD7BNS3V","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQGKJD7BNS3VGHIE","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQGKJD7B","created_at":"2026-05-18T12:31:24.725408+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/KQGKJD7BNS3VGHIEW7SIE62ZDN","json":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN.json","graph_json":"https://pith.science/api/pith-number/KQGKJD7BNS3VGHIEW7SIE62ZDN/graph.json","events_json":"https://pith.science/api/pith-number/KQGKJD7BNS3VGHIEW7SIE62ZDN/events.json","paper":"https://pith.science/paper/KQGKJD7B"},"agent_actions":{"view_html":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN","download_json":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN.json","view_paper":"https://pith.science/paper/KQGKJD7B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.08357&json=true","fetch_graph":"https://pith.science/api/pith-number/KQGKJD7BNS3VGHIEW7SIE62ZDN/graph.json","fetch_events":"https://pith.science/api/pith-number/KQGKJD7BNS3VGHIEW7SIE62ZDN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/action/storage_attestation","attest_author":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/action/author_attestation","sign_citation":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/action/citation_signature","submit_replication":"https://pith.science/pith/KQGKJD7BNS3VGHIEW7SIE62ZDN/action/replication_record"}},"created_at":"2026-05-18T00:39:24.447489+00:00","updated_at":"2026-05-18T00:39:24.447489+00:00"}