{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WDNTJVXGHCPH7POKIJUTFSESEE","short_pith_number":"pith:WDNTJVXG","schema_version":"1.0","canonical_sha256":"b0db34d6e6389e7fbdca426932c892213bfcb17b8a2870b99357f6bf5a10cd0d","source":{"kind":"arxiv","id":"1801.04582","version":1},"attestation_state":"computed","paper":{"title":"Distributed dynamic load balancing for task parallel programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Afshin Zafari, Elisabeth Larsson","submitted_at":"2018-01-14T16:47:52Z","abstract_excerpt":"In this paper, we derive and investigate approaches to dynamically load balance a distributed task parallel application software. The load balancing strategy is based on task migration. Busy processes export parts of their ready task queue to idle processes. Idle--busy pairs of processes find each other through a random search process that succeeds within a few steps with high probability. We evaluate the load balancing approach for a block Cholesky factorization implementation and observe a reduction in execution time on the order of 5\\% in the selected test cases."},"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":"1801.04582","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-01-14T16:47:52Z","cross_cats_sorted":["cs.MS","cs.PF"],"title_canon_sha256":"3d1c3445d2e994e1c5a41d6f43de933f336876d35194a435af7eb04ab0fabfdf","abstract_canon_sha256":"19fa6597e34e8179ea7cd21ed3157090a7ff089cda256cf6693fee0afad2f119"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:03.942886Z","signature_b64":"DAF7BEZstGO4I5YE8ZN3vYRQuzBgDMW31QpCkTyGhIoRXFdTKPtA4OipSSl3E1tMEvRG9iqaiXplk2o8+obuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0db34d6e6389e7fbdca426932c892213bfcb17b8a2870b99357f6bf5a10cd0d","last_reissued_at":"2026-05-18T00:26:03.942358Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:03.942358Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed dynamic load balancing for task parallel programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MS","cs.PF"],"primary_cat":"cs.DC","authors_text":"Afshin Zafari, Elisabeth Larsson","submitted_at":"2018-01-14T16:47:52Z","abstract_excerpt":"In this paper, we derive and investigate approaches to dynamically load balance a distributed task parallel application software. The load balancing strategy is based on task migration. Busy processes export parts of their ready task queue to idle processes. Idle--busy pairs of processes find each other through a random search process that succeeds within a few steps with high probability. We evaluate the load balancing approach for a block Cholesky factorization implementation and observe a reduction in execution time on the order of 5\\% in the selected test cases."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.04582","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":"1801.04582","created_at":"2026-05-18T00:26:03.942448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.04582v1","created_at":"2026-05-18T00:26:03.942448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.04582","created_at":"2026-05-18T00:26:03.942448+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDNTJVXGHCPH","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDNTJVXGHCPH7POK","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDNTJVXG","created_at":"2026-05-18T12:32:59.047623+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/WDNTJVXGHCPH7POKIJUTFSESEE","json":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE.json","graph_json":"https://pith.science/api/pith-number/WDNTJVXGHCPH7POKIJUTFSESEE/graph.json","events_json":"https://pith.science/api/pith-number/WDNTJVXGHCPH7POKIJUTFSESEE/events.json","paper":"https://pith.science/paper/WDNTJVXG"},"agent_actions":{"view_html":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE","download_json":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE.json","view_paper":"https://pith.science/paper/WDNTJVXG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.04582&json=true","fetch_graph":"https://pith.science/api/pith-number/WDNTJVXGHCPH7POKIJUTFSESEE/graph.json","fetch_events":"https://pith.science/api/pith-number/WDNTJVXGHCPH7POKIJUTFSESEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/action/storage_attestation","attest_author":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/action/author_attestation","sign_citation":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/action/citation_signature","submit_replication":"https://pith.science/pith/WDNTJVXGHCPH7POKIJUTFSESEE/action/replication_record"}},"created_at":"2026-05-18T00:26:03.942448+00:00","updated_at":"2026-05-18T00:26:03.942448+00:00"}