BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260422T000713Z
LOCATION:403-404
DTSTART;TZID=America/Denver:20231114T140000
DTEND;TZID=America/Denver:20231114T143000
UID:submissions.supercomputing.org_SC23_sess165_pap372@linklings.com
SUMMARY:Graph3PO: A Temporal Graph Data Processing Method for Latency QoS 
 Guarantee in Object Cloud Storage System
DESCRIPTION:Wang Zhang, Zhan Shi, Ziyi Liao, and Yiling Li (Huazhong Unive
 rsity of Science and Technology (HUST)); Yu Du (Alibaba Group); and Yutong
  Wu, Fang Wang, and Dan Feng (Huazhong University of Science and Technolog
 y (HUST))\n\nObject cloud storage systems are deployed with diverse applic
 ations that have varying latency service level objectives (SLOs), posting 
 challenges for supporting quality of service with limited storage resource
 s. Existing methods provide prediction-based recommendations for dispatchi
 ng requests from applications to storage devices, but the prediction accur
 acy can be affected by complex system topology. To address this issue, Gra
 ph3PO is designed to combine storage device queue information with system 
 topological information for forming a temporal graph, which can accurately
  predict device queue states. Additionally, Graph3PO contains the urgency 
 degree model and cost model for measuring SLO violation risks and penaltie
 s of scheduling requests on storage device queues. When the urgency degree
  of a request exceeds a threshold, Graph3PO determines whether to schedule
  it in the queue or initiate a hedge request to another storage device. Ex
 perimental results show that Graph3PO outperforms its competitors, with SL
 O violation rates 2.8 to 201.1 times lower.\n\nTag: Cloud Computing, Data 
 Analysis, Visualization, and Storage, Graph Algorithms and Frameworks\n\nR
 egistration Category: Tech Program Reg Pass\n\nAward Finalist: Best Paper 
 Finalist\n\nReproducibility Badges: Artifact Available, Artifact Functiona
 l, Results Reproduced\n\nSession Chair: Kasimir Gabert (Sandia National La
 boratories)\n\n
END:VEVENT
END:VCALENDAR