{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:T55CSG65TZMJOT4MMEKJUB44U6","short_pith_number":"pith:T55CSG65","schema_version":"1.0","canonical_sha256":"9f7a291bdd9e58974f8c61149a079ca79cc61ad2dca5282f044098c04a781c7c","source":{"kind":"arxiv","id":"1908.04236","version":1},"attestation_state":"computed","paper":{"title":"MLP Aware Scheduling Techniques in Multithreaded Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Murthy Durbhakula","submitted_at":"2019-08-12T16:45:41Z","abstract_excerpt":"Major chip manufacturers have all introduced Multithreaded processors. These processors are used for running a variety of workloads. Efficient resource utilization is an important design aspect in such processors. Particularly, it is important to take advantage of available memory-level parallelism(MLP). In this paper I propose a MLP aware operating system (OS) scheduling algorithm for Multithreaded Multi-core processors. By observing the MLP available in each thread and by balancing it with available MLP resources in the system the OS will come up with a new schedule of threads for the next q"},"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":"1908.04236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-08-12T16:45:41Z","cross_cats_sorted":[],"title_canon_sha256":"eaa0f14a9c9e9b701d056b205c428978feaa0f2cf9b5ac66e7831b9b8636dc92","abstract_canon_sha256":"e8c812176dec34bc47f356fe2c3dece20446148386fbfb8f7449ad3aa7f3e575"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:53:21.703040Z","signature_b64":"kard9JrkQ8QygAy1u0bAV/eLfxncUIEMQoliBR8UsZXPUeFHQtFFIJK2EanldV4eEWS8pFJLzAVXzOXyzIR6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f7a291bdd9e58974f8c61149a079ca79cc61ad2dca5282f044098c04a781c7c","last_reissued_at":"2026-07-04T23:53:21.702647Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:53:21.702647Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MLP Aware Scheduling Techniques in Multithreaded Processors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Murthy Durbhakula","submitted_at":"2019-08-12T16:45:41Z","abstract_excerpt":"Major chip manufacturers have all introduced Multithreaded processors. These processors are used for running a variety of workloads. Efficient resource utilization is an important design aspect in such processors. Particularly, it is important to take advantage of available memory-level parallelism(MLP). In this paper I propose a MLP aware operating system (OS) scheduling algorithm for Multithreaded Multi-core processors. By observing the MLP available in each thread and by balancing it with available MLP resources in the system the OS will come up with a new schedule of threads for the next q"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04236","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/1908.04236/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":"1908.04236","created_at":"2026-07-04T23:53:21.702706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04236v1","created_at":"2026-07-04T23:53:21.702706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04236","created_at":"2026-07-04T23:53:21.702706+00:00"},{"alias_kind":"pith_short_12","alias_value":"T55CSG65TZMJ","created_at":"2026-07-04T23:53:21.702706+00:00"},{"alias_kind":"pith_short_16","alias_value":"T55CSG65TZMJOT4M","created_at":"2026-07-04T23:53:21.702706+00:00"},{"alias_kind":"pith_short_8","alias_value":"T55CSG65","created_at":"2026-07-04T23:53:21.702706+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/T55CSG65TZMJOT4MMEKJUB44U6","json":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6.json","graph_json":"https://pith.science/api/pith-number/T55CSG65TZMJOT4MMEKJUB44U6/graph.json","events_json":"https://pith.science/api/pith-number/T55CSG65TZMJOT4MMEKJUB44U6/events.json","paper":"https://pith.science/paper/T55CSG65"},"agent_actions":{"view_html":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6","download_json":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6.json","view_paper":"https://pith.science/paper/T55CSG65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04236&json=true","fetch_graph":"https://pith.science/api/pith-number/T55CSG65TZMJOT4MMEKJUB44U6/graph.json","fetch_events":"https://pith.science/api/pith-number/T55CSG65TZMJOT4MMEKJUB44U6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6/action/storage_attestation","attest_author":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6/action/author_attestation","sign_citation":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6/action/citation_signature","submit_replication":"https://pith.science/pith/T55CSG65TZMJOT4MMEKJUB44U6/action/replication_record"}},"created_at":"2026-07-04T23:53:21.702706+00:00","updated_at":"2026-07-04T23:53:21.702706+00:00"}