{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:4V5TT6NBPGGEZFFIUPHTEXUYPQ","short_pith_number":"pith:4V5TT6NB","schema_version":"1.0","canonical_sha256":"e57b39f9a1798c4c94a8a3cf325e987c024e90a28926648742e51c450a346056","source":{"kind":"arxiv","id":"1607.07763","version":1},"attestation_state":"computed","paper":{"title":"Energy-Efficient Real-Time Scheduling for Two-Type Heterogeneous Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS","cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Eric C. Kerrigan, Mason Thammawichai","submitted_at":"2016-07-15T14:52:57Z","abstract_excerpt":"We propose three novel mathematical optimization formulations that solve the same two-type heterogeneous multiprocessor scheduling problem for a real-time taskset with hard constraints. Our formulations are based on a global scheduling scheme and a fluid model. The first formulation is a mixed-integer nonlinear program, since the scheduling problem is intuitively considered as an assignment problem. However, by changing the scheduling problem to first determine a task workload partition and then to find the execution order of all tasks, the computation time can be significantly reduced. Specif"},"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":"1607.07763","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-07-15T14:52:57Z","cross_cats_sorted":["cs.OS","cs.SY","math.OC"],"title_canon_sha256":"584d9f08c4187040e974500bd467ee2bf8018c41ebcf20ffe7b14d1eb2a2bbde","abstract_canon_sha256":"e66ddbfb635d13ec25f49085e9e5d4ca6dae3ad124d4a01dc397b66f75c61db1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:02.396377Z","signature_b64":"/Zw72+ffmv5dyNefopH90Zgx/CpTqa7MXb8+NxAU/ioIb2dDnANB7dw+tJiv66VSzL9gyycS7CLpGIrjrYSzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57b39f9a1798c4c94a8a3cf325e987c024e90a28926648742e51c450a346056","last_reissued_at":"2026-05-18T00:33:02.395887Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:02.395887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Energy-Efficient Real-Time Scheduling for Two-Type Heterogeneous Multiprocessors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.OS","cs.SY","math.OC"],"primary_cat":"cs.DC","authors_text":"Eric C. Kerrigan, Mason Thammawichai","submitted_at":"2016-07-15T14:52:57Z","abstract_excerpt":"We propose three novel mathematical optimization formulations that solve the same two-type heterogeneous multiprocessor scheduling problem for a real-time taskset with hard constraints. Our formulations are based on a global scheduling scheme and a fluid model. The first formulation is a mixed-integer nonlinear program, since the scheduling problem is intuitively considered as an assignment problem. However, by changing the scheduling problem to first determine a task workload partition and then to find the execution order of all tasks, the computation time can be significantly reduced. Specif"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07763","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":"1607.07763","created_at":"2026-05-18T00:33:02.395963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07763v1","created_at":"2026-05-18T00:33:02.395963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07763","created_at":"2026-05-18T00:33:02.395963+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V5TT6NBPGGE","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V5TT6NBPGGEZFFI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V5TT6NB","created_at":"2026-05-18T12:29:58.707656+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/4V5TT6NBPGGEZFFIUPHTEXUYPQ","json":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ.json","graph_json":"https://pith.science/api/pith-number/4V5TT6NBPGGEZFFIUPHTEXUYPQ/graph.json","events_json":"https://pith.science/api/pith-number/4V5TT6NBPGGEZFFIUPHTEXUYPQ/events.json","paper":"https://pith.science/paper/4V5TT6NB"},"agent_actions":{"view_html":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ","download_json":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ.json","view_paper":"https://pith.science/paper/4V5TT6NB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07763&json=true","fetch_graph":"https://pith.science/api/pith-number/4V5TT6NBPGGEZFFIUPHTEXUYPQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4V5TT6NBPGGEZFFIUPHTEXUYPQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/action/storage_attestation","attest_author":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/action/author_attestation","sign_citation":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/action/citation_signature","submit_replication":"https://pith.science/pith/4V5TT6NBPGGEZFFIUPHTEXUYPQ/action/replication_record"}},"created_at":"2026-05-18T00:33:02.395963+00:00","updated_at":"2026-05-18T00:33:02.395963+00:00"}