{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4MQDFV4SVPA3DYWBVITJNP6Q7P","short_pith_number":"pith:4MQDFV4S","schema_version":"1.0","canonical_sha256":"e32032d792abc1b1e2c1aa2696bfd0fbc1537ba2e503efe0762d0ef2dea4b486","source":{"kind":"arxiv","id":"2607.04821","version":1},"attestation_state":"computed","paper":{"title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Anastasia Papouda, Anna Maria Sidiropoulou, Argyro Gailla, Dimitrios Kontodimos, George Tavridis, Hermione Kimpouropoulou, Kleopatra Kontogianni, Mejgan Dedaj, Michail Panagiotidis Kannas, Sotirios Kontogiannis, Stamatia Kastrinaki, Theofanis Ioannou","submitted_at":"2026-07-06T08:52:20Z","abstract_excerpt":"This study assesses the scalability of process-based and thread-based schedulers for many-core shared-memory systems using a memory-intensive row-wise quick-sort workload on large three-dimensional tensors. The process-based evaluation considers bounded prolific, bounded collective, and three pipe-based producer-consumer schedulers: one-to-one, one-to-many, and many-to-many. These pipe schedulers dynamically stream task identifiers to worker processes, exchanging increased inter-process communication overhead for enhanced runtime load balancing and flexible chunk-based task dispatching. The th"},"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":"2607.04821","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2026-07-06T08:52:20Z","cross_cats_sorted":["cs.PF"],"title_canon_sha256":"99469b2d419e5d0210fd25b4de97c3382497e93806be9932d23566aa7869e5b7","abstract_canon_sha256":"b89188df6ddf0159ff5060a9578d15679bf66958911a0bd048f8373aff923c78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:20:05.371973Z","signature_b64":"S+jMgeJWuDI7IfSszCsi7BusmOqS5qKBp4+QI0EQl9YLGydSu9xN4wMiOZb5bqvqmXzFxu8JXaCijCf+GFJGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e32032d792abc1b1e2c1aa2696bfd0fbc1537ba2e503efe0762d0ef2dea4b486","last_reissued_at":"2026-07-07T02:20:05.370591Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:20:05.370591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance evaluation of scheduling tasks in many-core systems utilizing processes and threads","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.PF"],"primary_cat":"cs.DC","authors_text":"Anastasia Papouda, Anna Maria Sidiropoulou, Argyro Gailla, Dimitrios Kontodimos, George Tavridis, Hermione Kimpouropoulou, Kleopatra Kontogianni, Mejgan Dedaj, Michail Panagiotidis Kannas, Sotirios Kontogiannis, Stamatia Kastrinaki, Theofanis Ioannou","submitted_at":"2026-07-06T08:52:20Z","abstract_excerpt":"This study assesses the scalability of process-based and thread-based schedulers for many-core shared-memory systems using a memory-intensive row-wise quick-sort workload on large three-dimensional tensors. The process-based evaluation considers bounded prolific, bounded collective, and three pipe-based producer-consumer schedulers: one-to-one, one-to-many, and many-to-many. These pipe schedulers dynamically stream task identifiers to worker processes, exchanging increased inter-process communication overhead for enhanced runtime load balancing and flexible chunk-based task dispatching. The th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04821","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.04821/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2607.04821","created_at":"2026-07-07T02:20:05.370748+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04821v1","created_at":"2026-07-07T02:20:05.370748+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04821","created_at":"2026-07-07T02:20:05.370748+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MQDFV4SVPA3","created_at":"2026-07-07T02:20:05.370748+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MQDFV4SVPA3DYWB","created_at":"2026-07-07T02:20:05.370748+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MQDFV4S","created_at":"2026-07-07T02:20:05.370748+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/4MQDFV4SVPA3DYWBVITJNP6Q7P","json":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P.json","graph_json":"https://pith.science/api/pith-number/4MQDFV4SVPA3DYWBVITJNP6Q7P/graph.json","events_json":"https://pith.science/api/pith-number/4MQDFV4SVPA3DYWBVITJNP6Q7P/events.json","paper":"https://pith.science/paper/4MQDFV4S"},"agent_actions":{"view_html":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P","download_json":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P.json","view_paper":"https://pith.science/paper/4MQDFV4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04821&json=true","fetch_graph":"https://pith.science/api/pith-number/4MQDFV4SVPA3DYWBVITJNP6Q7P/graph.json","fetch_events":"https://pith.science/api/pith-number/4MQDFV4SVPA3DYWBVITJNP6Q7P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/action/storage_attestation","attest_author":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/action/author_attestation","sign_citation":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/action/citation_signature","submit_replication":"https://pith.science/pith/4MQDFV4SVPA3DYWBVITJNP6Q7P/action/replication_record"}},"created_at":"2026-07-07T02:20:05.370748+00:00","updated_at":"2026-07-07T02:20:05.370748+00:00"}