{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4DVOX6CJHD33EYSVCPI27UMA4L","short_pith_number":"pith:4DVOX6CJ","schema_version":"1.0","canonical_sha256":"e0eaebf84938f7b2625513d1afd180e2f994f33a4504968e88bde136345a20da","source":{"kind":"arxiv","id":"1807.08579","version":1},"attestation_state":"computed","paper":{"title":"An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Liang Zhao, Xingwu Liu, Xin Han, Zhishan Guo","submitted_at":"2018-07-20T07:46:32Z","abstract_excerpt":"Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for deciding schedulability on multiprocess platforms, the speedup factor of partitioned-EDF is challenging to analyze and is far from been determined. Partitioned-EDF was first proposed in 2005 by Barush and Fisher [1], and was shown to have a speedup factor at most 3-1/m, meaning that if the input of sporadic tasks is feasible on m processors with speed one, partitioned-EDF will always return succeeded on m processors with s"},"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":"1807.08579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-07-20T07:46:32Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"5083ef39d6673b79fe46b690cb20a2efcf2cf15345a4f15c189f7113ae86772d","abstract_canon_sha256":"005e3bcd044f647db2b561df903c9cc7d7a3058688d2219cfa2c2a9a0df4fc45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:05.489915Z","signature_b64":"LrtZZJSRrSqHldJzT7/iXXZbx+ESEpEjUTPMkCFzOksNHxZn3GJf+Xa8IC1bmLyLf260bH3mi47Hrb+iyk2PCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0eaebf84938f7b2625513d1afd180e2f994f33a4504968e88bde136345a20da","last_reissued_at":"2026-05-18T00:10:05.489278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:05.489278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Speedup Factor for Sporadic Tasks with Constrained Deadlines under Dynamic Priority Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Liang Zhao, Xingwu Liu, Xin Han, Zhishan Guo","submitted_at":"2018-07-20T07:46:32Z","abstract_excerpt":"Schedulability is a fundamental problem in real-time scheduling, but it has to be approximated due to the intrinsic computational hardness. As the most popular algorithm for deciding schedulability on multiprocess platforms, the speedup factor of partitioned-EDF is challenging to analyze and is far from been determined. Partitioned-EDF was first proposed in 2005 by Barush and Fisher [1], and was shown to have a speedup factor at most 3-1/m, meaning that if the input of sporadic tasks is feasible on m processors with speed one, partitioned-EDF will always return succeeded on m processors with s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08579","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":"1807.08579","created_at":"2026-05-18T00:10:05.489377+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08579v1","created_at":"2026-05-18T00:10:05.489377+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08579","created_at":"2026-05-18T00:10:05.489377+00:00"},{"alias_kind":"pith_short_12","alias_value":"4DVOX6CJHD33","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4DVOX6CJHD33EYSV","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4DVOX6CJ","created_at":"2026-05-18T12:32:05.422762+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/4DVOX6CJHD33EYSVCPI27UMA4L","json":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L.json","graph_json":"https://pith.science/api/pith-number/4DVOX6CJHD33EYSVCPI27UMA4L/graph.json","events_json":"https://pith.science/api/pith-number/4DVOX6CJHD33EYSVCPI27UMA4L/events.json","paper":"https://pith.science/paper/4DVOX6CJ"},"agent_actions":{"view_html":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L","download_json":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L.json","view_paper":"https://pith.science/paper/4DVOX6CJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08579&json=true","fetch_graph":"https://pith.science/api/pith-number/4DVOX6CJHD33EYSVCPI27UMA4L/graph.json","fetch_events":"https://pith.science/api/pith-number/4DVOX6CJHD33EYSVCPI27UMA4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/action/storage_attestation","attest_author":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/action/author_attestation","sign_citation":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/action/citation_signature","submit_replication":"https://pith.science/pith/4DVOX6CJHD33EYSVCPI27UMA4L/action/replication_record"}},"created_at":"2026-05-18T00:10:05.489377+00:00","updated_at":"2026-05-18T00:10:05.489377+00:00"}