A Model of Job Parallelism for Latency Reduction in Large-Scale Systems

03/16/2022
by   Ayalvadi Ganesh, et al.
0

Processing computation-intensive jobs at multiple processing cores in parallel is essential in many real-world applications. In this paper, we consider an idealised model for job parallelism in which a job can be served simultaneously by d distinct servers. The job is considered complete when the total amount of work done on it by the d servers equals its size. We study the effect of parallelism on the average delay of jobs. Specifically, we analyze a system consisting of n parallel processor sharing servers in which jobs arrive according to a Poisson process of rate n λ (λ <1) and each job brings an exponentially distributed amount of work with unit mean. Upon arrival, a job selects d servers uniformly at random and joins all the chosen servers simultaneously. We show by a mean-field analysis that, for fixed d ≥ 2 and large n, the average occupancy of servers is O(log (1/(1-λ))) as λ→ 1 in comparison to O(1/(1-λ)) average occupancy for d=1. Thus, we obtain an exponential reduction in the response time of jobs through parallelism. We make significant progress towards rigorously justifying the mean-field analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/24/2021

Comparison of the FCFS and PS discipline in Redundancy Systems

We consider the c.o.c. redundancy system with N parallel servers where i...
research
10/31/2018

Randomized Work Stealing versus Sharing in Large-scale Systems with Non-exponential Job Sizes

Work sharing and work stealing are two scheduling paradigms to redistrib...
research
01/27/2022

Queueing Systems with Some Versions of Limited Processor Sharing Discipline

The paper considers a queueing system with limited processor sharing. No...
research
09/20/2020

On the Throughput Optimization in Large-Scale Batch-Processing Systems

We analyze a data-processing system with n clients producing jobs which ...
research
06/19/2020

Large-scale parallel server system with multi-component jobs

A broad class of parallel server systems is considered, for which we pro...
research
04/05/2020

Achieving Zero Asymptotic Queueing Delay for Parallel Jobs

Zero queueing delay is highly desirable in large-scale computing systems...
research
08/14/2019

Resolvable Designs for Speeding up Distributed Computing

Distributed computing frameworks such as MapReduce are often used to pro...

Please sign up or login with your details

Forgot password? Click here to reset