{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DBH2XNGF7SE2WOAUCKBU6HPX36","short_pith_number":"pith:DBH2XNGF","canonical_record":{"source":{"id":"1302.1747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2013-02-07T13:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"524ae91f4e1d4d82386a739126d9d2ed063f32ec8a605b57d5bca87cb58cd7f5","abstract_canon_sha256":"8d0f63776defd8a8fb36fe07706a4486f2d8ca8775f42829f78030bc52c905f4"},"schema_version":"1.0"},"canonical_sha256":"184fabb4c5fc89ab381412834f1df7dfb7b826b8786b2aa660e551954e25509a","source":{"kind":"arxiv","id":"1302.1747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1747","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1747v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1747","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"DBH2XNGF7SE2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DBH2XNGF7SE2WOAU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DBH2XNGF","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DBH2XNGF7SE2WOAUCKBU6HPX36","target":"record","payload":{"canonical_record":{"source":{"id":"1302.1747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2013-02-07T13:52:09Z","cross_cats_sorted":[],"title_canon_sha256":"524ae91f4e1d4d82386a739126d9d2ed063f32ec8a605b57d5bca87cb58cd7f5","abstract_canon_sha256":"8d0f63776defd8a8fb36fe07706a4486f2d8ca8775f42829f78030bc52c905f4"},"schema_version":"1.0"},"canonical_sha256":"184fabb4c5fc89ab381412834f1df7dfb7b826b8786b2aa660e551954e25509a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:14.734508Z","signature_b64":"PHosWxvMAS0NY0snCDhlbyezhhgNt/rq6PIRCUYvkZ4wPRtvd7n+DFysFlAvAYanokx1HjLnJSEQV+c65R3HBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"184fabb4c5fc89ab381412834f1df7dfb7b826b8786b2aa660e551954e25509a","last_reissued_at":"2026-05-18T03:34:14.733635Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:14.733635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.1747","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-18T03:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfkmfo5EJYnMcNTBoKv9b+GJ8l/Nh78j59nzrkFxxehLAIkkEBnchZkL8ee78upYelIynVYv8kuLooYMxlK8Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:19:18.993857Z"},"content_sha256":"506616e719f39cb22dff967c20756cfddc8970920f92820b83663de4838886cf","schema_version":"1.0","event_id":"sha256:506616e719f39cb22dff967c20756cfddc8970920f92820b83663de4838886cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DBH2XNGF7SE2WOAUCKBU6HPX36","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Energy Minimization for Parallel Real-Time Systems with Malleable Jobs and Homogeneous Frequencies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Antonio Paolillo, Jo\\\"el Goossens, Nathan Fisher, Pradeep M. Hettiarachchi","submitted_at":"2013-02-07T13:52:09Z","abstract_excerpt":"In this work, we investigate the potential utility of parallelization for meeting real-time constraints and minimizing energy. We consider malleable Gang scheduling of implicit-deadline sporadic tasks upon multiprocessors. We first show the non-necessity of dynamic voltage/frequency regarding optimality of our scheduling problem. We adapt the canonical schedule for DVFS multiprocessor platforms and propose a polynomial-time optimal processor/frequency-selection algorithm. We evaluate the performance of our algorithm via simulations using parameters obtained from a hardware testbed implementati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1747","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-18T03:34:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gtmcf9diMTTvEJTsH6HWuxn+219E+KsE+T1JHgbpRGpUBhyg/u1wTfT8+PhvtxqxAEbQQoDpcGiIVrdzd4d5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T10:19:18.994517Z"},"content_sha256":"dc5ddc4109cdbdd84e460a0a43f956ec6bf20117c5286f8cf58e0ac364c13d70","schema_version":"1.0","event_id":"sha256:dc5ddc4109cdbdd84e460a0a43f956ec6bf20117c5286f8cf58e0ac364c13d70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DBH2XNGF7SE2WOAUCKBU6HPX36/bundle.json","state_url":"https://pith.science/pith/DBH2XNGF7SE2WOAUCKBU6HPX36/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DBH2XNGF7SE2WOAUCKBU6HPX36/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-05-31T10:19:18Z","links":{"resolver":"https://pith.science/pith/DBH2XNGF7SE2WOAUCKBU6HPX36","bundle":"https://pith.science/pith/DBH2XNGF7SE2WOAUCKBU6HPX36/bundle.json","state":"https://pith.science/pith/DBH2XNGF7SE2WOAUCKBU6HPX36/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DBH2XNGF7SE2WOAUCKBU6HPX36/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DBH2XNGF7SE2WOAUCKBU6HPX36","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":"8d0f63776defd8a8fb36fe07706a4486f2d8ca8775f42829f78030bc52c905f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2013-02-07T13:52:09Z","title_canon_sha256":"524ae91f4e1d4d82386a739126d9d2ed063f32ec8a605b57d5bca87cb58cd7f5"},"schema_version":"1.0","source":{"id":"1302.1747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.1747","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"arxiv_version","alias_value":"1302.1747v1","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.1747","created_at":"2026-05-18T03:34:14Z"},{"alias_kind":"pith_short_12","alias_value":"DBH2XNGF7SE2","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DBH2XNGF7SE2WOAU","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DBH2XNGF","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:dc5ddc4109cdbdd84e460a0a43f956ec6bf20117c5286f8cf58e0ac364c13d70","target":"graph","created_at":"2026-05-18T03:34:14Z","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":"In this work, we investigate the potential utility of parallelization for meeting real-time constraints and minimizing energy. We consider malleable Gang scheduling of implicit-deadline sporadic tasks upon multiprocessors. We first show the non-necessity of dynamic voltage/frequency regarding optimality of our scheduling problem. We adapt the canonical schedule for DVFS multiprocessor platforms and propose a polynomial-time optimal processor/frequency-selection algorithm. We evaluate the performance of our algorithm via simulations using parameters obtained from a hardware testbed implementati","authors_text":"Antonio Paolillo, Jo\\\"el Goossens, Nathan Fisher, Pradeep M. Hettiarachchi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2013-02-07T13:52:09Z","title":"Energy Minimization for Parallel Real-Time Systems with Malleable Jobs and Homogeneous Frequencies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.1747","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:506616e719f39cb22dff967c20756cfddc8970920f92820b83663de4838886cf","target":"record","created_at":"2026-05-18T03:34:14Z","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":"8d0f63776defd8a8fb36fe07706a4486f2d8ca8775f42829f78030bc52c905f4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2013-02-07T13:52:09Z","title_canon_sha256":"524ae91f4e1d4d82386a739126d9d2ed063f32ec8a605b57d5bca87cb58cd7f5"},"schema_version":"1.0","source":{"id":"1302.1747","kind":"arxiv","version":1}},"canonical_sha256":"184fabb4c5fc89ab381412834f1df7dfb7b826b8786b2aa660e551954e25509a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"184fabb4c5fc89ab381412834f1df7dfb7b826b8786b2aa660e551954e25509a","first_computed_at":"2026-05-18T03:34:14.733635Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:14.733635Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PHosWxvMAS0NY0snCDhlbyezhhgNt/rq6PIRCUYvkZ4wPRtvd7n+DFysFlAvAYanokx1HjLnJSEQV+c65R3HBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:14.734508Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.1747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:506616e719f39cb22dff967c20756cfddc8970920f92820b83663de4838886cf","sha256:dc5ddc4109cdbdd84e460a0a43f956ec6bf20117c5286f8cf58e0ac364c13d70"],"state_sha256":"463a9c2a0df16d37020b7d406182c2fc25e04b1b493923b22a7ccc086a622e03"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YZ0O3EsonNIae8AbXLuYuDFCTznNKmVD/IWkPOr9/44JHoOkYZVhCxdHCCjIfPml5/k+YLmi1uZLxASEi4l1DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T10:19:18.997856Z","bundle_sha256":"072e26de26391944885850af22aef05d2b2429bcfd823806665835c2341127c5"}}