{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DJAEFGYR57IWY4CD3S62TFJKEL","short_pith_number":"pith:DJAEFGYR","schema_version":"1.0","canonical_sha256":"1a40429b11efd16c7043dcbda9952a22cf311f636a79d6177e908c718d425294","source":{"kind":"arxiv","id":"1810.10632","version":1},"attestation_state":"computed","paper":{"title":"On the analysis of scheduling algorithms for structured parallel computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guilherme Rito, Herv\\'e Paulino","submitted_at":"2018-10-24T21:31:25Z","abstract_excerpt":"Algorithms for scheduling structured parallel computations have been widely studied in the literature. For some time now, Work Stealing is one of the most popular for scheduling such computations, and its performance has been studied in both theory and practice. Although it delivers provably good performances, the effectiveness of its underlying load balancing strategy is known to be limited for certain classes of computations, particularly the ones exhibiting irregular parallelism (e.g. depth first searches). Many studies have addressed this limitation from a purely load balancing perspective"},"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":"1810.10632","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-24T21:31:25Z","cross_cats_sorted":[],"title_canon_sha256":"f7e8093cd7b358b3009d9b50c4ed27992ea51d4ee4c42589ed0e38d0005406ec","abstract_canon_sha256":"6bc1e52b56023e9f09bcdb96c38efa5cd1d1b4fc487da46c883b474bddc145ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:20.038714Z","signature_b64":"HajpT3FRf4/Ssdq2pQ0rp71cFAEB1ptD7plmc3RDY3THGARtd2cOfBCAd+GTSMo5NYi2We1pAq7Q6HK/vA8AAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a40429b11efd16c7043dcbda9952a22cf311f636a79d6177e908c718d425294","last_reissued_at":"2026-05-18T00:02:20.038296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:20.038296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the analysis of scheduling algorithms for structured parallel computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Guilherme Rito, Herv\\'e Paulino","submitted_at":"2018-10-24T21:31:25Z","abstract_excerpt":"Algorithms for scheduling structured parallel computations have been widely studied in the literature. For some time now, Work Stealing is one of the most popular for scheduling such computations, and its performance has been studied in both theory and practice. Although it delivers provably good performances, the effectiveness of its underlying load balancing strategy is known to be limited for certain classes of computations, particularly the ones exhibiting irregular parallelism (e.g. depth first searches). Many studies have addressed this limitation from a purely load balancing perspective"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10632","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":"1810.10632","created_at":"2026-05-18T00:02:20.038379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.10632v1","created_at":"2026-05-18T00:02:20.038379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10632","created_at":"2026-05-18T00:02:20.038379+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJAEFGYR57IW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJAEFGYR57IWY4CD","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJAEFGYR","created_at":"2026-05-18T12:32:19.392346+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/DJAEFGYR57IWY4CD3S62TFJKEL","json":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL.json","graph_json":"https://pith.science/api/pith-number/DJAEFGYR57IWY4CD3S62TFJKEL/graph.json","events_json":"https://pith.science/api/pith-number/DJAEFGYR57IWY4CD3S62TFJKEL/events.json","paper":"https://pith.science/paper/DJAEFGYR"},"agent_actions":{"view_html":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL","download_json":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL.json","view_paper":"https://pith.science/paper/DJAEFGYR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.10632&json=true","fetch_graph":"https://pith.science/api/pith-number/DJAEFGYR57IWY4CD3S62TFJKEL/graph.json","fetch_events":"https://pith.science/api/pith-number/DJAEFGYR57IWY4CD3S62TFJKEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL/action/storage_attestation","attest_author":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL/action/author_attestation","sign_citation":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL/action/citation_signature","submit_replication":"https://pith.science/pith/DJAEFGYR57IWY4CD3S62TFJKEL/action/replication_record"}},"created_at":"2026-05-18T00:02:20.038379+00:00","updated_at":"2026-05-18T00:02:20.038379+00:00"}