{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:TUSOJTNDJ2YN4GO5LHZXOR7ZBN","short_pith_number":"pith:TUSOJTND","schema_version":"1.0","canonical_sha256":"9d24e4cda34eb0de19dd59f37747f90b673287131799ac94752ee265854502b8","source":{"kind":"arxiv","id":"1101.0056","version":1},"attestation_state":"computed","paper":{"title":"An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jagbeer Singh","submitted_at":"2010-12-30T08:50:49Z","abstract_excerpt":"In this paper I have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms for Earliest Deadline First (EDF) are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared with the performance of known partitioning schemes. I have applied some modification to the global Earliest Deadline First (EDF) algorithms to decrease the number of task migration and also to add pr"},"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.0056","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DS","submitted_at":"2010-12-30T08:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"bc4a23514bae90f141f895660c0a42a1f7ef6e6851968503b5990434510e65ef","abstract_canon_sha256":"e58a675ac77e0b3acff195706661e14db559fb49baf9a2589ba93f6d1f3b30d9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:11.127372Z","signature_b64":"4n79DX0P5JYk0jrztgGOD0Mo0pl/ElTz+cSAaAiqUV0NWDqCjzxlStV6+zcT/jdEAv1QryGvyNGh60PMr6OnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d24e4cda34eb0de19dd59f37747f90b673287131799ac94752ee265854502b8","last_reissued_at":"2026-05-18T04:32:11.126703Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:11.126703Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-Time System","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jagbeer Singh","submitted_at":"2010-12-30T08:50:49Z","abstract_excerpt":"In this paper I have study to Reduce the time Complexity of Earliest Deadline First (EDF), a global scheduling scheme for Earliest Deadline First in Real Time System tasks on a Multiprocessors system. Several admission control algorithms for Earliest Deadline First (EDF) are presented, both for hard and soft real-time tasks. The average performance of these admission control algorithms is compared with the performance of known partitioning schemes. I have applied some modification to the global Earliest Deadline First (EDF) algorithms to decrease the number of task migration and also to add pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.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":"1101.0056","created_at":"2026-05-18T04:32:11.126781+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.0056v1","created_at":"2026-05-18T04:32:11.126781+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.0056","created_at":"2026-05-18T04:32:11.126781+00:00"},{"alias_kind":"pith_short_12","alias_value":"TUSOJTNDJ2YN","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"TUSOJTNDJ2YN4GO5","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"TUSOJTND","created_at":"2026-05-18T12:26:15.391820+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/TUSOJTNDJ2YN4GO5LHZXOR7ZBN","json":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN.json","graph_json":"https://pith.science/api/pith-number/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/graph.json","events_json":"https://pith.science/api/pith-number/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/events.json","paper":"https://pith.science/paper/TUSOJTND"},"agent_actions":{"view_html":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN","download_json":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN.json","view_paper":"https://pith.science/paper/TUSOJTND","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.0056&json=true","fetch_graph":"https://pith.science/api/pith-number/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/graph.json","fetch_events":"https://pith.science/api/pith-number/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/action/storage_attestation","attest_author":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/action/author_attestation","sign_citation":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/action/citation_signature","submit_replication":"https://pith.science/pith/TUSOJTNDJ2YN4GO5LHZXOR7ZBN/action/replication_record"}},"created_at":"2026-05-18T04:32:11.126781+00:00","updated_at":"2026-05-18T04:32:11.126781+00:00"}