{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XH7Y5QJQSJCW5TM7ILJS6OTE7C","short_pith_number":"pith:XH7Y5QJQ","schema_version":"1.0","canonical_sha256":"b9ff8ec13092456ecd9f42d32f3a64f885f463206a01114133ed09ee33928de3","source":{"kind":"arxiv","id":"1707.01655","version":1},"attestation_state":"computed","paper":{"title":"Online Job Scheduling with Redundancy and Opportunistic Checkpointing: A Speedup-Function-Based Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gustavo de Veciana, Huanle Xu, Kunxiao Zhou, Wing Cheong Lau","submitted_at":"2017-07-06T06:50:47Z","abstract_excerpt":"In a large-scale computing cluster, the job completions can be substantially delayed due to two sources of variability, namely, variability in the job size and that in the machine service capacity. To tackle this issue, existing works have proposed various scheduling algorithms which exploit redundancy wherein a job runs on multiple servers until the first completes. In this paper, we explore the impact of variability in the machine service capacity and adopt a rigorous analytical approach to design scheduling algorithms using redundancy and checkpointing. We design several online scheduling a"},"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":"1707.01655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-07-06T06:50:47Z","cross_cats_sorted":[],"title_canon_sha256":"b5ba2080d80e3a53322f289b5b27d7aaf75db15bc5a409118719b0a927f5ee6b","abstract_canon_sha256":"33af3c006d460c72fbbba4440a838a0b99962e1ac1840e09ea85b53afff659c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:47.924037Z","signature_b64":"VeSEd4VcmBUVq9rS75pxbvcg51LQ/1c/NLEDveCiSPEW2LSf2/lEDz3ihI5v9EU0/9GZItIxeB6q2hXPIKb+DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9ff8ec13092456ecd9f42d32f3a64f885f463206a01114133ed09ee33928de3","last_reissued_at":"2026-05-18T00:40:47.923356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:47.923356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Job Scheduling with Redundancy and Opportunistic Checkpointing: A Speedup-Function-Based Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Gustavo de Veciana, Huanle Xu, Kunxiao Zhou, Wing Cheong Lau","submitted_at":"2017-07-06T06:50:47Z","abstract_excerpt":"In a large-scale computing cluster, the job completions can be substantially delayed due to two sources of variability, namely, variability in the job size and that in the machine service capacity. To tackle this issue, existing works have proposed various scheduling algorithms which exploit redundancy wherein a job runs on multiple servers until the first completes. In this paper, we explore the impact of variability in the machine service capacity and adopt a rigorous analytical approach to design scheduling algorithms using redundancy and checkpointing. We design several online scheduling a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.01655","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":"1707.01655","created_at":"2026-05-18T00:40:47.923477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.01655v1","created_at":"2026-05-18T00:40:47.923477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.01655","created_at":"2026-05-18T00:40:47.923477+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH7Y5QJQSJCW","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH7Y5QJQSJCW5TM7","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH7Y5QJQ","created_at":"2026-05-18T12:31:53.515858+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/XH7Y5QJQSJCW5TM7ILJS6OTE7C","json":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C.json","graph_json":"https://pith.science/api/pith-number/XH7Y5QJQSJCW5TM7ILJS6OTE7C/graph.json","events_json":"https://pith.science/api/pith-number/XH7Y5QJQSJCW5TM7ILJS6OTE7C/events.json","paper":"https://pith.science/paper/XH7Y5QJQ"},"agent_actions":{"view_html":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C","download_json":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C.json","view_paper":"https://pith.science/paper/XH7Y5QJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.01655&json=true","fetch_graph":"https://pith.science/api/pith-number/XH7Y5QJQSJCW5TM7ILJS6OTE7C/graph.json","fetch_events":"https://pith.science/api/pith-number/XH7Y5QJQSJCW5TM7ILJS6OTE7C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C/action/storage_attestation","attest_author":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C/action/author_attestation","sign_citation":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C/action/citation_signature","submit_replication":"https://pith.science/pith/XH7Y5QJQSJCW5TM7ILJS6OTE7C/action/replication_record"}},"created_at":"2026-05-18T00:40:47.923477+00:00","updated_at":"2026-05-18T00:40:47.923477+00:00"}