Pith. sign in

REVIEW 1 cited by

Towards Fast Setup and High Throughput of GPU Serverless Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.14691 v1 pith:CCCNRJSX submitted 2024-04-23 cs.DC

classification cs.DC
keywords functionsageserverlesssetupmemorythroughputcomputingdata
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Integrating GPUs into serverless computing platforms is crucial for improving efficiency. However, existing solutions for GPU-enabled serverless computing platforms face two significant problems due to coarse-grained GPU management: long setup time and low function throughput. To address these issues, we propose SAGE, a GPU serverless framework with fast setup and high throughput. First, based on the data knowability of GPU function ahead of actual execution, SAGE first devises the parallelized function setup mechanism, which parallelizes the data preparation and context creation. In this way, SAGE achieves fast setup of GPU function invocations.Second, SAGE further proposes the sharing-based memory management mechanism, which shares the read-only memory and context memory across multiple invocations of the same function. The memory sharing mechanism avoids repeated data preparation and then unnecessary data-loading contention. As a consequence, the function throughput could be improved. Our experimental results show that SAGE reduces function duration by 11.3X and improves function density by 1.22X compared to the state-of-the-art serverless platform.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MQFQ-Sticky: Fair Queueing For Serverless GPU Functions

    cs.DC 2025-07 conditional novelty 6.0 of 10

    MQFQ-Sticky applies multi-queue fair queuing and anticipatory scheduling to GPU serverless functions, reporting 2x-20x latency reductions and fairer GPU service than FCFS, batching, or SJF policies.

Pith tools