{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:37LCRXCYS3Q3W3PEQGLE6OEZQE","short_pith_number":"pith:37LCRXCY","schema_version":"1.0","canonical_sha256":"dfd628dc5896e1bb6de481964f38998123c573b1c2b13abd7968611726e327a0","source":{"kind":"arxiv","id":"1709.08115","version":1},"attestation_state":"computed","paper":{"title":"GB-PANDAS: Throughput and heavy-traffic optimality analysis for affinity scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Ali Yekkehkhany, Avesta Hojjati, Mohammad H Hajiesmaili","submitted_at":"2017-09-23T20:38:25Z","abstract_excerpt":"Dynamic affinity scheduling has been an open problem for nearly three decades. The problem is to dynamically schedule multi-type tasks to multi-skilled servers such that the resulting queueing system is both stable in the capacity region (throughput optimality) and the mean delay of tasks is minimized at high loads near the boundary of the capacity region (heavy-traffic optimality). As for applications, data-intensive analytics like MapReduce, Hadoop, and Dryad fit into this setting, where the set of servers is heterogeneous for different task types, so the pair of task type and server determi"},"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":"1709.08115","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2017-09-23T20:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"cdc7762fb904fb8bceb714ac87a59607f0edc37681186ee3010fa63bbfa43fb1","abstract_canon_sha256":"8db9a2c097d3d17a09ce07a102dad1f96f92c25a212d993d0fc7c0f6c6293dbb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.204132Z","signature_b64":"X5g/9fr3pgsayMputIvkzKY1r95AYgBwc3RXrxPP+U4CKB7JfkzYFwnCNv4pPQIXfzi4NTrS3wITIONGSmJwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfd628dc5896e1bb6de481964f38998123c573b1c2b13abd7968611726e327a0","last_reissued_at":"2026-05-17T23:56:30.203688Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.203688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GB-PANDAS: Throughput and heavy-traffic optimality analysis for affinity scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Ali Yekkehkhany, Avesta Hojjati, Mohammad H Hajiesmaili","submitted_at":"2017-09-23T20:38:25Z","abstract_excerpt":"Dynamic affinity scheduling has been an open problem for nearly three decades. The problem is to dynamically schedule multi-type tasks to multi-skilled servers such that the resulting queueing system is both stable in the capacity region (throughput optimality) and the mean delay of tasks is minimized at high loads near the boundary of the capacity region (heavy-traffic optimality). As for applications, data-intensive analytics like MapReduce, Hadoop, and Dryad fit into this setting, where the set of servers is heterogeneous for different task types, so the pair of task type and server determi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08115","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":"1709.08115","created_at":"2026-05-17T23:56:30.203755+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.08115v1","created_at":"2026-05-17T23:56:30.203755+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08115","created_at":"2026-05-17T23:56:30.203755+00:00"},{"alias_kind":"pith_short_12","alias_value":"37LCRXCYS3Q3","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"37LCRXCYS3Q3W3PE","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"37LCRXCY","created_at":"2026-05-18T12:30:58.224056+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/37LCRXCYS3Q3W3PEQGLE6OEZQE","json":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE.json","graph_json":"https://pith.science/api/pith-number/37LCRXCYS3Q3W3PEQGLE6OEZQE/graph.json","events_json":"https://pith.science/api/pith-number/37LCRXCYS3Q3W3PEQGLE6OEZQE/events.json","paper":"https://pith.science/paper/37LCRXCY"},"agent_actions":{"view_html":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE","download_json":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE.json","view_paper":"https://pith.science/paper/37LCRXCY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.08115&json=true","fetch_graph":"https://pith.science/api/pith-number/37LCRXCYS3Q3W3PEQGLE6OEZQE/graph.json","fetch_events":"https://pith.science/api/pith-number/37LCRXCYS3Q3W3PEQGLE6OEZQE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE/action/storage_attestation","attest_author":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE/action/author_attestation","sign_citation":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE/action/citation_signature","submit_replication":"https://pith.science/pith/37LCRXCYS3Q3W3PEQGLE6OEZQE/action/replication_record"}},"created_at":"2026-05-17T23:56:30.203755+00:00","updated_at":"2026-05-17T23:56:30.203755+00:00"}