{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RRS6SO6LU4IZPBYXJTIQ2R2STX","short_pith_number":"pith:RRS6SO6L","schema_version":"1.0","canonical_sha256":"8c65e93bcba7119787174cd10d47529de47e610830b22a6fb51b6b5c9599c96e","source":{"kind":"arxiv","id":"1805.01768","version":1},"attestation_state":"computed","paper":{"title":"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","submitted_at":"2018-05-03T08:12:30Z","abstract_excerpt":"We study in this paper the impact of communication latency on the classical Work Stealing load balancing algorithm. Our approach considers existing performance models and the underlying algorithms. We introduce a latency parameter in the model and study its overall impact by careful observations of simulation results. Using this method we are able to derive a new expression of the expected running time of divisible load applications. This expression enables us to predict under which conditions a given run will yield acceptable performance. For instance, we can easily calibrate the maximal numb"},"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.01768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-05-03T08:12:30Z","cross_cats_sorted":[],"title_canon_sha256":"376150e1d25522c222b07a68b316a7d80cb455aaa255d1f9e032aaba32bd29e3","abstract_canon_sha256":"2c2f9e9a4845d5925ed94d37fe6cbe23dbe500b53610a732ac21b951877ae86f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:46.742162Z","signature_b64":"LWEEGwtnqvLhgkK1h0wKYM5Lw+cYpI0icuTLlmp0u1MnK2lqGzOidWNM4YlFpEKrw5SKAdplSuZy+NpU9e/3AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c65e93bcba7119787174cd10d47529de47e610830b22a6fb51b6b5c9599c96e","last_reissued_at":"2026-05-18T00:16:46.741550Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:46.741550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"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","submitted_at":"2018-05-03T08:12:30Z","abstract_excerpt":"We study in this paper the impact of communication latency on the classical Work Stealing load balancing algorithm. Our approach considers existing performance models and the underlying algorithms. We introduce a latency parameter in the model and study its overall impact by careful observations of simulation results. Using this method we are able to derive a new expression of the expected running time of divisible load applications. This expression enables us to predict under which conditions a given run will yield acceptable performance. For instance, we can easily calibrate the maximal numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.01768","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.01768","created_at":"2026-05-18T00:16:46.741660+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.01768v1","created_at":"2026-05-18T00:16:46.741660+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.01768","created_at":"2026-05-18T00:16:46.741660+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRS6SO6LU4IZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRS6SO6LU4IZPBYX","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRS6SO6L","created_at":"2026-05-18T12:32:50.500415+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/RRS6SO6LU4IZPBYXJTIQ2R2STX","json":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX.json","graph_json":"https://pith.science/api/pith-number/RRS6SO6LU4IZPBYXJTIQ2R2STX/graph.json","events_json":"https://pith.science/api/pith-number/RRS6SO6LU4IZPBYXJTIQ2R2STX/events.json","paper":"https://pith.science/paper/RRS6SO6L"},"agent_actions":{"view_html":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX","download_json":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX.json","view_paper":"https://pith.science/paper/RRS6SO6L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.01768&json=true","fetch_graph":"https://pith.science/api/pith-number/RRS6SO6LU4IZPBYXJTIQ2R2STX/graph.json","fetch_events":"https://pith.science/api/pith-number/RRS6SO6LU4IZPBYXJTIQ2R2STX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX/action/storage_attestation","attest_author":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX/action/author_attestation","sign_citation":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX/action/citation_signature","submit_replication":"https://pith.science/pith/RRS6SO6LU4IZPBYXJTIQ2R2STX/action/replication_record"}},"created_at":"2026-05-18T00:16:46.741660+00:00","updated_at":"2026-05-18T00:16:46.741660+00:00"}