{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:I2BU22T4MHEYCAEZ5DDROG4CSO","short_pith_number":"pith:I2BU22T4","schema_version":"1.0","canonical_sha256":"46834d6a7c61c9810099e8c7171b8293b132569d523337a9cc9e738c1bb0ded0","source":{"kind":"arxiv","id":"2109.00657","version":1},"attestation_state":"computed","paper":{"title":"Multi-Queues Can Be State-of-the-Art Priority Schedulers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anastasiia Postnikova, Dan Alistarh, Giorgi Nadiradze, Nikita Koval","submitted_at":"2021-09-02T00:36:16Z","abstract_excerpt":"Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given $n$ threads and $m\\ge n$ distinct priority queues, task insertions are performed uniformly at random, while, to delete, a thread picks two queues uniformly at random, and removes the observed task of higher priority. This approach scales well, and has probabilistic rank guarantees: roughly, the rank of each task removed, relative to remaining tasks in all other queues, is $O(m)$ in expectation. Yet, the performance of this pattern is below that o"},"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":"2109.00657","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-09-02T00:36:16Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6347f738f133231083ec86212a1f2dca78d79e73fb6bf5302287a5ab55698cd8","abstract_canon_sha256":"8a8c70c1a3187666d43e45c387b69e863ce9e2e29702cc4332aa5f60b263ded6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:57.292620Z","signature_b64":"a6DfwIrYqHnR49q3ZdYm6seY8a4lkXOhjNe7UEFTDJTeqsZQNAkFF90Ql+AL9LVZbrjOHcVmnVizJMWH+3eJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46834d6a7c61c9810099e8c7171b8293b132569d523337a9cc9e738c1bb0ded0","last_reissued_at":"2026-07-05T03:10:57.292214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:57.292214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Queues Can Be State-of-the-Art Priority Schedulers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anastasiia Postnikova, Dan Alistarh, Giorgi Nadiradze, Nikita Koval","submitted_at":"2021-09-02T00:36:16Z","abstract_excerpt":"Designing and implementing efficient parallel priority schedulers is an active research area. An intriguing proposed design is the Multi-Queue: given $n$ threads and $m\\ge n$ distinct priority queues, task insertions are performed uniformly at random, while, to delete, a thread picks two queues uniformly at random, and removes the observed task of higher priority. This approach scales well, and has probabilistic rank guarantees: roughly, the rank of each task removed, relative to remaining tasks in all other queues, is $O(m)$ in expectation. Yet, the performance of this pattern is below that o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00657","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.00657/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.00657","created_at":"2026-07-05T03:10:57.292277+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.00657v1","created_at":"2026-07-05T03:10:57.292277+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00657","created_at":"2026-07-05T03:10:57.292277+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2BU22T4MHEY","created_at":"2026-07-05T03:10:57.292277+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2BU22T4MHEYCAEZ","created_at":"2026-07-05T03:10:57.292277+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2BU22T4","created_at":"2026-07-05T03:10:57.292277+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/I2BU22T4MHEYCAEZ5DDROG4CSO","json":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO.json","graph_json":"https://pith.science/api/pith-number/I2BU22T4MHEYCAEZ5DDROG4CSO/graph.json","events_json":"https://pith.science/api/pith-number/I2BU22T4MHEYCAEZ5DDROG4CSO/events.json","paper":"https://pith.science/paper/I2BU22T4"},"agent_actions":{"view_html":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO","download_json":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO.json","view_paper":"https://pith.science/paper/I2BU22T4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.00657&json=true","fetch_graph":"https://pith.science/api/pith-number/I2BU22T4MHEYCAEZ5DDROG4CSO/graph.json","fetch_events":"https://pith.science/api/pith-number/I2BU22T4MHEYCAEZ5DDROG4CSO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/action/storage_attestation","attest_author":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/action/author_attestation","sign_citation":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/action/citation_signature","submit_replication":"https://pith.science/pith/I2BU22T4MHEYCAEZ5DDROG4CSO/action/replication_record"}},"created_at":"2026-07-05T03:10:57.292277+00:00","updated_at":"2026-07-05T03:10:57.292277+00:00"}