{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:VU43BM4ETODFXEQRJ6ON4FOGKE","short_pith_number":"pith:VU43BM4E","canonical_record":{"source":{"id":"1402.6601","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2014-02-26T16:37:01Z","cross_cats_sorted":[],"title_canon_sha256":"f9ca6227964fa0e76d1ed9a31ae72d2bb1352748d1a2d63d0b29a084eb8ff5a4","abstract_canon_sha256":"44d45273eafe8abf20bb45ed5dbabdc87f3831e41521b3274cd3e63c7db2e663"},"schema_version":"1.0"},"canonical_sha256":"ad39b0b3849b865b92114f9cde15c6510ce27385560b5ab4548706080c30beb5","source":{"kind":"arxiv","id":"1402.6601","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6601","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6601v2","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6601","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"VU43BM4ETODF","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VU43BM4ETODFXEQR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VU43BM4E","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:VU43BM4ETODFXEQRJ6ON4FOGKE","target":"record","payload":{"canonical_record":{"source":{"id":"1402.6601","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2014-02-26T16:37:01Z","cross_cats_sorted":[],"title_canon_sha256":"f9ca6227964fa0e76d1ed9a31ae72d2bb1352748d1a2d63d0b29a084eb8ff5a4","abstract_canon_sha256":"44d45273eafe8abf20bb45ed5dbabdc87f3831e41521b3274cd3e63c7db2e663"},"schema_version":"1.0"},"canonical_sha256":"ad39b0b3849b865b92114f9cde15c6510ce27385560b5ab4548706080c30beb5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:28.376249Z","signature_b64":"pffEKXWCQlkncNFWwm1dRM7CX7+7KAfF231L8mNSgLRJkzCuM6F/nwg26S9MbT0QbQg8Lq8L1C2zfsaOeaXDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad39b0b3849b865b92114f9cde15c6510ce27385560b5ab4548706080c30beb5","last_reissued_at":"2026-05-18T02:42:28.375363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:28.375363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.6601","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sv1XRfUgL/3YSZ8MV99swFfpvQuJNRd8u5UjnINRTRymXamjPYjNLIflXCDtcsCvG0bN29l/x2DyI27YtGwIBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:26:51.138536Z"},"content_sha256":"094a3b87c6cfb544cbb3d8a8a6cf5164bbc8825455e5e12805e281e2169afc29","schema_version":"1.0","event_id":"sha256:094a3b87c6cfb544cbb3d8a8a6cf5164bbc8825455e5e12805e281e2169afc29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:VU43BM4ETODFXEQRJ6ON4FOGKE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scheduling data flow program in xkaapi: A new affinity based Algorithm for Heterogeneous Architectures","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Denis Trystram, Gr\\'egory Mouni\\'e, Jo\\~ao V. F. Lima, Rapha\\\"el Bleuse, Thierry Gautier","submitted_at":"2014-02-26T16:37:01Z","abstract_excerpt":"Efficient implementations of parallel applications on heterogeneous hybrid architectures require a careful balance between computations and communications with accelerator devices. Even if most of the communication time can be overlapped by computations, it is essential to reduce the total volume of communicated data. The literature therefore abounds with ad-hoc methods to reach that balance, but that are architecture and application dependent. We propose here a generic mechanism to automatically optimize the scheduling between CPUs and GPUs, and compare two strategies within this mechanism: t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6601","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:42:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eusTSO9Ji4OSVRlc8JSosWtZiRGLeIU0Dcnso6gAJSIXsEZEfK0mFIGyQxJJgwC84mCK0jJc5aQNruAWoBUTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T21:26:51.139272Z"},"content_sha256":"4e1425512f662c4d0432c954fd8cc37f49d2c59e7a0d830987033064a4f0c0d0","schema_version":"1.0","event_id":"sha256:4e1425512f662c4d0432c954fd8cc37f49d2c59e7a0d830987033064a4f0c0d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VU43BM4ETODFXEQRJ6ON4FOGKE/bundle.json","state_url":"https://pith.science/pith/VU43BM4ETODFXEQRJ6ON4FOGKE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VU43BM4ETODFXEQRJ6ON4FOGKE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T21:26:51Z","links":{"resolver":"https://pith.science/pith/VU43BM4ETODFXEQRJ6ON4FOGKE","bundle":"https://pith.science/pith/VU43BM4ETODFXEQRJ6ON4FOGKE/bundle.json","state":"https://pith.science/pith/VU43BM4ETODFXEQRJ6ON4FOGKE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VU43BM4ETODFXEQRJ6ON4FOGKE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:VU43BM4ETODFXEQRJ6ON4FOGKE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"44d45273eafe8abf20bb45ed5dbabdc87f3831e41521b3274cd3e63c7db2e663","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2014-02-26T16:37:01Z","title_canon_sha256":"f9ca6227964fa0e76d1ed9a31ae72d2bb1352748d1a2d63d0b29a084eb8ff5a4"},"schema_version":"1.0","source":{"id":"1402.6601","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.6601","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"arxiv_version","alias_value":"1402.6601v2","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.6601","created_at":"2026-05-18T02:42:28Z"},{"alias_kind":"pith_short_12","alias_value":"VU43BM4ETODF","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"VU43BM4ETODFXEQR","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"VU43BM4E","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:4e1425512f662c4d0432c954fd8cc37f49d2c59e7a0d830987033064a4f0c0d0","target":"graph","created_at":"2026-05-18T02:42:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Efficient implementations of parallel applications on heterogeneous hybrid architectures require a careful balance between computations and communications with accelerator devices. Even if most of the communication time can be overlapped by computations, it is essential to reduce the total volume of communicated data. The literature therefore abounds with ad-hoc methods to reach that balance, but that are architecture and application dependent. We propose here a generic mechanism to automatically optimize the scheduling between CPUs and GPUs, and compare two strategies within this mechanism: t","authors_text":"Denis Trystram, Gr\\'egory Mouni\\'e, Jo\\~ao V. F. Lima, Rapha\\\"el Bleuse, Thierry Gautier","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2014-02-26T16:37:01Z","title":"Scheduling data flow program in xkaapi: A new affinity based Algorithm for Heterogeneous Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.6601","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:094a3b87c6cfb544cbb3d8a8a6cf5164bbc8825455e5e12805e281e2169afc29","target":"record","created_at":"2026-05-18T02:42:28Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"44d45273eafe8abf20bb45ed5dbabdc87f3831e41521b3274cd3e63c7db2e663","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"cs.DC","submitted_at":"2014-02-26T16:37:01Z","title_canon_sha256":"f9ca6227964fa0e76d1ed9a31ae72d2bb1352748d1a2d63d0b29a084eb8ff5a4"},"schema_version":"1.0","source":{"id":"1402.6601","kind":"arxiv","version":2}},"canonical_sha256":"ad39b0b3849b865b92114f9cde15c6510ce27385560b5ab4548706080c30beb5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad39b0b3849b865b92114f9cde15c6510ce27385560b5ab4548706080c30beb5","first_computed_at":"2026-05-18T02:42:28.375363Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:28.375363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pffEKXWCQlkncNFWwm1dRM7CX7+7KAfF231L8mNSgLRJkzCuM6F/nwg26S9MbT0QbQg8Lq8L1C2zfsaOeaXDDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:28.376249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.6601","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:094a3b87c6cfb544cbb3d8a8a6cf5164bbc8825455e5e12805e281e2169afc29","sha256:4e1425512f662c4d0432c954fd8cc37f49d2c59e7a0d830987033064a4f0c0d0"],"state_sha256":"bbfffc25000f71966c1417aa741ddac2a95dd153c17bee6f4e148da1005b853a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SmieexD9gattsRlf15NhnGDoI7w6uGnswGjYqAQ3lwaOIkFHFJt/dDvsIo7/T9tYJ5/fa7Xq+PUudhsciI6TCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T21:26:51.145956Z","bundle_sha256":"4889e701f58dceacf5070fba2d4922a7014b9019d12a43a7563d0a25d73dbaa2"}}