{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2SZEOAFKJNJ75PEOTSB52PJD4X","short_pith_number":"pith:2SZEOAFK","schema_version":"1.0","canonical_sha256":"d4b24700aa4b53febc8e9c83dd3d23e5d956bf1e609e44ddd1c13f324ad54fdc","source":{"kind":"arxiv","id":"1902.05746","version":1},"attestation_state":"computed","paper":{"title":"Optimizing the SSD Burst Buffer by Traffic Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hai Jin, Ligang He, Ming Li, Wei Liu, Xuanhua Shi, Yong Chen","submitted_at":"2019-02-15T10:04:05Z","abstract_excerpt":"Currently, Burst buffer has been proposed to manage the SSD buffering of bursty write requests. Although burst buffer can improve I/O performance in many cases, we find that it has some limitations such as requiring large SSD capacity and harmonious overlapping between computation phase and data flushing phase. In this paper, we propose a scheme, called SSDUP+1. SSDUP+ aims to improve the burst buffer by addressing the above limitations. First, in order to reduce the demand for the SSD capacity, we develop a novel method to detect and quantify the data randomness in the write traffic. Further,"},"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":"1902.05746","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-02-15T10:04:05Z","cross_cats_sorted":[],"title_canon_sha256":"7a3a50a355b4961bca45626921abb7ac57cb43a9dd49d86c6db3edd2b6136cc7","abstract_canon_sha256":"ecae374ef09566249915c014657b7689f3722bd640a19dcc726ac8af64a00557"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:56.268913Z","signature_b64":"rb35pYcnvVjEggrjclbDw2JI0Snmigpl4bdwed66AeL1551m5fajayEhGYCmk1rv+GZJ2Bm8TwkmPqiAsmdQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4b24700aa4b53febc8e9c83dd3d23e5d956bf1e609e44ddd1c13f324ad54fdc","last_reissued_at":"2026-05-17T23:53:56.268222Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:56.268222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing the SSD Burst Buffer by Traffic Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Hai Jin, Ligang He, Ming Li, Wei Liu, Xuanhua Shi, Yong Chen","submitted_at":"2019-02-15T10:04:05Z","abstract_excerpt":"Currently, Burst buffer has been proposed to manage the SSD buffering of bursty write requests. Although burst buffer can improve I/O performance in many cases, we find that it has some limitations such as requiring large SSD capacity and harmonious overlapping between computation phase and data flushing phase. In this paper, we propose a scheme, called SSDUP+1. SSDUP+ aims to improve the burst buffer by addressing the above limitations. First, in order to reduce the demand for the SSD capacity, we develop a novel method to detect and quantify the data randomness in the write traffic. Further,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05746","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":"1902.05746","created_at":"2026-05-17T23:53:56.268333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.05746v1","created_at":"2026-05-17T23:53:56.268333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05746","created_at":"2026-05-17T23:53:56.268333+00:00"},{"alias_kind":"pith_short_12","alias_value":"2SZEOAFKJNJ7","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2SZEOAFKJNJ75PEO","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2SZEOAFK","created_at":"2026-05-18T12:33:07.085635+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/2SZEOAFKJNJ75PEOTSB52PJD4X","json":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X.json","graph_json":"https://pith.science/api/pith-number/2SZEOAFKJNJ75PEOTSB52PJD4X/graph.json","events_json":"https://pith.science/api/pith-number/2SZEOAFKJNJ75PEOTSB52PJD4X/events.json","paper":"https://pith.science/paper/2SZEOAFK"},"agent_actions":{"view_html":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X","download_json":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X.json","view_paper":"https://pith.science/paper/2SZEOAFK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.05746&json=true","fetch_graph":"https://pith.science/api/pith-number/2SZEOAFKJNJ75PEOTSB52PJD4X/graph.json","fetch_events":"https://pith.science/api/pith-number/2SZEOAFKJNJ75PEOTSB52PJD4X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X/action/storage_attestation","attest_author":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X/action/author_attestation","sign_citation":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X/action/citation_signature","submit_replication":"https://pith.science/pith/2SZEOAFKJNJ75PEOTSB52PJD4X/action/replication_record"}},"created_at":"2026-05-17T23:53:56.268333+00:00","updated_at":"2026-05-17T23:53:56.268333+00:00"}