{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:S5ODOXMMF5VWRSTWFHFWCZDQPL","short_pith_number":"pith:S5ODOXMM","schema_version":"1.0","canonical_sha256":"975c375d8c2f6b68ca7629cb6164707af38caa073df0980c3decbf2fe28498d0","source":{"kind":"arxiv","id":"1107.3734","version":1},"attestation_state":"computed","paper":{"title":"Decentralized List Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Denis Trystram, Marc Tchiboukdjian, Nicolas Gast","submitted_at":"2011-07-19T15:13:23Z","abstract_excerpt":"Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single centralized list becomes too prohibitive. A suitable approach to reduce the contention is to distribute the list among the computational units: each processor has only a local view of the work to execute. Thus, the scheduler is no longer greedy and standard performance guarantees are lost.\n  The objective of this work is to study the extra cost that must be p"},"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":"1107.3734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-07-19T15:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"a7f60e73e40519970be764ed328697f21b5d5d4dcfecca9fbdbbcf0178bce192","abstract_canon_sha256":"54efbebff21974d62ade251cbe4cd564a8aa2dcffa550181fe87c04f18a7f6fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:17:16.116614Z","signature_b64":"5QQLgtVlpoNSAlMg4r2bAhd8A0qR3Lo6F7BWCtYW+dsbofbte72XmRq2fxGVbRFiORz+0OXygoL5hxxCNw+OBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"975c375d8c2f6b68ca7629cb6164707af38caa073df0980c3decbf2fe28498d0","last_reissued_at":"2026-05-18T04:17:16.115723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:17:16.115723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized List Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Denis Trystram, Marc Tchiboukdjian, Nicolas Gast","submitted_at":"2011-07-19T15:13:23Z","abstract_excerpt":"Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel and distributed platforms. It is inherently centralized. However, with the increasing number of processors, the cost for managing a single centralized list becomes too prohibitive. A suitable approach to reduce the contention is to distribute the list among the computational units: each processor has only a local view of the work to execute. Thus, the scheduler is no longer greedy and standard performance guarantees are lost.\n  The objective of this work is to study the extra cost that must be p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.3734","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":"1107.3734","created_at":"2026-05-18T04:17:16.115881+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.3734v1","created_at":"2026-05-18T04:17:16.115881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.3734","created_at":"2026-05-18T04:17:16.115881+00:00"},{"alias_kind":"pith_short_12","alias_value":"S5ODOXMMF5VW","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"S5ODOXMMF5VWRSTW","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"S5ODOXMM","created_at":"2026-05-18T12:26:41.206345+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/S5ODOXMMF5VWRSTWFHFWCZDQPL","json":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL.json","graph_json":"https://pith.science/api/pith-number/S5ODOXMMF5VWRSTWFHFWCZDQPL/graph.json","events_json":"https://pith.science/api/pith-number/S5ODOXMMF5VWRSTWFHFWCZDQPL/events.json","paper":"https://pith.science/paper/S5ODOXMM"},"agent_actions":{"view_html":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL","download_json":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL.json","view_paper":"https://pith.science/paper/S5ODOXMM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.3734&json=true","fetch_graph":"https://pith.science/api/pith-number/S5ODOXMMF5VWRSTWFHFWCZDQPL/graph.json","fetch_events":"https://pith.science/api/pith-number/S5ODOXMMF5VWRSTWFHFWCZDQPL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL/action/storage_attestation","attest_author":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL/action/author_attestation","sign_citation":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL/action/citation_signature","submit_replication":"https://pith.science/pith/S5ODOXMMF5VWRSTWFHFWCZDQPL/action/replication_record"}},"created_at":"2026-05-18T04:17:16.115881+00:00","updated_at":"2026-05-18T04:17:16.115881+00:00"}