{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:7WERN4263DHAUCZJTXJEBQJU6V","short_pith_number":"pith:7WERN426","schema_version":"1.0","canonical_sha256":"fd8916f35ed8ce0a0b299dd240c134f56f2e1f45cb8a08518ff679a8e81c57d8","source":{"kind":"arxiv","id":"1101.1466","version":1},"attestation_state":"computed","paper":{"title":"Comparison of Loss ratios of different scheduling algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Debasis Sengupta, Lawrence Jenkins, Sudipta Das","submitted_at":"2011-01-06T10:28:58Z","abstract_excerpt":"It is well known that in a firm real time system with a renewal arrival process, exponential service times and independent and identically distributed deadlines till the end of service of a job, the earliest deadline first (EDF) scheduling policy has smaller loss ratio (expected fraction of jobs, not completed) than any other service time independent scheduling policy, including the first come first served (FCFS). Various modifications to the EDF and FCFS policies have been proposed in the literature, with a view to improving performance. In this article, we compare the loss ratios of these tw"},"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":"1101.1466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2011-01-06T10:28:58Z","cross_cats_sorted":[],"title_canon_sha256":"00ce9189db4c9752958f2357f85c4f9691c784bed613b6ea69495b6c69197555","abstract_canon_sha256":"d33e8e4d7ada11990b69d66ff4a4e0f0484b2c5e22a120de117f534746c50200"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:00.052137Z","signature_b64":"xFO0sx3IA26WdhEBy65Xtydfsj5U22SYkFTHMW6RN3oCBNMF7wlg4bI8+TSCmrp3sZ+fuaEbMftjo5iYVRt7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd8916f35ed8ce0a0b299dd240c134f56f2e1f45cb8a08518ff679a8e81c57d8","last_reissued_at":"2026-05-18T02:23:00.051036Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:00.051036Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparison of Loss ratios of different scheduling algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Debasis Sengupta, Lawrence Jenkins, Sudipta Das","submitted_at":"2011-01-06T10:28:58Z","abstract_excerpt":"It is well known that in a firm real time system with a renewal arrival process, exponential service times and independent and identically distributed deadlines till the end of service of a job, the earliest deadline first (EDF) scheduling policy has smaller loss ratio (expected fraction of jobs, not completed) than any other service time independent scheduling policy, including the first come first served (FCFS). Various modifications to the EDF and FCFS policies have been proposed in the literature, with a view to improving performance. In this article, we compare the loss ratios of these tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1466","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":"1101.1466","created_at":"2026-05-18T02:23:00.051178+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1466v1","created_at":"2026-05-18T02:23:00.051178+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1466","created_at":"2026-05-18T02:23:00.051178+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WERN4263DHA","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WERN4263DHAUCZJ","created_at":"2026-05-18T12:26:22.705136+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WERN426","created_at":"2026-05-18T12:26:22.705136+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/7WERN4263DHAUCZJTXJEBQJU6V","json":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V.json","graph_json":"https://pith.science/api/pith-number/7WERN4263DHAUCZJTXJEBQJU6V/graph.json","events_json":"https://pith.science/api/pith-number/7WERN4263DHAUCZJTXJEBQJU6V/events.json","paper":"https://pith.science/paper/7WERN426"},"agent_actions":{"view_html":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V","download_json":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V.json","view_paper":"https://pith.science/paper/7WERN426","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1466&json=true","fetch_graph":"https://pith.science/api/pith-number/7WERN4263DHAUCZJTXJEBQJU6V/graph.json","fetch_events":"https://pith.science/api/pith-number/7WERN4263DHAUCZJTXJEBQJU6V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V/action/storage_attestation","attest_author":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V/action/author_attestation","sign_citation":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V/action/citation_signature","submit_replication":"https://pith.science/pith/7WERN4263DHAUCZJTXJEBQJU6V/action/replication_record"}},"created_at":"2026-05-18T02:23:00.051178+00:00","updated_at":"2026-05-18T02:23:00.051178+00:00"}