{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GD45ZHKHVOBA7UK6KTFM674BDD","short_pith_number":"pith:GD45ZHKH","schema_version":"1.0","canonical_sha256":"30f9dc9d47ab820fd15e54cacf7f8118e3f3a562b246d41a25468a0553b8f627","source":{"kind":"arxiv","id":"1410.1255","version":3},"attestation_state":"computed","paper":{"title":"Multi-resource Fair Allocation with Bounded Number of Tasks in Cloud Computing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.GT","authors_text":"Weidong Li, Xiaolu Zhang, Xi Liu, Xuejie Zhang","submitted_at":"2014-10-06T05:22:56Z","abstract_excerpt":"Dominant resource fairness (DRF) is a popular mechanism for multi-resource allocation in cloud computing systems. In this paper, we consider a problem of multi-resource fair allocation with bounded number of tasks. Firstly, we propose the lexicographically max-min normalized share (LMMNS) fair allocation mechanism, which is a natural generalization of DRF, and design a non-trivial optimal algorithm to find a LMMNS fair allocation, whose running time is linear in the number of users. Secondly, we prove that LMMNS satisfies envy-freeness (EF) and group strategy-proofness (GSP), and analysis the "},"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":"1410.1255","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-10-06T05:22:56Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"4ed241b952dc65e6a129a266ecd6af7011397d978ddc22ecc0bbcdda4844f630","abstract_canon_sha256":"d3502bebee7f812e2b1ba766d2569917e1fc3f026ca15eee42871161cfeb4bb5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:16.215949Z","signature_b64":"/5WqslGUGdgOqwuxpfHjIQjM4L9Kj0i2P5spvHJl2NQ8fmzSoUQ22ss9E1xTvVe3xDEWtJETn6iyG47q3gk2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30f9dc9d47ab820fd15e54cacf7f8118e3f3a562b246d41a25468a0553b8f627","last_reissued_at":"2026-05-18T01:01:16.215380Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:16.215380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-resource Fair Allocation with Bounded Number of Tasks in Cloud Computing Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.GT","authors_text":"Weidong Li, Xiaolu Zhang, Xi Liu, Xuejie Zhang","submitted_at":"2014-10-06T05:22:56Z","abstract_excerpt":"Dominant resource fairness (DRF) is a popular mechanism for multi-resource allocation in cloud computing systems. In this paper, we consider a problem of multi-resource fair allocation with bounded number of tasks. Firstly, we propose the lexicographically max-min normalized share (LMMNS) fair allocation mechanism, which is a natural generalization of DRF, and design a non-trivial optimal algorithm to find a LMMNS fair allocation, whose running time is linear in the number of users. Secondly, we prove that LMMNS satisfies envy-freeness (EF) and group strategy-proofness (GSP), and analysis the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.1255","kind":"arxiv","version":3},"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":"1410.1255","created_at":"2026-05-18T01:01:16.215493+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.1255v3","created_at":"2026-05-18T01:01:16.215493+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.1255","created_at":"2026-05-18T01:01:16.215493+00:00"},{"alias_kind":"pith_short_12","alias_value":"GD45ZHKHVOBA","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GD45ZHKHVOBA7UK6","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GD45ZHKH","created_at":"2026-05-18T12:28:30.664211+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/GD45ZHKHVOBA7UK6KTFM674BDD","json":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD.json","graph_json":"https://pith.science/api/pith-number/GD45ZHKHVOBA7UK6KTFM674BDD/graph.json","events_json":"https://pith.science/api/pith-number/GD45ZHKHVOBA7UK6KTFM674BDD/events.json","paper":"https://pith.science/paper/GD45ZHKH"},"agent_actions":{"view_html":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD","download_json":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD.json","view_paper":"https://pith.science/paper/GD45ZHKH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.1255&json=true","fetch_graph":"https://pith.science/api/pith-number/GD45ZHKHVOBA7UK6KTFM674BDD/graph.json","fetch_events":"https://pith.science/api/pith-number/GD45ZHKHVOBA7UK6KTFM674BDD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/action/storage_attestation","attest_author":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/action/author_attestation","sign_citation":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/action/citation_signature","submit_replication":"https://pith.science/pith/GD45ZHKHVOBA7UK6KTFM674BDD/action/replication_record"}},"created_at":"2026-05-18T01:01:16.215493+00:00","updated_at":"2026-05-18T01:01:16.215493+00:00"}