{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:66TQETDY7S5JR5ZVOZJCIITN4F","short_pith_number":"pith:66TQETDY","schema_version":"1.0","canonical_sha256":"f7a7024c78fcba98f735765224226de176359ca0dbcfb1e4ba807bf61dd87c16","source":{"kind":"arxiv","id":"1506.09158","version":1},"attestation_state":"computed","paper":{"title":"On Fair Size-Based Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Damiano Carra, Matteo Dell'Amico, Pietro Michiardi","submitted_at":"2015-06-30T17:02:17Z","abstract_excerpt":"By executing jobs serially rather than in parallel, size-based scheduling policies can shorten time needed to complete jobs; however, major obstacles to their applicability are fairness guarantees and the fact that job sizes are rarely known exactly a-priori. Here, we introduce the Pri family of size-based scheduling policies; Pri simulates any reference scheduler and executes jobs in the order of their simulated completion: we show that these schedulers give strong fairness guarantees, since no job completes later in Pri than in the reference policy. In addition, we introduce PSBS, a practica"},"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":"1506.09158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-30T17:02:17Z","cross_cats_sorted":[],"title_canon_sha256":"e2f0c2298653aa031715039107287c934629b905d8e7616bc56d3c702f0fbf75","abstract_canon_sha256":"fea8ca06800bafbb490608e1c9a4fc7057c5ee40a819b5acc59e6c42ec07b1f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:33.536231Z","signature_b64":"XlOA2lbDL7kK6Flc6LKCLk7plHbEKTiNRuX4rkxwz+PaL8dukrQ0U0Q6pmwrD5z/liyBe53AluGxgGmj4F8BCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7a7024c78fcba98f735765224226de176359ca0dbcfb1e4ba807bf61dd87c16","last_reissued_at":"2026-05-18T01:37:33.535504Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:33.535504Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Fair Size-Based Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Damiano Carra, Matteo Dell'Amico, Pietro Michiardi","submitted_at":"2015-06-30T17:02:17Z","abstract_excerpt":"By executing jobs serially rather than in parallel, size-based scheduling policies can shorten time needed to complete jobs; however, major obstacles to their applicability are fairness guarantees and the fact that job sizes are rarely known exactly a-priori. Here, we introduce the Pri family of size-based scheduling policies; Pri simulates any reference scheduler and executes jobs in the order of their simulated completion: we show that these schedulers give strong fairness guarantees, since no job completes later in Pri than in the reference policy. In addition, we introduce PSBS, a practica"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.09158","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":"1506.09158","created_at":"2026-05-18T01:37:33.535635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.09158v1","created_at":"2026-05-18T01:37:33.535635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.09158","created_at":"2026-05-18T01:37:33.535635+00:00"},{"alias_kind":"pith_short_12","alias_value":"66TQETDY7S5J","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_16","alias_value":"66TQETDY7S5JR5ZV","created_at":"2026-05-18T12:29:07.941421+00:00"},{"alias_kind":"pith_short_8","alias_value":"66TQETDY","created_at":"2026-05-18T12:29:07.941421+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/66TQETDY7S5JR5ZVOZJCIITN4F","json":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F.json","graph_json":"https://pith.science/api/pith-number/66TQETDY7S5JR5ZVOZJCIITN4F/graph.json","events_json":"https://pith.science/api/pith-number/66TQETDY7S5JR5ZVOZJCIITN4F/events.json","paper":"https://pith.science/paper/66TQETDY"},"agent_actions":{"view_html":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F","download_json":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F.json","view_paper":"https://pith.science/paper/66TQETDY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.09158&json=true","fetch_graph":"https://pith.science/api/pith-number/66TQETDY7S5JR5ZVOZJCIITN4F/graph.json","fetch_events":"https://pith.science/api/pith-number/66TQETDY7S5JR5ZVOZJCIITN4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F/action/storage_attestation","attest_author":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F/action/author_attestation","sign_citation":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F/action/citation_signature","submit_replication":"https://pith.science/pith/66TQETDY7S5JR5ZVOZJCIITN4F/action/replication_record"}},"created_at":"2026-05-18T01:37:33.535635+00:00","updated_at":"2026-05-18T01:37:33.535635+00:00"}