{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:3PIRYHAB7YOLDMTMXVLLPPTMT3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fa69e13d43a657381ef75b36eb5d1f875207a5ad670377c02716cab6af9fdaa8","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-25T08:09:27Z","title_canon_sha256":"65db335bbfbaa5c3f223852abd41332db6d757ca27c7a8cd73f54e76297e1e71"},"schema_version":"1.0","source":{"id":"1001.4115","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.4115","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"arxiv_version","alias_value":"1001.4115v3","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.4115","created_at":"2026-05-18T04:31:11Z"},{"alias_kind":"pith_short_12","alias_value":"3PIRYHAB7YOL","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"3PIRYHAB7YOLDMTM","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"3PIRYHAB","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:94c94dba793a980d2e15f3727486db9c59be4dda2dc9b3f25e3a3ad5bdcabd9b","target":"graph","created_at":"2026-05-18T04:31:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"This research addresses the multiprocessor scheduling problem of hard real-time systems, and it especially focuses on optimal and global schedulers when practical constraints are taken into account. First, we propose an improvement of the optimal algorithm BF. We formally prove that our adaptation is (i) optimal, i.e., it always generates a feasible schedule as long as such a schedule exists, and (ii) valid, i.e., it complies with the all the requirements. We also show that it outperforms BF by providing a computing complexity of O(n), where n is the number of tasks to be scheduled. Next, we p","authors_text":"Dragomir Milojevic, Geoffrey Nelissen, Joel Goossens, Shelby Funk, Vincent Nelis","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-25T08:09:27Z","title":"On the Design of an Optimal Multiprocessor Real-Time Scheduling Algorithm under Practical Considerations (Extended Version)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.4115","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e3259b6bec4a7cee9d3f0ccc09ccbd50c20d5bd13991b755c3290cf2c5ed3dff","target":"record","created_at":"2026-05-18T04:31:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fa69e13d43a657381ef75b36eb5d1f875207a5ad670377c02716cab6af9fdaa8","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2010-01-25T08:09:27Z","title_canon_sha256":"65db335bbfbaa5c3f223852abd41332db6d757ca27c7a8cd73f54e76297e1e71"},"schema_version":"1.0","source":{"id":"1001.4115","kind":"arxiv","version":3}},"canonical_sha256":"dbd11c1c01fe1cb1b26cbd56b7be6c9ecf02a8c74d4232177faaccfd12cf2f14","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dbd11c1c01fe1cb1b26cbd56b7be6c9ecf02a8c74d4232177faaccfd12cf2f14","first_computed_at":"2026-05-18T04:31:11.913740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:11.913740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7f7SI/RJysLTTjIaIUR0qPxGmp587xSNmuKi6jBSrVQKWs9zorXv46/9taEV7z88aOnKcjVupyrkHTpUnLz2DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:11.914182Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.4115","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3259b6bec4a7cee9d3f0ccc09ccbd50c20d5bd13991b755c3290cf2c5ed3dff","sha256:94c94dba793a980d2e15f3727486db9c59be4dda2dc9b3f25e3a3ad5bdcabd9b"],"state_sha256":"73facff1a7b475ba9c1e60388e2dcf9d4e3353ee07fa940096e5626a48d1b7f4"}