Scheduling in the Presence of Data Intensive Compute Jobs

Behrouzi-Far, Amir; Soljanin, Emina

doi:10.1109/bigdata47090.2019.9006369

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…2) Write requests: It has been shown that the random write latency in distributed storage systems, can be well modeled by shifted exponential distribution [4], [9], [10], [35], [36]. The shifted exponential distribution can be approximated to an exponential distribution when the constant shift is much smaller than the mean of the distribution.…”

Section: Execution Of Read/write Requestsmentioning

confidence: 99%

Latency-Redundancy Tradeoff in Distributed Read-Write Systems

Ramanathan,

Gautam,

Srinivasan

et al. 2021

Preprint

View full text Add to dashboard Cite

Data is replicated and stored redundantly over multiple servers for availability in distributed databases. We focus on databases with frequent reads and writes, where both read and write latencies are important. This is in contrast to databases designed primarily for either read or write applications. Redundancy has contrasting effects on read and write latency. Read latency can be reduced by potential parallel access from multiple servers, whereas write latency increases as a larger number of replicas have to be updated. We quantify this tradeoff between read and write latency as a function of redundancy, and provide a closed-form approximation when the request arrival is Poisson and the service is memoryless. We empirically show that this approximation is tight across all ranges of system parameters. Thus, we provide guidelines for redundancy selection in distributed databases. 2 https://www.business-standard.com/company/st-bk-of-india-1375/annual-report/director-report 3

show abstract