{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KVPCL2HKP5XJFADQZRZTQKGWTZ","short_pith_number":"pith:KVPCL2HK","schema_version":"1.0","canonical_sha256":"555e25e8ea7f6e928070cc733828d69e4a5f19c575b961afd29745b8b2678523","source":{"kind":"arxiv","id":"1805.00857","version":1},"attestation_state":"computed","paper":{"title":"A new analysis of Work Stealing with latency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Denis Trystram, Frederic Wagner, Mohammed Khatiri, Nicolas Gast","submitted_at":"2018-05-02T15:04:51Z","abstract_excerpt":"We study in this paper the impact of communication latency on the classical Work Stealing load balancing algorithm. Our paper extends the reference model in which we introduce a latency parameter. By using a theoretical analysis and simulation, we study the overall impact of this latency on the Makespan (maximum completion time). We derive a new expression of the expected running time of a bag of tasks scheduled by Work Stealing. This expression enables us to predict under which conditions a given run will yield acceptable performance. For instance, we can easily calibrate the maximal number o"},"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":"1805.00857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-02T15:04:51Z","cross_cats_sorted":[],"title_canon_sha256":"63d005600041b4b4902b87dca0fcf51713a135d143c4be4beae2ff98424e4d25","abstract_canon_sha256":"814479f59dc55990f81c1df2527b0ed87b8e0b9f6ca9a21ea02d5dadfd319d01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:57.473852Z","signature_b64":"b6RmyhwOLpml0Dsr3yPkSug12LB6rn1sd/aE86tVnAYyHAQ4WnS2TYHorO00aI6HWvuPfMMohPJgsCETsHNVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"555e25e8ea7f6e928070cc733828d69e4a5f19c575b961afd29745b8b2678523","last_reissued_at":"2026-05-18T00:16:57.473130Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:57.473130Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new analysis of Work Stealing with latency","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Denis Trystram, Frederic Wagner, Mohammed Khatiri, Nicolas Gast","submitted_at":"2018-05-02T15:04:51Z","abstract_excerpt":"We study in this paper the impact of communication latency on the classical Work Stealing load balancing algorithm. Our paper extends the reference model in which we introduce a latency parameter. By using a theoretical analysis and simulation, we study the overall impact of this latency on the Makespan (maximum completion time). We derive a new expression of the expected running time of a bag of tasks scheduled by Work Stealing. This expression enables us to predict under which conditions a given run will yield acceptable performance. For instance, we can easily calibrate the maximal number o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.00857","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":"1805.00857","created_at":"2026-05-18T00:16:57.473240+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.00857v1","created_at":"2026-05-18T00:16:57.473240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.00857","created_at":"2026-05-18T00:16:57.473240+00:00"},{"alias_kind":"pith_short_12","alias_value":"KVPCL2HKP5XJ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KVPCL2HKP5XJFADQ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KVPCL2HK","created_at":"2026-05-18T12:32:33.847187+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/KVPCL2HKP5XJFADQZRZTQKGWTZ","json":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ.json","graph_json":"https://pith.science/api/pith-number/KVPCL2HKP5XJFADQZRZTQKGWTZ/graph.json","events_json":"https://pith.science/api/pith-number/KVPCL2HKP5XJFADQZRZTQKGWTZ/events.json","paper":"https://pith.science/paper/KVPCL2HK"},"agent_actions":{"view_html":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ","download_json":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ.json","view_paper":"https://pith.science/paper/KVPCL2HK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.00857&json=true","fetch_graph":"https://pith.science/api/pith-number/KVPCL2HKP5XJFADQZRZTQKGWTZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KVPCL2HKP5XJFADQZRZTQKGWTZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ/action/storage_attestation","attest_author":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ/action/author_attestation","sign_citation":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ/action/citation_signature","submit_replication":"https://pith.science/pith/KVPCL2HKP5XJFADQZRZTQKGWTZ/action/replication_record"}},"created_at":"2026-05-18T00:16:57.473240+00:00","updated_at":"2026-05-18T00:16:57.473240+00:00"}