{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:4M3N3EKCHJWNUVAZGFEG2GWUZB","short_pith_number":"pith:4M3N3EKC","schema_version":"1.0","canonical_sha256":"e336dd91423a6cda541931486d1ad4c84c9536e765b0473129587dcda4243eb6","source":{"kind":"arxiv","id":"1101.1718","version":1},"attestation_state":"computed","paper":{"title":"Precise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jagbeer Singh","submitted_at":"2011-01-10T08:31:45Z","abstract_excerpt":"In Real-time system, utilization based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm. Many real-time scheduling algorithms have been developed recently to reduce affinity in the portable devices"},"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.1718","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2011-01-10T08:31:45Z","cross_cats_sorted":[],"title_canon_sha256":"e0081e54ae58ebeb61a933c5719fe19496265951ba6b3130e248f4330cf3cdbb","abstract_canon_sha256":"cf7a9dca99eea13323bdc2e7ca7760bd302087ee3aca58b8e5eb1dff0c626026"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:51.845289Z","signature_b64":"TeXm3SY97WS4hewldtU1idXR0ltAhD+HOoAbOU/dVpNTFB4vagfSH53tzEx+Y6xyuzO+ZIaz9jz6wHc9BXLJBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e336dd91423a6cda541931486d1ad4c84c9536e765b0473129587dcda4243eb6","last_reissued_at":"2026-05-18T04:31:51.844859Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:51.844859Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Precise Schedulability Analysis for unfeasible to notify separately for comprehensive - EDF Scheduling of interrupted Hard Real-Time Tasks on the similar Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SE","authors_text":"Jagbeer Singh","submitted_at":"2011-01-10T08:31:45Z","abstract_excerpt":"In Real-time system, utilization based schedulability test is a common approach to determine whether or not tasks can be admitted without violating deadline requirements. The exact problem has previously been proven intractable even upon single processors; sufficient conditions are presented here for determining whether a given periodic task system will meet all deadlines if scheduled non-preemptively upon a multiprocessor platform using the earliest-deadline first scheduling algorithm. Many real-time scheduling algorithms have been developed recently to reduce affinity in the portable devices"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1718","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.1718","created_at":"2026-05-18T04:31:51.844922+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1718v1","created_at":"2026-05-18T04:31:51.844922+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1718","created_at":"2026-05-18T04:31:51.844922+00:00"},{"alias_kind":"pith_short_12","alias_value":"4M3N3EKCHJWN","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"4M3N3EKCHJWNUVAZ","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"4M3N3EKC","created_at":"2026-05-18T12:26:20.644004+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/4M3N3EKCHJWNUVAZGFEG2GWUZB","json":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB.json","graph_json":"https://pith.science/api/pith-number/4M3N3EKCHJWNUVAZGFEG2GWUZB/graph.json","events_json":"https://pith.science/api/pith-number/4M3N3EKCHJWNUVAZGFEG2GWUZB/events.json","paper":"https://pith.science/paper/4M3N3EKC"},"agent_actions":{"view_html":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB","download_json":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB.json","view_paper":"https://pith.science/paper/4M3N3EKC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1718&json=true","fetch_graph":"https://pith.science/api/pith-number/4M3N3EKCHJWNUVAZGFEG2GWUZB/graph.json","fetch_events":"https://pith.science/api/pith-number/4M3N3EKCHJWNUVAZGFEG2GWUZB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/action/storage_attestation","attest_author":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/action/author_attestation","sign_citation":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/action/citation_signature","submit_replication":"https://pith.science/pith/4M3N3EKCHJWNUVAZGFEG2GWUZB/action/replication_record"}},"created_at":"2026-05-18T04:31:51.844922+00:00","updated_at":"2026-05-18T04:31:51.844922+00:00"}