Guaranteeing Service Level Agreements for Triangle Counting via Observation-based Admission Control Algorithm
Chinthaka Weerakkody, Miyuru Dayarathna, Sanath Jayasena, Toyotaro Suzumura · 2022
Maintaining guaranteed service level agreements on distributed graph processing for concurrent query execution is challenging because graph processing by nature is an unbalanced problem. In this paper we investigate on maintaining predefined service level agreements for graph processing workload mixtures taking triangle counting as the example. We develop a Graph Query Scheduler Mechanism (GQSM) which maintains a guaranteed service level agreement in terms of overall latency on top of JasmineGraph distributed graph database server. The proposed GQSM model is implemented using the queuing theory. Main component of GQSM is a job scheduler which is responsible for listening to an incoming job queue and scheduling the jobs received. The proposed model has a calibration phase where the Service Level Agreement (SLA) data, load average curve data, and maximum load average which can be handled by the hosts participating in the cluster without violating SLA is captured for the graphs in the system. Results show that for a single host system the SLA is successfully maintained when the total number of users is less than 6.