{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:H45PSGJMINVDVLNOP326LEURYM","short_pith_number":"pith:H45PSGJM","schema_version":"1.0","canonical_sha256":"3f3af9192c436a3aadae7ef5e59291c300452034fddf9ce7d47535b7ec5d2526","source":{"kind":"arxiv","id":"1206.1264","version":1},"attestation_state":"computed","paper":{"title":"Heavy Traffic Optimal Resource Allocation Algorithms for Cloud Computing Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Lei Ying, R Srikant, Siva Theja Maguluri","submitted_at":"2012-06-06T16:07:58Z","abstract_excerpt":"Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. We consider a model where the resource allocation problem can be separated into a routing or load balancing problem and a scheduling problem. We study the join-the-shortest-queue routing and power-of-two-choices routing algorithms with MaxWeight scheduling algorithm. It was known that these algorithms are throughpu"},"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":"1206.1264","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-06-06T16:07:58Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"337bdd4e3861b9eead749424468e39ca4f0aad768858fb28f280c515901c25cb","abstract_canon_sha256":"e1e19e7604e1610877910bb93856c8cd8c07d67a291842c1588fdaf6e6f5ef57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:54:06.548072Z","signature_b64":"2Qevb7Mt5nygCHRNqKsl2S3Ho22aNQdEcYqkGbqjrJ+13BHbrRkENlCve64fxfcAAQnWzUu+ZGPcJjYqNFDzBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f3af9192c436a3aadae7ef5e59291c300452034fddf9ce7d47535b7ec5d2526","last_reissued_at":"2026-05-18T03:54:06.547414Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:54:06.547414Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Heavy Traffic Optimal Resource Allocation Algorithms for Cloud Computing Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Lei Ying, R Srikant, Siva Theja Maguluri","submitted_at":"2012-06-06T16:07:58Z","abstract_excerpt":"Cloud computing is emerging as an important platform for business, personal and mobile computing applications. In this paper, we study a stochastic model of cloud computing, where jobs arrive according to a stochastic process and request resources like CPU, memory and storage space. We consider a model where the resource allocation problem can be separated into a routing or load balancing problem and a scheduling problem. We study the join-the-shortest-queue routing and power-of-two-choices routing algorithms with MaxWeight scheduling algorithm. It was known that these algorithms are throughpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1264","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":"1206.1264","created_at":"2026-05-18T03:54:06.547507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1264v1","created_at":"2026-05-18T03:54:06.547507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1264","created_at":"2026-05-18T03:54:06.547507+00:00"},{"alias_kind":"pith_short_12","alias_value":"H45PSGJMINVD","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"H45PSGJMINVDVLNO","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"H45PSGJM","created_at":"2026-05-18T12:27:06.952714+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/H45PSGJMINVDVLNOP326LEURYM","json":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM.json","graph_json":"https://pith.science/api/pith-number/H45PSGJMINVDVLNOP326LEURYM/graph.json","events_json":"https://pith.science/api/pith-number/H45PSGJMINVDVLNOP326LEURYM/events.json","paper":"https://pith.science/paper/H45PSGJM"},"agent_actions":{"view_html":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM","download_json":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM.json","view_paper":"https://pith.science/paper/H45PSGJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1264&json=true","fetch_graph":"https://pith.science/api/pith-number/H45PSGJMINVDVLNOP326LEURYM/graph.json","fetch_events":"https://pith.science/api/pith-number/H45PSGJMINVDVLNOP326LEURYM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/action/storage_attestation","attest_author":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/action/author_attestation","sign_citation":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/action/citation_signature","submit_replication":"https://pith.science/pith/H45PSGJMINVDVLNOP326LEURYM/action/replication_record"}},"created_at":"2026-05-18T03:54:06.547507+00:00","updated_at":"2026-05-18T03:54:06.547507+00:00"}