{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:J4NGSXJ3RPGYNSMQE6EBL4JC2K","short_pith_number":"pith:J4NGSXJ3","schema_version":"1.0","canonical_sha256":"4f1a695d3b8bcd86c990278815f122d2b9441438139d987959cf7b3eb8f77190","source":{"kind":"arxiv","id":"1110.2677","version":1},"attestation_state":"computed","paper":{"title":"Hybrid static/dynamic scheduling for already optimized dense matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Laura Grigori, Simplice Donfack, Vivek Kale, William D. Gropp","submitted_at":"2011-10-12T15:09:45Z","abstract_excerpt":"We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully"},"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":"1110.2677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2011-10-12T15:09:45Z","cross_cats_sorted":[],"title_canon_sha256":"83e16261861428c9af251486c9d4fa4b0ba681636e5975681bf5af32b4d97474","abstract_canon_sha256":"808dac60bcf7a782af3b35ac9159e0c4828d629cd79f84a839b1dfdfb669a9a2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:07.790362Z","signature_b64":"TmwS68OFK175QfKaIdSMb3vOhJ39nT98v7HJTU3HPOzDcCyBBVkhMDxzElEmOd0yvn0rXV0PK9xpv6NRleP6AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4f1a695d3b8bcd86c990278815f122d2b9441438139d987959cf7b3eb8f77190","last_reissued_at":"2026-05-18T04:11:07.789758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:07.789758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid static/dynamic scheduling for already optimized dense matrix factorization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Laura Grigori, Simplice Donfack, Vivek Kale, William D. Gropp","submitted_at":"2011-10-12T15:09:45Z","abstract_excerpt":"We present the use of a hybrid static/dynamic scheduling strategy of the task dependency graph for direct methods used in dense numerical linear algebra. This strategy provides a balance of data locality, load balance, and low dequeue overhead. We show that the usage of this scheduling in communication avoiding dense factorization leads to significant performance gains. On a 48 core AMD Opteron NUMA machine, our experiments show that we can achieve up to 64% improvement over a version of CALU that uses fully dynamic scheduling, and up to 30% improvement over the version of CALU that uses fully"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2677","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":"1110.2677","created_at":"2026-05-18T04:11:07.789831+00:00"},{"alias_kind":"arxiv_version","alias_value":"1110.2677v1","created_at":"2026-05-18T04:11:07.789831+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2677","created_at":"2026-05-18T04:11:07.789831+00:00"},{"alias_kind":"pith_short_12","alias_value":"J4NGSXJ3RPGY","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"J4NGSXJ3RPGYNSMQ","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"J4NGSXJ3","created_at":"2026-05-18T12:26:32.869790+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/J4NGSXJ3RPGYNSMQE6EBL4JC2K","json":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K.json","graph_json":"https://pith.science/api/pith-number/J4NGSXJ3RPGYNSMQE6EBL4JC2K/graph.json","events_json":"https://pith.science/api/pith-number/J4NGSXJ3RPGYNSMQE6EBL4JC2K/events.json","paper":"https://pith.science/paper/J4NGSXJ3"},"agent_actions":{"view_html":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K","download_json":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K.json","view_paper":"https://pith.science/paper/J4NGSXJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1110.2677&json=true","fetch_graph":"https://pith.science/api/pith-number/J4NGSXJ3RPGYNSMQE6EBL4JC2K/graph.json","fetch_events":"https://pith.science/api/pith-number/J4NGSXJ3RPGYNSMQE6EBL4JC2K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/action/storage_attestation","attest_author":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/action/author_attestation","sign_citation":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/action/citation_signature","submit_replication":"https://pith.science/pith/J4NGSXJ3RPGYNSMQE6EBL4JC2K/action/replication_record"}},"created_at":"2026-05-18T04:11:07.789831+00:00","updated_at":"2026-05-18T04:11:07.789831+00:00"}