{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CH4KSVSEVEY6LCBVRBYQANXPHM","short_pith_number":"pith:CH4KSVSE","schema_version":"1.0","canonical_sha256":"11f8a95644a931e5883588710036ef3b1eae8aaa0267933f91913f877dd85277","source":{"kind":"arxiv","id":"1610.07236","version":1},"attestation_state":"computed","paper":{"title":"Hybrid Static/Dynamic Schedules for Tiled Polyhedral Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.PL","authors_text":"David Wonnacott, Guillaume Iooss, Nirmal Prajapati, Sanjay Rajopadhye, Tian Jin, Waruna Ranasinghe, Yun Zou","submitted_at":"2016-10-23T21:29:29Z","abstract_excerpt":"Polyhedral compilers perform optimizations such as tiling and parallelization; when doing both, they usually generate code that executes \"barrier-synchronized wavefronts\" of tiles. We present a system to express and generate code for hybrid schedules, where some constraints are automatically satisfied through the structure of the code, and the remainder are dynamically enforced at run-time with data flow mechanisms. We prove bounds on the added overheads that are better, by at least one polynomial degree, than those of previous techniques.\n  We propose a generic mechanism to implement the need"},"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":"1610.07236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-10-23T21:29:29Z","cross_cats_sorted":["cs.DC","cs.PF"],"title_canon_sha256":"6934ea4f4896ab363c7d4799d9c5e3f514006ad8bde884b87f856cef26be5c87","abstract_canon_sha256":"3388cbbe2613f400205755c21db2d4e6c651ce341c395d4b18859b44637886ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:30.575442Z","signature_b64":"a0GU5UHhLVMkUIcCqYu55TBDZ/1FXxieyyPKfC91Dc0uYnnb4iiT+mgx2GK/tAtGhRwnhZK8zzh/tyRMSlfqDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11f8a95644a931e5883588710036ef3b1eae8aaa0267933f91913f877dd85277","last_reissued_at":"2026-05-18T01:01:30.574601Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:30.574601Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Static/Dynamic Schedules for Tiled Polyhedral Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.PF"],"primary_cat":"cs.PL","authors_text":"David Wonnacott, Guillaume Iooss, Nirmal Prajapati, Sanjay Rajopadhye, Tian Jin, Waruna Ranasinghe, Yun Zou","submitted_at":"2016-10-23T21:29:29Z","abstract_excerpt":"Polyhedral compilers perform optimizations such as tiling and parallelization; when doing both, they usually generate code that executes \"barrier-synchronized wavefronts\" of tiles. We present a system to express and generate code for hybrid schedules, where some constraints are automatically satisfied through the structure of the code, and the remainder are dynamically enforced at run-time with data flow mechanisms. We prove bounds on the added overheads that are better, by at least one polynomial degree, than those of previous techniques.\n  We propose a generic mechanism to implement the need"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07236","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":"1610.07236","created_at":"2026-05-18T01:01:30.574731+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07236v1","created_at":"2026-05-18T01:01:30.574731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07236","created_at":"2026-05-18T01:01:30.574731+00:00"},{"alias_kind":"pith_short_12","alias_value":"CH4KSVSEVEY6","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CH4KSVSEVEY6LCBV","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CH4KSVSE","created_at":"2026-05-18T12:30:09.641336+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/CH4KSVSEVEY6LCBVRBYQANXPHM","json":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM.json","graph_json":"https://pith.science/api/pith-number/CH4KSVSEVEY6LCBVRBYQANXPHM/graph.json","events_json":"https://pith.science/api/pith-number/CH4KSVSEVEY6LCBVRBYQANXPHM/events.json","paper":"https://pith.science/paper/CH4KSVSE"},"agent_actions":{"view_html":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM","download_json":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM.json","view_paper":"https://pith.science/paper/CH4KSVSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07236&json=true","fetch_graph":"https://pith.science/api/pith-number/CH4KSVSEVEY6LCBVRBYQANXPHM/graph.json","fetch_events":"https://pith.science/api/pith-number/CH4KSVSEVEY6LCBVRBYQANXPHM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM/action/storage_attestation","attest_author":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM/action/author_attestation","sign_citation":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM/action/citation_signature","submit_replication":"https://pith.science/pith/CH4KSVSEVEY6LCBVRBYQANXPHM/action/replication_record"}},"created_at":"2026-05-18T01:01:30.574731+00:00","updated_at":"2026-05-18T01:01:30.574731+00:00"}