{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WXTTVS4PHJJVYK7SD3UWMRZ5WY","short_pith_number":"pith:WXTTVS4P","schema_version":"1.0","canonical_sha256":"b5e73acb8f3a535c2bf21ee966473db61f1cca3e79e723a83327b9ac4d73b952","source":{"kind":"arxiv","id":"1304.7793","version":1},"attestation_state":"computed","paper":{"title":"Co-Scheduling Algorithms for High-Throughput Workload Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anne Benoit, Guillaume Aupy, Manu Shantharam, Padma Raghavan, Yves Robert","submitted_at":"2013-04-29T20:22:27Z","abstract_excerpt":"This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective i"},"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":"1304.7793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-29T20:22:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"296a263b797371b61808ea9220fa617d19cb8c1f5fd96d58b24b8c0f6d20c1a0","abstract_canon_sha256":"ea0eb489b97b19fee276d742d5ea831db08842be272c6347e57fe314b8142229"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:51.847713Z","signature_b64":"MZXmKmvhySIXRD1g7FGDAL4MzskiBbByNoP+TYsJLyQGSbK1Mbdh0pQlkqo20T35y9x1ZTykLJuflNbJ+kK+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5e73acb8f3a535c2bf21ee966473db61f1cca3e79e723a83327b9ac4d73b952","last_reissued_at":"2026-05-18T03:26:51.847251Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:51.847251Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Co-Scheduling Algorithms for High-Throughput Workload Execution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Anne Benoit, Guillaume Aupy, Manu Shantharam, Padma Raghavan, Yves Robert","submitted_at":"2013-04-29T20:22:27Z","abstract_excerpt":"This paper investigates co-scheduling algorithms for processing a set of parallel applications. Instead of executing each application one by one, using a maximum degree of parallelism for each of them, we aim at scheduling several applications concurrently. We partition the original application set into a series of packs, which are executed one by one. A pack comprises several applications, each of them with an assigned number of processors, with the constraint that the total number of processors assigned within a pack does not exceed the maximum number of available processors. The objective i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7793","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":"1304.7793","created_at":"2026-05-18T03:26:51.847327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.7793v1","created_at":"2026-05-18T03:26:51.847327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.7793","created_at":"2026-05-18T03:26:51.847327+00:00"},{"alias_kind":"pith_short_12","alias_value":"WXTTVS4PHJJV","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"WXTTVS4PHJJVYK7S","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"WXTTVS4P","created_at":"2026-05-18T12:28:06.772260+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/WXTTVS4PHJJVYK7SD3UWMRZ5WY","json":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY.json","graph_json":"https://pith.science/api/pith-number/WXTTVS4PHJJVYK7SD3UWMRZ5WY/graph.json","events_json":"https://pith.science/api/pith-number/WXTTVS4PHJJVYK7SD3UWMRZ5WY/events.json","paper":"https://pith.science/paper/WXTTVS4P"},"agent_actions":{"view_html":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY","download_json":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY.json","view_paper":"https://pith.science/paper/WXTTVS4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.7793&json=true","fetch_graph":"https://pith.science/api/pith-number/WXTTVS4PHJJVYK7SD3UWMRZ5WY/graph.json","fetch_events":"https://pith.science/api/pith-number/WXTTVS4PHJJVYK7SD3UWMRZ5WY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/action/storage_attestation","attest_author":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/action/author_attestation","sign_citation":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/action/citation_signature","submit_replication":"https://pith.science/pith/WXTTVS4PHJJVYK7SD3UWMRZ5WY/action/replication_record"}},"created_at":"2026-05-18T03:26:51.847327+00:00","updated_at":"2026-05-18T03:26:51.847327+00:00"}