{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:422JGL2XK7N3XMMOXGCJV5UN2D","short_pith_number":"pith:422JGL2X","schema_version":"1.0","canonical_sha256":"e6b4932f5757dbbbb18eb9849af68dd0dd090e00a2980d2d33d74064ebdba9d6","source":{"kind":"arxiv","id":"2412.16432","version":1},"attestation_state":"computed","paper":{"title":"DFModel: Design Space Optimization of Large-Scale Systems Exploiting Dataflow Mappings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Ardavan Pedram, Kunle Olukotun, Nathan Zhang, Olivia Hsu, Sho Ko","submitted_at":"2024-12-21T01:37:59Z","abstract_excerpt":"We propose DFModel, a modeling framework for mapping dataflow computation graphs onto large-scale systems. Mapping a workload to a system requires optimizing dataflow mappings at various levels, including the inter-chip (between chips) level and the intra-chip (within a chip) level. DFModel is, to the best of our knowledge, the first framework to perform the optimization at multiple levels of the memory hierarchy and the interconnection network hierarchy. We use DFModel to explore a wide range of workloads on a variety of systems. Evaluated workloads include two state-of-the-art machine learni"},"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":"2412.16432","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2024-12-21T01:37:59Z","cross_cats_sorted":[],"title_canon_sha256":"800c9dccc34d05bb12d97e9c57ac78ea449048e02dff7455205dd39ddc56834d","abstract_canon_sha256":"1fbe38be253895804ff36361107342dfc1183889f5d9bdb9af6772e87bbe1a87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:52:45.921838Z","signature_b64":"EV05SHJ9wJ7was2NmxIqTSwhYPK92IiY94QTxcZEmAktpx121L4o1E1QGVyzwtOWrHgMyYZsqR+gDRbUNgvKBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6b4932f5757dbbbb18eb9849af68dd0dd090e00a2980d2d33d74064ebdba9d6","last_reissued_at":"2026-07-05T09:52:45.921330Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:52:45.921330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DFModel: Design Space Optimization of Large-Scale Systems Exploiting Dataflow Mappings","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Ardavan Pedram, Kunle Olukotun, Nathan Zhang, Olivia Hsu, Sho Ko","submitted_at":"2024-12-21T01:37:59Z","abstract_excerpt":"We propose DFModel, a modeling framework for mapping dataflow computation graphs onto large-scale systems. Mapping a workload to a system requires optimizing dataflow mappings at various levels, including the inter-chip (between chips) level and the intra-chip (within a chip) level. DFModel is, to the best of our knowledge, the first framework to perform the optimization at multiple levels of the memory hierarchy and the interconnection network hierarchy. We use DFModel to explore a wide range of workloads on a variety of systems. Evaluated workloads include two state-of-the-art machine learni"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.16432","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.16432/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2412.16432","created_at":"2026-07-05T09:52:45.921396+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.16432v1","created_at":"2026-07-05T09:52:45.921396+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.16432","created_at":"2026-07-05T09:52:45.921396+00:00"},{"alias_kind":"pith_short_12","alias_value":"422JGL2XK7N3","created_at":"2026-07-05T09:52:45.921396+00:00"},{"alias_kind":"pith_short_16","alias_value":"422JGL2XK7N3XMMO","created_at":"2026-07-05T09:52:45.921396+00:00"},{"alias_kind":"pith_short_8","alias_value":"422JGL2X","created_at":"2026-07-05T09:52:45.921396+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.04750","citing_title":"DeepStack: Scalable and Accurate Design Space Exploration for Distributed 3D-Stacked AI Accelerators","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D","json":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D.json","graph_json":"https://pith.science/api/pith-number/422JGL2XK7N3XMMOXGCJV5UN2D/graph.json","events_json":"https://pith.science/api/pith-number/422JGL2XK7N3XMMOXGCJV5UN2D/events.json","paper":"https://pith.science/paper/422JGL2X"},"agent_actions":{"view_html":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D","download_json":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D.json","view_paper":"https://pith.science/paper/422JGL2X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.16432&json=true","fetch_graph":"https://pith.science/api/pith-number/422JGL2XK7N3XMMOXGCJV5UN2D/graph.json","fetch_events":"https://pith.science/api/pith-number/422JGL2XK7N3XMMOXGCJV5UN2D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D/action/storage_attestation","attest_author":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D/action/author_attestation","sign_citation":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D/action/citation_signature","submit_replication":"https://pith.science/pith/422JGL2XK7N3XMMOXGCJV5UN2D/action/replication_record"}},"created_at":"2026-07-05T09:52:45.921396+00:00","updated_at":"2026-07-05T09:52:45.921396+00:00"}