Pith Number

pith:43N7W3HX

pith:2026:43N7W3HXHLUKATEF6KLRK2WSPK

not attested not anchored not stored refs resolved

Efficient and Portable Support for Overdecomposition on Distributed Memory GPGPU Platforms

Aditya Bhosale, Anant Jain, Laxmikant Kale, Peddoju Sateesh Kumar, Ritvik Rao, Shourya Goel

Techniques enable efficient overdecomposition on mixed-vendor GPGPU clusters and networks.

arxiv:2605.12734 v1 · 2026-05-12 · cs.DC

Open paper page JSON Open Graph Bundle Merged state Verified badge What is a Pith Number?

Add to your LaTeX paper

\usepackage{pith}
\pithnumber{43N7W3HXHLUKATEF6KLRK2WSPK}

Prints a linked badge after your title and injects PDF metadata. Compiles on arXiv. Learn more · Embed verified badge

Record completeness

1 Bitcoin timestamp

2 Internet Archive

3 Author claim open · sign in to claim

4 Citations open

5 Replications open

✓ Portable graph bundle live · download bundle · merged state

The bundle contains the canonical record plus signed events. A mirror can host it anywhere and recompute the same current state with the deterministic merge algorithm.

Claims

C1strongest claim

We address this issue as well as the issue of portability by developing techniques and software that demonstrate that overdecomposition can be efficiently and productively supported on combinations of GPU vendor types, and interconnection networks.

C2weakest assumption

The higher overhead brought about by overpartitioning on GPGPUs can be mitigated by the developed techniques without losing the utility of overdecomposition.

C3one line summary

Charm++ techniques enable efficient overdecomposition on multi-vendor GPGPU distributed systems.

References

300 extracted · 300 resolved · 0 Pith anchors

[1] Fine-grained automated failure management for extreme-scale gpu accelerated systems 2025 · doi:10.1145/3712285.3759881

[2] and Kale, Laxmikant V

[3] Kokkos: Enabling manycore performance portability through polymorphic memory access patterns 2014 · doi:10.1016/j.jpdc.2014.07.003

[4] and Lelbach, Bryce Adelstein and Amini, Parsa and Berge, Agustín and Biddiscombe, John and Brandt, Steven R 2020 · doi:10.21105/joss.02352

[5] Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis , articleno = 2012

Receipt and verification

First computed	2026-05-18T03:09:49.202829Z
Builder	pith-number-builder-2026-05-17-v1
Signature	Pith Ed25519 (`pith-v1-2026-05`) · public key
Schema	pith-number/v1.0

Canonical hash

e6dbfb6cf73ae8a04c85f297156ad27aa8e222b1f5978fd7b430df0b7a350cc3

Aliases

arxiv: 2605.12734 · arxiv_version: 2605.12734v1 · doi: 10.48550/arxiv.2605.12734 · pith_short_12: 43N7W3HXHLUK · pith_short_16: 43N7W3HXHLUKATEF · pith_short_8: 43N7W3HX

Agent API

Resolver JSON Graph JSON Events JSON Schema Signing key

Verify this Pith Number yourself

curl -sH 'Accept: application/ld+json' https://pith.science/pith/43N7W3HXHLUKATEF6KLRK2WSPK \
  | jq -c '.canonical_record' \
  | python3 -c "import sys,json,hashlib; b=json.dumps(json.loads(sys.stdin.read()), sort_keys=True, separators=(',',':'), ensure_ascii=False).encode(); print(hashlib.sha256(b).hexdigest())"
# expect: e6dbfb6cf73ae8a04c85f297156ad27aa8e222b1f5978fd7b430df0b7a350cc3

Canonical record JSON

{
  "metadata": {
    "abstract_canon_sha256": "c35f691e42dd01c8887def4233b2dbca0efda75a73b7d47ddf3598f81c581885",
    "cross_cats_sorted": [],
    "license": "http://creativecommons.org/licenses/by/4.0/",
    "primary_cat": "cs.DC",
    "submitted_at": "2026-05-12T20:37:44Z",
    "title_canon_sha256": "28c7794ecab77e26baba15e7d3fd083118fb5d24346e2a8c08e389c1cc3ed9f5"
  },
  "schema_version": "1.0",
  "source": {
    "id": "2605.12734",
    "kind": "arxiv",
    "version": 1
  }
}