{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:INYB3QY4T7OMJTRR7QKC3PDUDK","short_pith_number":"pith:INYB3QY4","schema_version":"1.0","canonical_sha256":"43701dc31c9fdcc4ce31fc142dbc741aa75e349384f6ab87ccac3f40f21a99f6","source":{"kind":"arxiv","id":"1501.04343","version":8},"attestation_state":"computed","paper":{"title":"Algorithms for Scheduling Malleable Cloud Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Patrick Loiseau, Xiaohu Wu","submitted_at":"2015-01-18T20:18:15Z","abstract_excerpt":"Due to the ubiquity of batch data processing in cloud computing, the related problem of scheduling malleable batch tasks and its extensions have received significant attention recently. In this paper, we consider a fundamental model where a set of n tasks is to be processed on C identical machines and each task is specified by a value, a workload, a deadline and a parallelism bound. Within the parallelism bound, the number of machines assigned to a task can vary over time without affecting its workload. For this model, we obtain two core results: a sufficient and necessary condition such that "},"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":"1501.04343","kind":"arxiv","version":8},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-01-18T20:18:15Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5712a2e1c07ad4820e7fe2b10306e463dad6e52a3d1a51648c1fc8f510102567","abstract_canon_sha256":"aacded8ed8abd7991e3357dbfee1d28e664cbe6b75db3cd87232db8862cb0ac0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:32.095572Z","signature_b64":"qKbSP7pIEqMjfLDeK7kE1zYvgIbZ5CT91llI7/rLtUARrCdOjSu9KzqTCOeUmkbOCrwY6JPj9TrTuutWh3qnAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43701dc31c9fdcc4ce31fc142dbc741aa75e349384f6ab87ccac3f40f21a99f6","last_reissued_at":"2026-05-18T00:24:32.095178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:32.095178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithms for Scheduling Malleable Cloud Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Patrick Loiseau, Xiaohu Wu","submitted_at":"2015-01-18T20:18:15Z","abstract_excerpt":"Due to the ubiquity of batch data processing in cloud computing, the related problem of scheduling malleable batch tasks and its extensions have received significant attention recently. In this paper, we consider a fundamental model where a set of n tasks is to be processed on C identical machines and each task is specified by a value, a workload, a deadline and a parallelism bound. Within the parallelism bound, the number of machines assigned to a task can vary over time without affecting its workload. For this model, we obtain two core results: a sufficient and necessary condition such that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04343","kind":"arxiv","version":8},"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":"1501.04343","created_at":"2026-05-18T00:24:32.095238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04343v8","created_at":"2026-05-18T00:24:32.095238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04343","created_at":"2026-05-18T00:24:32.095238+00:00"},{"alias_kind":"pith_short_12","alias_value":"INYB3QY4T7OM","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"INYB3QY4T7OMJTRR","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"INYB3QY4","created_at":"2026-05-18T12:29:25.134429+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/INYB3QY4T7OMJTRR7QKC3PDUDK","json":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK.json","graph_json":"https://pith.science/api/pith-number/INYB3QY4T7OMJTRR7QKC3PDUDK/graph.json","events_json":"https://pith.science/api/pith-number/INYB3QY4T7OMJTRR7QKC3PDUDK/events.json","paper":"https://pith.science/paper/INYB3QY4"},"agent_actions":{"view_html":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK","download_json":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK.json","view_paper":"https://pith.science/paper/INYB3QY4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04343&json=true","fetch_graph":"https://pith.science/api/pith-number/INYB3QY4T7OMJTRR7QKC3PDUDK/graph.json","fetch_events":"https://pith.science/api/pith-number/INYB3QY4T7OMJTRR7QKC3PDUDK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK/action/storage_attestation","attest_author":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK/action/author_attestation","sign_citation":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK/action/citation_signature","submit_replication":"https://pith.science/pith/INYB3QY4T7OMJTRR7QKC3PDUDK/action/replication_record"}},"created_at":"2026-05-18T00:24:32.095238+00:00","updated_at":"2026-05-18T00:24:32.095238+00:00"}