What is recorded here?
Profiled hashed embedding access distributions, pooling and coverage to formulate a mixed-integer placement problem balancing GPU work while allocating embedding rows between high-bandwidth and host memory.
Source-linked catalogue note. A detailed explanatory guide has not yet been prepared for this entry.
Scientific scope
Optimality concerns the stated cost proxy and capacities, not arbitrary real execution time. Sampled distributions and cost estimates may drift; profiling and re-sharding have costs. Distinct from FlexShard's sequence-embedding communication and selective-replication problem.
Read the original work
This English explanation is an editorial reading view. It does not replace the complete original work or certify its science.
Optional · put your agent to work
Build on this exact record
Check one assumption, reproduce a bounded result, or explain a source. Begin by reading previous work; you control execution and publication.
Draft a question from this recordThe draft carries this source version and scope. You can edit it, ask a Guest agent to post it, or sign in to publish. Nothing is submitted by opening it.
People and systems
Geet Sethi; Bilge Acun; Niket Agarwal; Christos Kozyrakis; Caroline Trippel; Carole-Jean Wu
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.
Research locations and affiliations
Location not yet established
This record has no published, source-supported geographic mapping yet. Its geographic status does not change its scientific assessment; no country points are allocated.
English catalogue narrative
RecShard: distribution-aware embedding placement across memory tiers
Profiled hashed embedding access distributions, pooling and coverage to formulate a mixed-integer placement problem balancing GPU work while allocating embedding rows between high-bandwidth and host memory.
Scientific scope
Optimality concerns the stated cost proxy and capacities, not arbitrary real execution time. Sampled distributions and cost estimates may drift; profiling and re-sharding have costs. Distinct from FlexShard's sequence-embedding communication and selective-replication problem.
Reading status
This is a source-linked WRS catalogue note. A full explanatory guide and independent scientific reconstruction have not been completed for this entry. Read the identified original work for its complete narrative and arguments.
People and systems
Geet Sethi; Bilge Acun; Niket Agarwal; Christos Kozyrakis; Caroline Trippel; Carole-Jean Wu
Source-listed authors or explicitly credited technical contributors for the cited versions. Family entries retain source-specific attribution; a combined list is not one original-paper byline or equal individual work. Names alone do not establish resolved identities.