{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:DTGMBRZOE5I65F2YBECPYPHQH7","short_pith_number":"pith:DTGMBRZO","schema_version":"1.0","canonical_sha256":"1cccc0c72e2751ee97580904fc3cf03fed2c498ccac535cae543f64bb1433219","source":{"kind":"arxiv","id":"1107.2105","version":2},"attestation_state":"computed","paper":{"title":"Speed Scaling on Parallel Processors with Migration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitrios Letsios, Eric Angel, Evripidis Bampis, Fadi Kacem","submitted_at":"2011-07-11T19:56:53Z","abstract_excerpt":"We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. An exact polynomial-time algorithm has been proposed for this problem, which is based on the Ellipsoid algorithm. Here, we formulate the problem as a convex program and we propose a simpler polynomial-time combinatorial algorithm which is based on a reduction to the maximum flow problem. Our algorithm runs in $O(nf(n)logP)$ tim"},"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":"1107.2105","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-07-11T19:56:53Z","cross_cats_sorted":[],"title_canon_sha256":"884d53643fc1c8757f7a4c35570f73a15cde2196fed015ff3fa2d50f762ac94a","abstract_canon_sha256":"2b04d4cff982ac0c76b2d740a65c500251a1db4fce17e58ac106f45340b506cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:32.887844Z","signature_b64":"bdkOaXneCL1BcQLU4uWCXWwc8Up2dGOOHlEAUmsqhAqUXDOkpZ6D7S8oeT1PykFbw5WoKU/XDAYJybFz0B/OAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cccc0c72e2751ee97580904fc3cf03fed2c498ccac535cae543f64bb1433219","last_reissued_at":"2026-05-18T04:18:32.887123Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:32.887123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Speed Scaling on Parallel Processors with Migration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dimitrios Letsios, Eric Angel, Evripidis Bampis, Fadi Kacem","submitted_at":"2011-07-11T19:56:53Z","abstract_excerpt":"We study the problem of scheduling a set of jobs with release dates, deadlines and processing requirements (or works), on parallel speed-scaled processors so as to minimize the total energy consumption. We consider that both preemption and migration of jobs are allowed. An exact polynomial-time algorithm has been proposed for this problem, which is based on the Ellipsoid algorithm. Here, we formulate the problem as a convex program and we propose a simpler polynomial-time combinatorial algorithm which is based on a reduction to the maximum flow problem. Our algorithm runs in $O(nf(n)logP)$ tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2105","kind":"arxiv","version":2},"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":"1107.2105","created_at":"2026-05-18T04:18:32.887232+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.2105v2","created_at":"2026-05-18T04:18:32.887232+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2105","created_at":"2026-05-18T04:18:32.887232+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTGMBRZOE5I6","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTGMBRZOE5I65F2Y","created_at":"2026-05-18T12:26:26.731475+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTGMBRZO","created_at":"2026-05-18T12:26:26.731475+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/DTGMBRZOE5I65F2YBECPYPHQH7","json":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7.json","graph_json":"https://pith.science/api/pith-number/DTGMBRZOE5I65F2YBECPYPHQH7/graph.json","events_json":"https://pith.science/api/pith-number/DTGMBRZOE5I65F2YBECPYPHQH7/events.json","paper":"https://pith.science/paper/DTGMBRZO"},"agent_actions":{"view_html":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7","download_json":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7.json","view_paper":"https://pith.science/paper/DTGMBRZO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.2105&json=true","fetch_graph":"https://pith.science/api/pith-number/DTGMBRZOE5I65F2YBECPYPHQH7/graph.json","fetch_events":"https://pith.science/api/pith-number/DTGMBRZOE5I65F2YBECPYPHQH7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/action/storage_attestation","attest_author":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/action/author_attestation","sign_citation":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/action/citation_signature","submit_replication":"https://pith.science/pith/DTGMBRZOE5I65F2YBECPYPHQH7/action/replication_record"}},"created_at":"2026-05-18T04:18:32.887232+00:00","updated_at":"2026-05-18T04:18:32.887232+00:00"}