{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MV6W5HGG2JCWMCLJHNRPJ3OJWY","short_pith_number":"pith:MV6W5HGG","schema_version":"1.0","canonical_sha256":"657d6e9cc6d2456609693b62f4edc9b6124584079fffd458e36fbd3776065181","source":{"kind":"arxiv","id":"1410.7249","version":2},"attestation_state":"computed","paper":{"title":"Scheduling Trees of Malleable Tasks for Sparse Linear Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abdou Guermouche, Bertrand Simon, Fr\\'ed\\'eric Vivien, Loris Marchal","submitted_at":"2014-10-27T14:22:57Z","abstract_excerpt":"Scientific workloads are often described as directed acyclic task graphs. In this paper, we focus on the multifrontal factorization of sparse matrices, whose task graph is structured as a tree of parallel tasks. Among the existing models for parallel tasks, the concept of malleable tasks is especially powerful as it allows each task to be processed on a time-varying number of processors. Following the model advocated by Prasanna and Musicus for matrix computations, we consider malleable tasks whose speedup is $p^\\alpha$, where $p$ is the fractional share of processors on which a task executes,"},"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":"1410.7249","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-27T14:22:57Z","cross_cats_sorted":[],"title_canon_sha256":"e442fd7fdd9cecc3a7bc367e554d8546651fe5774a0c68ef331e9afacf62ae5e","abstract_canon_sha256":"c8865e31e0602485b7864c25be634621c3cc639061b46a3ca01f7d616502c324"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:57:23.540126Z","signature_b64":"hE8eWu5CSV0jHKZIsIf4uFqIUkUgi1X5SpSZo9wgYGz/dUdG1Q+TMsMQNcfIBSivETDcEe5TENuCgzGBXlVADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"657d6e9cc6d2456609693b62f4edc9b6124584079fffd458e36fbd3776065181","last_reissued_at":"2026-05-18T01:57:23.539545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:57:23.539545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scheduling Trees of Malleable Tasks for Sparse Linear Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Abdou Guermouche, Bertrand Simon, Fr\\'ed\\'eric Vivien, Loris Marchal","submitted_at":"2014-10-27T14:22:57Z","abstract_excerpt":"Scientific workloads are often described as directed acyclic task graphs. In this paper, we focus on the multifrontal factorization of sparse matrices, whose task graph is structured as a tree of parallel tasks. Among the existing models for parallel tasks, the concept of malleable tasks is especially powerful as it allows each task to be processed on a time-varying number of processors. Following the model advocated by Prasanna and Musicus for matrix computations, we consider malleable tasks whose speedup is $p^\\alpha$, where $p$ is the fractional share of processors on which a task executes,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.7249","kind":"arxiv","version":2},"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":"1410.7249","created_at":"2026-05-18T01:57:23.539624+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.7249v2","created_at":"2026-05-18T01:57:23.539624+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.7249","created_at":"2026-05-18T01:57:23.539624+00:00"},{"alias_kind":"pith_short_12","alias_value":"MV6W5HGG2JCW","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MV6W5HGG2JCWMCLJ","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MV6W5HGG","created_at":"2026-05-18T12:28:38.356838+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/MV6W5HGG2JCWMCLJHNRPJ3OJWY","json":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY.json","graph_json":"https://pith.science/api/pith-number/MV6W5HGG2JCWMCLJHNRPJ3OJWY/graph.json","events_json":"https://pith.science/api/pith-number/MV6W5HGG2JCWMCLJHNRPJ3OJWY/events.json","paper":"https://pith.science/paper/MV6W5HGG"},"agent_actions":{"view_html":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY","download_json":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY.json","view_paper":"https://pith.science/paper/MV6W5HGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.7249&json=true","fetch_graph":"https://pith.science/api/pith-number/MV6W5HGG2JCWMCLJHNRPJ3OJWY/graph.json","fetch_events":"https://pith.science/api/pith-number/MV6W5HGG2JCWMCLJHNRPJ3OJWY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY/action/storage_attestation","attest_author":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY/action/author_attestation","sign_citation":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY/action/citation_signature","submit_replication":"https://pith.science/pith/MV6W5HGG2JCWMCLJHNRPJ3OJWY/action/replication_record"}},"created_at":"2026-05-18T01:57:23.539624+00:00","updated_at":"2026-05-18T01:57:23.539624+00:00"}