{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KDHRA5SCRRWLZSHWIYHGAPXV3V","short_pith_number":"pith:KDHRA5SC","schema_version":"1.0","canonical_sha256":"50cf1076428c6cbcc8f6460e603ef5dd5bf3f59f0c840ece37b7878301b0a72b","source":{"kind":"arxiv","id":"1502.05786","version":1},"attestation_state":"computed","paper":{"title":"Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SY","math.PR","stat.AP"],"primary_cat":"cs.DC","authors_text":"A. Karthik, Arpan Mukhopadhyay, Ravi R. Mazumdar","submitted_at":"2015-02-20T06:51:01Z","abstract_excerpt":"We consider the job assignment problem in a multi-server system consisting of $N$ parallel processor sharing servers, categorized into $M$ ($\\ll N$) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate $N \\lambda$. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is then assigned to one of the sampled servers based on a selection rule. We propose two schemes, each corresponding to a specific selection rule that aims at reducing the mean sojourn time "},"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":"1502.05786","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-02-20T06:51:01Z","cross_cats_sorted":["cs.PF","cs.SY","math.PR","stat.AP"],"title_canon_sha256":"6e215f4629b970e06384f828e35a9f84709e9280b3acb96fff2f445a9e520b97","abstract_canon_sha256":"6804046eaa6ccfe74dab2cf885211f15d68df8469c5f613ca2e127156c902b3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:44.794148Z","signature_b64":"viyFnBbykQUTprhRntJDvYbtLjUPzo/ciIDZ3mItiDZ2fN+Wir7uSUEoN4ZPc8PmK+fli8rjwYdQ+R+7Q5FBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50cf1076428c6cbcc8f6460e603ef5dd5bf3f59f0c840ece37b7878301b0a72b","last_reissued_at":"2026-05-18T02:26:44.793683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:44.793683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PF","cs.SY","math.PR","stat.AP"],"primary_cat":"cs.DC","authors_text":"A. Karthik, Arpan Mukhopadhyay, Ravi R. Mazumdar","submitted_at":"2015-02-20T06:51:01Z","abstract_excerpt":"We consider the job assignment problem in a multi-server system consisting of $N$ parallel processor sharing servers, categorized into $M$ ($\\ll N$) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate $N \\lambda$. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is then assigned to one of the sampled servers based on a selection rule. We propose two schemes, each corresponding to a specific selection rule that aims at reducing the mean sojourn time "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05786","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":"1502.05786","created_at":"2026-05-18T02:26:44.793755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05786v1","created_at":"2026-05-18T02:26:44.793755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05786","created_at":"2026-05-18T02:26:44.793755+00:00"},{"alias_kind":"pith_short_12","alias_value":"KDHRA5SCRRWL","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KDHRA5SCRRWLZSHW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KDHRA5SC","created_at":"2026-05-18T12:29:27.538025+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/KDHRA5SCRRWLZSHWIYHGAPXV3V","json":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V.json","graph_json":"https://pith.science/api/pith-number/KDHRA5SCRRWLZSHWIYHGAPXV3V/graph.json","events_json":"https://pith.science/api/pith-number/KDHRA5SCRRWLZSHWIYHGAPXV3V/events.json","paper":"https://pith.science/paper/KDHRA5SC"},"agent_actions":{"view_html":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V","download_json":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V.json","view_paper":"https://pith.science/paper/KDHRA5SC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05786&json=true","fetch_graph":"https://pith.science/api/pith-number/KDHRA5SCRRWLZSHWIYHGAPXV3V/graph.json","fetch_events":"https://pith.science/api/pith-number/KDHRA5SCRRWLZSHWIYHGAPXV3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/action/storage_attestation","attest_author":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/action/author_attestation","sign_citation":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/action/citation_signature","submit_replication":"https://pith.science/pith/KDHRA5SCRRWLZSHWIYHGAPXV3V/action/replication_record"}},"created_at":"2026-05-18T02:26:44.793755+00:00","updated_at":"2026-05-18T02:26:44.793755+00:00"}