{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3TXA5A3VXX3TF4NXP2WKJRZCYY","short_pith_number":"pith:3TXA5A3V","schema_version":"1.0","canonical_sha256":"dcee0e8375bdf732f1b77eaca4c722c63b388f6dccf8f3d0c9263c327e2bb0f1","source":{"kind":"arxiv","id":"1404.1943","version":1},"attestation_state":"computed","paper":{"title":"SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs, Sungjin Im","submitted_at":"2014-04-07T20:24:08Z","abstract_excerpt":"We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online \\emph{non-clairvoyant} setting. In this problem, a set of jobs $J$ arrive over time to be scheduled on a set of $M$ machines. Each job $j$ has processing length $p_j$, weight $w_j$, and is processed at a rate of $\\ell_{ij}$ when scheduled on machine $i$. The online scheduler knows the values of $w_j$ and $\\ell_{ij}$ upon arrival of the job, but is not aware of the quantity $p_j$. We present the {\\em first} online algorithm that is {\\em scalable} ($(1+\\eps)$-speed $O(\\frac{1}{\\epsil"},"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":"1404.1943","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-07T20:24:08Z","cross_cats_sorted":[],"title_canon_sha256":"40fd1fd624a9fbdcf3ccac85237cd7b9d102bfa7ebac13f4b47913baf678e792","abstract_canon_sha256":"a0d80266e2b6ed717ea7f5200b9be683ee05ddb16a12ce6eacf11a68148fd6d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:38.975891Z","signature_b64":"t1bI6dpQfH5BexxrAHZJxyf10e/vn33b4zY95rdN2P1Iz7dvr4CplXMQslmwtfpwvV47rTyHhnZr70oD/UxMBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dcee0e8375bdf732f1b77eaca4c722c63b388f6dccf8f3d0c9263c327e2bb0f1","last_reissued_at":"2026-05-18T02:54:38.975369Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:38.975369Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SELFISHMIGRATE: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Janardhan Kulkarni, Kamesh Munagala, Kirk Pruhs, Sungjin Im","submitted_at":"2014-04-07T20:24:08Z","abstract_excerpt":"We consider the classical problem of minimizing the total weighted flow-time for unrelated machines in the online \\emph{non-clairvoyant} setting. In this problem, a set of jobs $J$ arrive over time to be scheduled on a set of $M$ machines. Each job $j$ has processing length $p_j$, weight $w_j$, and is processed at a rate of $\\ell_{ij}$ when scheduled on machine $i$. The online scheduler knows the values of $w_j$ and $\\ell_{ij}$ upon arrival of the job, but is not aware of the quantity $p_j$. We present the {\\em first} online algorithm that is {\\em scalable} ($(1+\\eps)$-speed $O(\\frac{1}{\\epsil"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1943","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":"1404.1943","created_at":"2026-05-18T02:54:38.975470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1943v1","created_at":"2026-05-18T02:54:38.975470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1943","created_at":"2026-05-18T02:54:38.975470+00:00"},{"alias_kind":"pith_short_12","alias_value":"3TXA5A3VXX3T","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3TXA5A3VXX3TF4NX","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3TXA5A3V","created_at":"2026-05-18T12:28:11.866339+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/3TXA5A3VXX3TF4NXP2WKJRZCYY","json":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY.json","graph_json":"https://pith.science/api/pith-number/3TXA5A3VXX3TF4NXP2WKJRZCYY/graph.json","events_json":"https://pith.science/api/pith-number/3TXA5A3VXX3TF4NXP2WKJRZCYY/events.json","paper":"https://pith.science/paper/3TXA5A3V"},"agent_actions":{"view_html":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY","download_json":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY.json","view_paper":"https://pith.science/paper/3TXA5A3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1943&json=true","fetch_graph":"https://pith.science/api/pith-number/3TXA5A3VXX3TF4NXP2WKJRZCYY/graph.json","fetch_events":"https://pith.science/api/pith-number/3TXA5A3VXX3TF4NXP2WKJRZCYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/action/storage_attestation","attest_author":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/action/author_attestation","sign_citation":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/action/citation_signature","submit_replication":"https://pith.science/pith/3TXA5A3VXX3TF4NXP2WKJRZCYY/action/replication_record"}},"created_at":"2026-05-18T02:54:38.975470+00:00","updated_at":"2026-05-18T02:54:38.975470+00:00"}