{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LT7GOADHDWZERYTDLHR6HFH7OB","short_pith_number":"pith:LT7GOADH","schema_version":"1.0","canonical_sha256":"5cfe6700671db248e26359e3e394ff70733ef1ed3f8ef6fa7659090ed644e380","source":{"kind":"arxiv","id":"1807.00851","version":1},"attestation_state":"computed","paper":{"title":"On Non-Preemptive VM Scheduling in the Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Javad Ghaderi, Konstantinos Psychas","submitted_at":"2018-07-02T18:27:28Z","abstract_excerpt":"We study the problem of scheduling VMs (Virtual Machines) in a distributed server platform, motivated by cloud computing applications. The VMs arrive dynamically over time to the system, and require a certain amount of resources (e.g. memory, CPU, etc) for the duration of their service. To avoid costly preemptions, we consider non-preemptive scheduling: Each VM has to be assigned to a server which has enough residual capacity to accommodate it, and once a VM is assigned to a server, its service \\textit{cannot} be disrupted (preempted). Prior approaches to this problem either have high complexi"},"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":"1807.00851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-07-02T18:27:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"23ffaefcded6d1e151a3cda1d8020b2489af1752c3875451b188d384d81ab0b1","abstract_canon_sha256":"ac30a1e1a78b0f9cfb6b4e0f8afecf3a72b9a1851606835ac54f8a6fb6e8b176"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:46.253101Z","signature_b64":"+5A/Zp6ywav4lAd69fBBfsHNckdw4g0NllNWhSzqmWxxHY51cFRiKYjC1eyXeW+Tru8nLQKbcTD0mxmvK9eAAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cfe6700671db248e26359e3e394ff70733ef1ed3f8ef6fa7659090ed644e380","last_reissued_at":"2026-05-18T00:11:46.252427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:46.252427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Non-Preemptive VM Scheduling in the Cloud","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.NI","authors_text":"Javad Ghaderi, Konstantinos Psychas","submitted_at":"2018-07-02T18:27:28Z","abstract_excerpt":"We study the problem of scheduling VMs (Virtual Machines) in a distributed server platform, motivated by cloud computing applications. The VMs arrive dynamically over time to the system, and require a certain amount of resources (e.g. memory, CPU, etc) for the duration of their service. To avoid costly preemptions, we consider non-preemptive scheduling: Each VM has to be assigned to a server which has enough residual capacity to accommodate it, and once a VM is assigned to a server, its service \\textit{cannot} be disrupted (preempted). Prior approaches to this problem either have high complexi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.00851","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":"1807.00851","created_at":"2026-05-18T00:11:46.252543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.00851v1","created_at":"2026-05-18T00:11:46.252543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.00851","created_at":"2026-05-18T00:11:46.252543+00:00"},{"alias_kind":"pith_short_12","alias_value":"LT7GOADHDWZE","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LT7GOADHDWZERYTD","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LT7GOADH","created_at":"2026-05-18T12:32:37.024351+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/LT7GOADHDWZERYTDLHR6HFH7OB","json":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB.json","graph_json":"https://pith.science/api/pith-number/LT7GOADHDWZERYTDLHR6HFH7OB/graph.json","events_json":"https://pith.science/api/pith-number/LT7GOADHDWZERYTDLHR6HFH7OB/events.json","paper":"https://pith.science/paper/LT7GOADH"},"agent_actions":{"view_html":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB","download_json":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB.json","view_paper":"https://pith.science/paper/LT7GOADH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.00851&json=true","fetch_graph":"https://pith.science/api/pith-number/LT7GOADHDWZERYTDLHR6HFH7OB/graph.json","fetch_events":"https://pith.science/api/pith-number/LT7GOADHDWZERYTDLHR6HFH7OB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB/action/storage_attestation","attest_author":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB/action/author_attestation","sign_citation":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB/action/citation_signature","submit_replication":"https://pith.science/pith/LT7GOADHDWZERYTDLHR6HFH7OB/action/replication_record"}},"created_at":"2026-05-18T00:11:46.252543+00:00","updated_at":"2026-05-18T00:11:46.252543+00:00"}