{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:VVP4MLUHMPC7A7GPEHDVH2AIYC","short_pith_number":"pith:VVP4MLUH","schema_version":"1.0","canonical_sha256":"ad5fc62e8763c5f07ccf21c753e808c0be72c169b2d843f86eeaae5fa161e39c","source":{"kind":"arxiv","id":"1809.05921","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Dynamic Memory Bandwidth Regulation in Multi-core Real-Time Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ankit Agrawal, Gerhard Fohler, Renato Mancuso, Rodolfo Pellizzoni","submitted_at":"2018-09-16T18:02:25Z","abstract_excerpt":"One of the primary sources of unpredictability in modern multi-core embedded systems is contention over shared memory resources, such as caches, interconnects, and DRAM. Despite significant achievements in the design and analysis of multi-core systems, there is a need for a theoretical framework that can be used to reason on the worst-case behavior of real-time workload when both processors and memory resources are subject to scheduling decisions.\n  In this paper, we focus our attention on dynamic allocation of main memory bandwidth. In particular, we study how to determine the worst-case resp"},"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":"1809.05921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-09-16T18:02:25Z","cross_cats_sorted":[],"title_canon_sha256":"b98b4c2415101a936927f5ddb64dbb9975f49bdec13b5298a480964287bb47ca","abstract_canon_sha256":"0963936ca27870263b35e10e051c7693958e9a3189cd7cd597d76d1caf21eafd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:36.117032Z","signature_b64":"x2Uj+PR8JDrtM3VzPsqwL/an6C2KGhHph2YLRF0mm3yoeL9oeWskWdYVXxxp0FJrbIxP4v3/URXf3yeV8akTDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad5fc62e8763c5f07ccf21c753e808c0be72c169b2d843f86eeaae5fa161e39c","last_reissued_at":"2026-05-18T00:05:36.116544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:36.116544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Dynamic Memory Bandwidth Regulation in Multi-core Real-Time Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ankit Agrawal, Gerhard Fohler, Renato Mancuso, Rodolfo Pellizzoni","submitted_at":"2018-09-16T18:02:25Z","abstract_excerpt":"One of the primary sources of unpredictability in modern multi-core embedded systems is contention over shared memory resources, such as caches, interconnects, and DRAM. Despite significant achievements in the design and analysis of multi-core systems, there is a need for a theoretical framework that can be used to reason on the worst-case behavior of real-time workload when both processors and memory resources are subject to scheduling decisions.\n  In this paper, we focus our attention on dynamic allocation of main memory bandwidth. In particular, we study how to determine the worst-case resp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.05921","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":"1809.05921","created_at":"2026-05-18T00:05:36.116607+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.05921v1","created_at":"2026-05-18T00:05:36.116607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.05921","created_at":"2026-05-18T00:05:36.116607+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVP4MLUHMPC7","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVP4MLUHMPC7A7GP","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVP4MLUH","created_at":"2026-05-18T12:32:59.047623+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/VVP4MLUHMPC7A7GPEHDVH2AIYC","json":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC.json","graph_json":"https://pith.science/api/pith-number/VVP4MLUHMPC7A7GPEHDVH2AIYC/graph.json","events_json":"https://pith.science/api/pith-number/VVP4MLUHMPC7A7GPEHDVH2AIYC/events.json","paper":"https://pith.science/paper/VVP4MLUH"},"agent_actions":{"view_html":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC","download_json":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC.json","view_paper":"https://pith.science/paper/VVP4MLUH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.05921&json=true","fetch_graph":"https://pith.science/api/pith-number/VVP4MLUHMPC7A7GPEHDVH2AIYC/graph.json","fetch_events":"https://pith.science/api/pith-number/VVP4MLUHMPC7A7GPEHDVH2AIYC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC/action/storage_attestation","attest_author":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC/action/author_attestation","sign_citation":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC/action/citation_signature","submit_replication":"https://pith.science/pith/VVP4MLUHMPC7A7GPEHDVH2AIYC/action/replication_record"}},"created_at":"2026-05-18T00:05:36.116607+00:00","updated_at":"2026-05-18T00:05:36.116607+00:00"}