{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:B5HEPDTYFA42CY524LZZRCPM3G","short_pith_number":"pith:B5HEPDTY","schema_version":"1.0","canonical_sha256":"0f4e478e782839a163bae2f39889ecd9b46f40310229902b138f768a8aac5f94","source":{"kind":"arxiv","id":"1505.04693","version":3},"attestation_state":"computed","paper":{"title":"Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jian-Jia Chen","submitted_at":"2015-05-18T15:54:58Z","abstract_excerpt":"Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor scheduling for sporadic real-time systems, in which deadline-monotonic scheduling is applied on each processor. Prior to this paper, the best known results are by Fisher, Baruah, and Baker with speedup factors $4-\\frac{2}{M}$ and $3-\\frac{1}{M}$ for arbitrary-deadline and constrained-deadline sporadic real-time task systems, respectively, where $M$ is the num"},"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":"1505.04693","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-18T15:54:58Z","cross_cats_sorted":[],"title_canon_sha256":"547ca1d024d0352b4faf96747fc5ff8e6794f70016722606b198f67b8c0bc85b","abstract_canon_sha256":"219f4a973c88b4b3db504e5c79d988f29574f63d8bae95c3b5731d65de80f69d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:01.836102Z","signature_b64":"ML2ezSJLxg08J8rTYmOWJci07vS85ufmf9cGBGmqWSOv9RcZLgW97ibA25x81ALpNelvg5k6A/h4NzTsgcOoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f4e478e782839a163bae2f39889ecd9b46f40310229902b138f768a8aac5f94","last_reissued_at":"2026-05-18T01:12:01.835756Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:01.835756Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partitioned Multiprocessor Fixed-Priority Scheduling of Sporadic Real-Time Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jian-Jia Chen","submitted_at":"2015-05-18T15:54:58Z","abstract_excerpt":"Partitioned multiprocessor scheduling has been widely accepted in academia and industry to statically assign and partition real-time tasks onto identical multiprocessor systems. This paper studies fixed-priority partitioned multiprocessor scheduling for sporadic real-time systems, in which deadline-monotonic scheduling is applied on each processor. Prior to this paper, the best known results are by Fisher, Baruah, and Baker with speedup factors $4-\\frac{2}{M}$ and $3-\\frac{1}{M}$ for arbitrary-deadline and constrained-deadline sporadic real-time task systems, respectively, where $M$ is the num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04693","kind":"arxiv","version":3},"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":"1505.04693","created_at":"2026-05-18T01:12:01.835811+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04693v3","created_at":"2026-05-18T01:12:01.835811+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04693","created_at":"2026-05-18T01:12:01.835811+00:00"},{"alias_kind":"pith_short_12","alias_value":"B5HEPDTYFA42","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"B5HEPDTYFA42CY52","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"B5HEPDTY","created_at":"2026-05-18T12:29:14.074870+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/B5HEPDTYFA42CY524LZZRCPM3G","json":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G.json","graph_json":"https://pith.science/api/pith-number/B5HEPDTYFA42CY524LZZRCPM3G/graph.json","events_json":"https://pith.science/api/pith-number/B5HEPDTYFA42CY524LZZRCPM3G/events.json","paper":"https://pith.science/paper/B5HEPDTY"},"agent_actions":{"view_html":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G","download_json":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G.json","view_paper":"https://pith.science/paper/B5HEPDTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04693&json=true","fetch_graph":"https://pith.science/api/pith-number/B5HEPDTYFA42CY524LZZRCPM3G/graph.json","fetch_events":"https://pith.science/api/pith-number/B5HEPDTYFA42CY524LZZRCPM3G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/action/storage_attestation","attest_author":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/action/author_attestation","sign_citation":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/action/citation_signature","submit_replication":"https://pith.science/pith/B5HEPDTYFA42CY524LZZRCPM3G/action/replication_record"}},"created_at":"2026-05-18T01:12:01.835811+00:00","updated_at":"2026-05-18T01:12:01.835811+00:00"}