{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:O5MKIN7RVTESUQDUBYS5AQZXRK","short_pith_number":"pith:O5MKIN7R","canonical_record":{"source":{"id":"1712.05040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2017-12-13T23:14:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"723d9d0bab46a0ab4e45f0d6596def2de0226d78f9b04345bfe8d092564343e2","abstract_canon_sha256":"4b303bf49e5e48e1bee157163532dc034e4b7905437f13c01fa3e15a2aecfbb4"},"schema_version":"1.0"},"canonical_sha256":"7758a437f1acc92a40740e25d043378ab8ef917a20fdaa01c508ed71c77719f7","source":{"kind":"arxiv","id":"1712.05040","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05040","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05040v1","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05040","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"pith_short_12","alias_value":"O5MKIN7RVTES","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5MKIN7RVTESUQDU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5MKIN7R","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:O5MKIN7RVTESUQDUBYS5AQZXRK","target":"record","payload":{"canonical_record":{"source":{"id":"1712.05040","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2017-12-13T23:14:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"723d9d0bab46a0ab4e45f0d6596def2de0226d78f9b04345bfe8d092564343e2","abstract_canon_sha256":"4b303bf49e5e48e1bee157163532dc034e4b7905437f13c01fa3e15a2aecfbb4"},"schema_version":"1.0"},"canonical_sha256":"7758a437f1acc92a40740e25d043378ab8ef917a20fdaa01c508ed71c77719f7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:01.209384Z","signature_b64":"9dCqiUxL6jcOpNS0JiSOqtgoDTwsJgAZuISSl4BKNRncyiADyDyLH61ujq/EuiPcYjFF/0crmXiqLJSl0wykDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7758a437f1acc92a40740e25d043378ab8ef917a20fdaa01c508ed71c77719f7","last_reissued_at":"2026-05-18T00:28:01.208747Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:01.208747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.05040","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YXRvAPj67skMyy80d2Gohrp4kRZg3t61cEEvnrL+fsq0htTTKv/jpssL7/6w5ICDlKXUfdkpWrEG2kVPZM0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:14:42.832357Z"},"content_sha256":"7b058a267dff333b7d176d420429b464788876a6c166b98d89a11b344c996fe3","schema_version":"1.0","event_id":"sha256:7b058a267dff333b7d176d420429b464788876a6c166b98d89a11b344c996fe3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:O5MKIN7RVTESUQDUBYS5AQZXRK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reservation-Based Federated Scheduling for Parallel Real-Time Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.OS","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Jing Li, Kunal Agrawal, Niklas Ueter","submitted_at":"2017-12-13T23:14:28Z","abstract_excerpt":"This paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federated scheduling approach. We propose a reservation-based algorithm, called reservation-based federated scheduling, that dominates federated scheduling. We provide general constraints for the design of such"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05040","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:28:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yFc4hA7d5zaU1GcT3XsrOm654btH5u/ZzchyJfzA80Ef9Ab7BiQ6YbgGB1cC1kFqFZWOPTzhXXV/sFUgH/vsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T11:14:42.833071Z"},"content_sha256":"de80ea4083f70e427737a86d02063e4c5eb74b91b01ce0259a2ac2d722145637","schema_version":"1.0","event_id":"sha256:de80ea4083f70e427737a86d02063e4c5eb74b91b01ce0259a2ac2d722145637"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O5MKIN7RVTESUQDUBYS5AQZXRK/bundle.json","state_url":"https://pith.science/pith/O5MKIN7RVTESUQDUBYS5AQZXRK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O5MKIN7RVTESUQDUBYS5AQZXRK/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-10T11:14:42Z","links":{"resolver":"https://pith.science/pith/O5MKIN7RVTESUQDUBYS5AQZXRK","bundle":"https://pith.science/pith/O5MKIN7RVTESUQDUBYS5AQZXRK/bundle.json","state":"https://pith.science/pith/O5MKIN7RVTESUQDUBYS5AQZXRK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O5MKIN7RVTESUQDUBYS5AQZXRK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:O5MKIN7RVTESUQDUBYS5AQZXRK","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":"4b303bf49e5e48e1bee157163532dc034e4b7905437f13c01fa3e15a2aecfbb4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2017-12-13T23:14:28Z","title_canon_sha256":"723d9d0bab46a0ab4e45f0d6596def2de0226d78f9b04345bfe8d092564343e2"},"schema_version":"1.0","source":{"id":"1712.05040","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05040","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05040v1","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05040","created_at":"2026-05-18T00:28:01Z"},{"alias_kind":"pith_short_12","alias_value":"O5MKIN7RVTES","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"O5MKIN7RVTESUQDU","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"O5MKIN7R","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:de80ea4083f70e427737a86d02063e4c5eb74b91b01ce0259a2ac2d722145637","target":"graph","created_at":"2026-05-18T00:28:01Z","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 paper considers the scheduling of parallel real-time tasks with arbitrary-deadlines. Each job of a parallel task is described as a directed acyclic graph (DAG). In contrast to prior work in this area, where decomposition-based scheduling algorithms are proposed based on the DAG-structure and inter-task interference is analyzed as self-suspending behavior, this paper generalizes the federated scheduling approach. We propose a reservation-based algorithm, called reservation-based federated scheduling, that dominates federated scheduling. We provide general constraints for the design of such","authors_text":"Georg von der Br\\\"uggen, Jian-Jia Chen, Jing Li, Kunal Agrawal, Niklas Ueter","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2017-12-13T23:14:28Z","title":"Reservation-Based Federated Scheduling for Parallel Real-Time Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05040","kind":"arxiv","version":1},"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:7b058a267dff333b7d176d420429b464788876a6c166b98d89a11b344c996fe3","target":"record","created_at":"2026-05-18T00:28:01Z","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":"4b303bf49e5e48e1bee157163532dc034e4b7905437f13c01fa3e15a2aecfbb4","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2017-12-13T23:14:28Z","title_canon_sha256":"723d9d0bab46a0ab4e45f0d6596def2de0226d78f9b04345bfe8d092564343e2"},"schema_version":"1.0","source":{"id":"1712.05040","kind":"arxiv","version":1}},"canonical_sha256":"7758a437f1acc92a40740e25d043378ab8ef917a20fdaa01c508ed71c77719f7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7758a437f1acc92a40740e25d043378ab8ef917a20fdaa01c508ed71c77719f7","first_computed_at":"2026-05-18T00:28:01.208747Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:01.208747Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9dCqiUxL6jcOpNS0JiSOqtgoDTwsJgAZuISSl4BKNRncyiADyDyLH61ujq/EuiPcYjFF/0crmXiqLJSl0wykDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:01.209384Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05040","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b058a267dff333b7d176d420429b464788876a6c166b98d89a11b344c996fe3","sha256:de80ea4083f70e427737a86d02063e4c5eb74b91b01ce0259a2ac2d722145637"],"state_sha256":"c1e298752d5e5d36516959a49a4fa80556178ecfc2b13e197c5275f6f26d8f60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+NKY+g2VoJjybkPL+tMXLWAxWlIsq1w7Ro0T2DLoosphYYTRMvm64puBdbH1U+MGcbhq2i2zPHsTa4g2iHzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T11:14:42.837350Z","bundle_sha256":"639c5aa661b3ada63263c02d986912dfa9eb35ef3732858d2d429e305092fe6b"}}