{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RQH6RGSLYQZSUWHEHZIB3KEA54","short_pith_number":"pith:RQH6RGSL","schema_version":"1.0","canonical_sha256":"8c0fe89a4bc4332a58e43e501da880ef396fe45340e8c86085ccc29099784538","source":{"kind":"arxiv","id":"1604.04471","version":1},"attestation_state":"computed","paper":{"title":"On Dynamic Job Ordering and Slot Configurations for Minimizing the Makespan Of Multiple MapReduce Jobs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Aiguo Chen, Guangchun Luo, Ling Tian, Wenhong Tian","submitted_at":"2016-04-15T12:54:09Z","abstract_excerpt":"MapReduce is a popular parallel computing paradigm for Big Data processing in clusters and data centers. It is observed that different job execution orders and MapReduce slot configurations for a MapReduce workload have significantly different performance with regarding to the makespan, total completion time, system utilization and other performance metrics. There are quite a few algorithms on minimizing makespan of multiple MapReduce jobs. However, these algorithms are heuristic or suboptimal. The best known algorithm for minimizing the makespan is 3-approximation by applying Johnson rule. In"},"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":"1604.04471","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DS","submitted_at":"2016-04-15T12:54:09Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"cab3bdf57ef0a4bb7e2e58c21df87e9cc824a39f238de152f0bae02f12c763c8","abstract_canon_sha256":"0267aefc5ad3fdf80d137471730fa8e736f380124b05cb38f1f4729b12778e5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:02.094344Z","signature_b64":"LgFJ3kYwUsNlPW1jg8kShfMYuyyHjDeE2BmUce8qRQ29CVJQRAESYS/sQEdG/Hdl8tccagOgpzNFRrgglMOeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c0fe89a4bc4332a58e43e501da880ef396fe45340e8c86085ccc29099784538","last_reissued_at":"2026-05-18T01:17:02.093707Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:02.093707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Dynamic Job Ordering and Slot Configurations for Minimizing the Makespan Of Multiple MapReduce Jobs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Aiguo Chen, Guangchun Luo, Ling Tian, Wenhong Tian","submitted_at":"2016-04-15T12:54:09Z","abstract_excerpt":"MapReduce is a popular parallel computing paradigm for Big Data processing in clusters and data centers. It is observed that different job execution orders and MapReduce slot configurations for a MapReduce workload have significantly different performance with regarding to the makespan, total completion time, system utilization and other performance metrics. There are quite a few algorithms on minimizing makespan of multiple MapReduce jobs. However, these algorithms are heuristic or suboptimal. The best known algorithm for minimizing the makespan is 3-approximation by applying Johnson rule. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.04471","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":"1604.04471","created_at":"2026-05-18T01:17:02.093825+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.04471v1","created_at":"2026-05-18T01:17:02.093825+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.04471","created_at":"2026-05-18T01:17:02.093825+00:00"},{"alias_kind":"pith_short_12","alias_value":"RQH6RGSLYQZS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RQH6RGSLYQZSUWHE","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RQH6RGSL","created_at":"2026-05-18T12:30:41.710351+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/RQH6RGSLYQZSUWHEHZIB3KEA54","json":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54.json","graph_json":"https://pith.science/api/pith-number/RQH6RGSLYQZSUWHEHZIB3KEA54/graph.json","events_json":"https://pith.science/api/pith-number/RQH6RGSLYQZSUWHEHZIB3KEA54/events.json","paper":"https://pith.science/paper/RQH6RGSL"},"agent_actions":{"view_html":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54","download_json":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54.json","view_paper":"https://pith.science/paper/RQH6RGSL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.04471&json=true","fetch_graph":"https://pith.science/api/pith-number/RQH6RGSLYQZSUWHEHZIB3KEA54/graph.json","fetch_events":"https://pith.science/api/pith-number/RQH6RGSLYQZSUWHEHZIB3KEA54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54/action/storage_attestation","attest_author":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54/action/author_attestation","sign_citation":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54/action/citation_signature","submit_replication":"https://pith.science/pith/RQH6RGSLYQZSUWHEHZIB3KEA54/action/replication_record"}},"created_at":"2026-05-18T01:17:02.093825+00:00","updated_at":"2026-05-18T01:17:02.093825+00:00"}