{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:P5DZJ6JGCPWQRYZT72DCTNDQPS","short_pith_number":"pith:P5DZJ6JG","schema_version":"1.0","canonical_sha256":"7f4794f92613ed08e333fe8629b4707c9c01ecdb19446f09bfe65b5cf04939c4","source":{"kind":"arxiv","id":"1009.0056","version":1},"attestation_state":"computed","paper":{"title":"A Competitive Analysis for Balanced Transactional Memory Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Costas Busch, Gokarna Sharma","submitted_at":"2010-08-31T23:54:57Z","abstract_excerpt":"We consider transactional memory contention management in the context of balanced workloads, where if a transaction is writing, the number of write operations it performs is a constant fraction of its total reads and writes. We explore the theoretical performance boundaries of contention management in balanced workloads from the worst-case perspective by presenting and analyzing two new contention management algorithms. The first algorithm Clairvoyant is O(\\surd s)-competitive, where s is the number of shared resources. This algorithm depends on explicitly knowing the conflict graph. The secon"},"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":"1009.0056","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2010-08-31T23:54:57Z","cross_cats_sorted":[],"title_canon_sha256":"af8e1adb8a3b0f3f79bba179084a34945ccbbe5a2949dc0d5676577d00cfb278","abstract_canon_sha256":"aaf680373cb9273c02e6c30f2229b4a5c7f1680b0e17f26fd3a7379a881d6314"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:35.630906Z","signature_b64":"lJxD4vkGpAzNKFlShUDhczp/m8tmqcQt1ohgugCxVKkJiZcxCw6iPFBhThwe8b9hZxPxJCfPb+aLRc+yjxBYCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f4794f92613ed08e333fe8629b4707c9c01ecdb19446f09bfe65b5cf04939c4","last_reissued_at":"2026-05-18T04:41:35.630449Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:35.630449Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Competitive Analysis for Balanced Transactional Memory Workloads","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Costas Busch, Gokarna Sharma","submitted_at":"2010-08-31T23:54:57Z","abstract_excerpt":"We consider transactional memory contention management in the context of balanced workloads, where if a transaction is writing, the number of write operations it performs is a constant fraction of its total reads and writes. We explore the theoretical performance boundaries of contention management in balanced workloads from the worst-case perspective by presenting and analyzing two new contention management algorithms. The first algorithm Clairvoyant is O(\\surd s)-competitive, where s is the number of shared resources. This algorithm depends on explicitly knowing the conflict graph. The secon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.0056","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":"1009.0056","created_at":"2026-05-18T04:41:35.630522+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.0056v1","created_at":"2026-05-18T04:41:35.630522+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.0056","created_at":"2026-05-18T04:41:35.630522+00:00"},{"alias_kind":"pith_short_12","alias_value":"P5DZJ6JGCPWQ","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"P5DZJ6JGCPWQRYZT","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"P5DZJ6JG","created_at":"2026-05-18T12:26:12.377268+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/P5DZJ6JGCPWQRYZT72DCTNDQPS","json":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS.json","graph_json":"https://pith.science/api/pith-number/P5DZJ6JGCPWQRYZT72DCTNDQPS/graph.json","events_json":"https://pith.science/api/pith-number/P5DZJ6JGCPWQRYZT72DCTNDQPS/events.json","paper":"https://pith.science/paper/P5DZJ6JG"},"agent_actions":{"view_html":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS","download_json":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS.json","view_paper":"https://pith.science/paper/P5DZJ6JG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.0056&json=true","fetch_graph":"https://pith.science/api/pith-number/P5DZJ6JGCPWQRYZT72DCTNDQPS/graph.json","fetch_events":"https://pith.science/api/pith-number/P5DZJ6JGCPWQRYZT72DCTNDQPS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/action/storage_attestation","attest_author":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/action/author_attestation","sign_citation":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/action/citation_signature","submit_replication":"https://pith.science/pith/P5DZJ6JGCPWQRYZT72DCTNDQPS/action/replication_record"}},"created_at":"2026-05-18T04:41:35.630522+00:00","updated_at":"2026-05-18T04:41:35.630522+00:00"}