{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:35HPAZDOQVYHWZMWM2CNHQ7ZBW","short_pith_number":"pith:35HPAZDO","schema_version":"1.0","canonical_sha256":"df4ef0646e85707b65966684d3c3f90d92986574b67b050523dcba99ecb94a60","source":{"kind":"arxiv","id":"2109.00665","version":1},"attestation_state":"computed","paper":{"title":"Agon: A Scalable Competitive Scheduler for Large Heterogeneous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Andreas Prodromou, Ashish Venkat, Dean M. Tullsen","submitted_at":"2021-09-02T01:37:16Z","abstract_excerpt":"This work proposes a competitive scheduling approach, designed to scale to large heterogeneous multicore systems. This scheduler overcomes the challenges of (1) the high computation overhead of near-optimal schedulers, and (2) the error introduced by inaccurate performance predictions. This paper presents Agon, a neural network-based classifier that selects from a range of schedulers, from simple to very accurate, and learns which scheduler provides the right balance of accuracy and overhead for each scheduling interval. Agon also employs a de-noising frontend allowing the individual scheduler"},"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":"2109.00665","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AR","submitted_at":"2021-09-02T01:37:16Z","cross_cats_sorted":[],"title_canon_sha256":"f6f2287e92df54382f7d9f0415955bbaed2e381d917de264d3371a8230edddb1","abstract_canon_sha256":"e9aff898ec203cefa0cbaa2c0ad2a281208ee337e370e3d83bb7c4fea27d3d0a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:10:57.419590Z","signature_b64":"unJRO5CAKRmmOLKGaIbBlMAlJBeKpEou1Uv7OoEdj+a6U2MdnJF3D70uzOyevIXe9Pm95DGbrLM4RTXhbZW1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df4ef0646e85707b65966684d3c3f90d92986574b67b050523dcba99ecb94a60","last_reissued_at":"2026-07-05T03:10:57.419182Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:10:57.419182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Agon: A Scalable Competitive Scheduler for Large Heterogeneous Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Andreas Prodromou, Ashish Venkat, Dean M. Tullsen","submitted_at":"2021-09-02T01:37:16Z","abstract_excerpt":"This work proposes a competitive scheduling approach, designed to scale to large heterogeneous multicore systems. This scheduler overcomes the challenges of (1) the high computation overhead of near-optimal schedulers, and (2) the error introduced by inaccurate performance predictions. This paper presents Agon, a neural network-based classifier that selects from a range of schedulers, from simple to very accurate, and learns which scheduler provides the right balance of accuracy and overhead for each scheduling interval. Agon also employs a de-noising frontend allowing the individual scheduler"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.00665","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/2109.00665/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":"2109.00665","created_at":"2026-07-05T03:10:57.419239+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.00665v1","created_at":"2026-07-05T03:10:57.419239+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.00665","created_at":"2026-07-05T03:10:57.419239+00:00"},{"alias_kind":"pith_short_12","alias_value":"35HPAZDOQVYH","created_at":"2026-07-05T03:10:57.419239+00:00"},{"alias_kind":"pith_short_16","alias_value":"35HPAZDOQVYHWZMW","created_at":"2026-07-05T03:10:57.419239+00:00"},{"alias_kind":"pith_short_8","alias_value":"35HPAZDO","created_at":"2026-07-05T03:10:57.419239+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/35HPAZDOQVYHWZMWM2CNHQ7ZBW","json":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW.json","graph_json":"https://pith.science/api/pith-number/35HPAZDOQVYHWZMWM2CNHQ7ZBW/graph.json","events_json":"https://pith.science/api/pith-number/35HPAZDOQVYHWZMWM2CNHQ7ZBW/events.json","paper":"https://pith.science/paper/35HPAZDO"},"agent_actions":{"view_html":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW","download_json":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW.json","view_paper":"https://pith.science/paper/35HPAZDO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.00665&json=true","fetch_graph":"https://pith.science/api/pith-number/35HPAZDOQVYHWZMWM2CNHQ7ZBW/graph.json","fetch_events":"https://pith.science/api/pith-number/35HPAZDOQVYHWZMWM2CNHQ7ZBW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW/action/storage_attestation","attest_author":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW/action/author_attestation","sign_citation":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW/action/citation_signature","submit_replication":"https://pith.science/pith/35HPAZDOQVYHWZMWM2CNHQ7ZBW/action/replication_record"}},"created_at":"2026-07-05T03:10:57.419239+00:00","updated_at":"2026-07-05T03:10:57.419239+00:00"}