{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BPQ2I7N2MI74ZVI3IQGHVD7IDS","short_pith_number":"pith:BPQ2I7N2","schema_version":"1.0","canonical_sha256":"0be1a47dba623fccd51b440c7a8fe81caf5a15e500d189ffcfe08712de05e02f","source":{"kind":"arxiv","id":"1909.02119","version":2},"attestation_state":"computed","paper":{"title":"Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Ravishankar K. Iyer, Saurabh Jha, Subho S Banerjee, Zbigniew T. Kalbarczyk","submitted_at":"2019-09-04T21:19:14Z","abstract_excerpt":"The problem of scheduling of workloads onto heterogeneous processors (e.g., CPUs, GPUs, FPGAs) is of fundamental importance in modern data centers. Current system schedulers rely on application/system-specific heuristics that have to be built on a case-by-case basis. Recent work has demonstrated ML techniques for automating the heuristic search by using black-box approaches which require significant training data and time, which make them challenging to use in practice. This paper presents Symphony, a scheduling framework that addresses the challenge in two ways: (i) a domain-driven Bayesian r"},"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":"1909.02119","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-09-04T21:19:14Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"1430aba0e32451521b1dfd7e622c999c2912bb3cd521c23eab920f8aa667c15e","abstract_canon_sha256":"665aea690c434fca51ec251133949083a5b13918473884d538f9aa1c1409ff04"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:14:28.119911Z","signature_b64":"XA8RsHR5rfudHT7OTf8tHpkfb5Oco9lsiqHBihhdo8zKyvh16NM3ABuXjAzCrc+0idr1js6S7jKQvTNv7uzLCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be1a47dba623fccd51b440c7a8fe81caf5a15e500d189ffcfe08712de05e02f","last_reissued_at":"2026-07-05T01:14:28.119435Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:14:28.119435Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inductive-bias-driven Reinforcement Learning For Efficient Schedules in Heterogeneous Clusters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DC","authors_text":"Ravishankar K. Iyer, Saurabh Jha, Subho S Banerjee, Zbigniew T. Kalbarczyk","submitted_at":"2019-09-04T21:19:14Z","abstract_excerpt":"The problem of scheduling of workloads onto heterogeneous processors (e.g., CPUs, GPUs, FPGAs) is of fundamental importance in modern data centers. Current system schedulers rely on application/system-specific heuristics that have to be built on a case-by-case basis. Recent work has demonstrated ML techniques for automating the heuristic search by using black-box approaches which require significant training data and time, which make them challenging to use in practice. This paper presents Symphony, a scheduling framework that addresses the challenge in two ways: (i) a domain-driven Bayesian r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.02119","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1909.02119/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":"1909.02119","created_at":"2026-07-05T01:14:28.119492+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.02119v2","created_at":"2026-07-05T01:14:28.119492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.02119","created_at":"2026-07-05T01:14:28.119492+00:00"},{"alias_kind":"pith_short_12","alias_value":"BPQ2I7N2MI74","created_at":"2026-07-05T01:14:28.119492+00:00"},{"alias_kind":"pith_short_16","alias_value":"BPQ2I7N2MI74ZVI3","created_at":"2026-07-05T01:14:28.119492+00:00"},{"alias_kind":"pith_short_8","alias_value":"BPQ2I7N2","created_at":"2026-07-05T01:14:28.119492+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/BPQ2I7N2MI74ZVI3IQGHVD7IDS","json":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS.json","graph_json":"https://pith.science/api/pith-number/BPQ2I7N2MI74ZVI3IQGHVD7IDS/graph.json","events_json":"https://pith.science/api/pith-number/BPQ2I7N2MI74ZVI3IQGHVD7IDS/events.json","paper":"https://pith.science/paper/BPQ2I7N2"},"agent_actions":{"view_html":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS","download_json":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS.json","view_paper":"https://pith.science/paper/BPQ2I7N2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.02119&json=true","fetch_graph":"https://pith.science/api/pith-number/BPQ2I7N2MI74ZVI3IQGHVD7IDS/graph.json","fetch_events":"https://pith.science/api/pith-number/BPQ2I7N2MI74ZVI3IQGHVD7IDS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS/action/storage_attestation","attest_author":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS/action/author_attestation","sign_citation":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS/action/citation_signature","submit_replication":"https://pith.science/pith/BPQ2I7N2MI74ZVI3IQGHVD7IDS/action/replication_record"}},"created_at":"2026-07-05T01:14:28.119492+00:00","updated_at":"2026-07-05T01:14:28.119492+00:00"}