{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5TLVZWJLSKI2PLN4ENJ7CUFQLC","short_pith_number":"pith:5TLVZWJL","schema_version":"1.0","canonical_sha256":"ecd75cd92b9291a7adbc2353f150b058ac440aa97797b8bfc62c2988a95cb25f","source":{"kind":"arxiv","id":"1403.0334","version":1},"attestation_state":"computed","paper":{"title":"Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Imran Hossain Faruk, Sanjaya Kumar Panda, Sourav Kumar Bhoi","submitted_at":"2014-03-03T08:13:29Z","abstract_excerpt":"Management of disk scheduling is a very important aspect of operating system. Performance of the disk scheduling completely depends on how efficient is the scheduling algorithm to allocate services to the request in a better manner. Many algorithms (FIFO, SSTF, SCAN, C-SCAN, LOOK, etc.) are developed in the recent years in order to optimize the system disk I/O performance. By reducing the average seek time and transfer time, we can improve the performance of disk I/O operation. In our proposed algorithm, Optimize Disk Scheduling Algorithm (ODSA) is taking less average seek time and transfer ti"},"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":"1403.0334","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.OS","submitted_at":"2014-03-03T08:13:29Z","cross_cats_sorted":[],"title_canon_sha256":"a55ef99f1c45cc34aa5ebbe6e9dd37e5038f98a63da632e1d54a9af9fe25b45c","abstract_canon_sha256":"1c4014eb997d824ea038f9fa021c959af9372684e1c76db01852cf9fffee2057"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:25.161450Z","signature_b64":"6sB7BOFrkDWtkAE9Xv3vZh7cq7PovBEiUUjQWO68NMseNbIScs4sHGoqojb87JuTBu2RPXk3UUCp97uA64UfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecd75cd92b9291a7adbc2353f150b058ac440aa97797b8bfc62c2988a95cb25f","last_reissued_at":"2026-05-18T02:57:25.160905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:25.160905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design and Performance Evaluation of an Optimized Disk Scheduling Algorithm (ODSA)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.OS","authors_text":"Imran Hossain Faruk, Sanjaya Kumar Panda, Sourav Kumar Bhoi","submitted_at":"2014-03-03T08:13:29Z","abstract_excerpt":"Management of disk scheduling is a very important aspect of operating system. Performance of the disk scheduling completely depends on how efficient is the scheduling algorithm to allocate services to the request in a better manner. Many algorithms (FIFO, SSTF, SCAN, C-SCAN, LOOK, etc.) are developed in the recent years in order to optimize the system disk I/O performance. By reducing the average seek time and transfer time, we can improve the performance of disk I/O operation. In our proposed algorithm, Optimize Disk Scheduling Algorithm (ODSA) is taking less average seek time and transfer ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0334","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":"1403.0334","created_at":"2026-05-18T02:57:25.160999+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.0334v1","created_at":"2026-05-18T02:57:25.160999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0334","created_at":"2026-05-18T02:57:25.160999+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TLVZWJLSKI2","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TLVZWJLSKI2PLN4","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TLVZWJL","created_at":"2026-05-18T12:28:16.859392+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/5TLVZWJLSKI2PLN4ENJ7CUFQLC","json":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC.json","graph_json":"https://pith.science/api/pith-number/5TLVZWJLSKI2PLN4ENJ7CUFQLC/graph.json","events_json":"https://pith.science/api/pith-number/5TLVZWJLSKI2PLN4ENJ7CUFQLC/events.json","paper":"https://pith.science/paper/5TLVZWJL"},"agent_actions":{"view_html":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC","download_json":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC.json","view_paper":"https://pith.science/paper/5TLVZWJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.0334&json=true","fetch_graph":"https://pith.science/api/pith-number/5TLVZWJLSKI2PLN4ENJ7CUFQLC/graph.json","fetch_events":"https://pith.science/api/pith-number/5TLVZWJLSKI2PLN4ENJ7CUFQLC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC/action/storage_attestation","attest_author":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC/action/author_attestation","sign_citation":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC/action/citation_signature","submit_replication":"https://pith.science/pith/5TLVZWJLSKI2PLN4ENJ7CUFQLC/action/replication_record"}},"created_at":"2026-05-18T02:57:25.160999+00:00","updated_at":"2026-05-18T02:57:25.160999+00:00"}