BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
X-LIC-LOCATION:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260402T024533Z
LOCATION:Level 3 Lobby
DTSTART;TZID=America/Los_Angeles:20250622T180000
DTEND;TZID=America/Los_Angeles:20250622T190000
UID:dac_DAC 2025_sess261_RESEARCH929@linklings.com
SUMMARY:A Scalable Two-Step Approach to Optimize Data and Energy Migration
 s in Mini Data Centers for Carbon-Neutral Computing
DESCRIPTION:Kazuki Okazawa, Hiroki Nishikawa, Dafang Zhao, Ittetsu Taniguc
 hi, and Takao Onoye (The University of Osaka); Marcos da Silva (Independen
 t Researcher); and Abdoulaye Gamatie (LIRMM / CNRS)\n\nAs energy demands i
 n cloud computing surge, efficient task scheduling and carbon-free energy 
 use in mini data centers is essential. Solving scheduling problems with mi
 xed-integer linear programming optimization methods is computationally int
 ensive and less scalable. This paper proposes a two-step approach combinin
 g a greedy algorithm with linear programming to optimize virtual machines 
 scheduling and energy management. We show via simulations that our method 
 preserves solution quality, while accelerating the calculation process by 
 99.6%. While the literature method requires 6 hours to solve a reference s
 ystem design, our solution handles 18 times larger designs in 20 minutes o
 nly, demonstrating its scalability.\n\nTracks: DES5: Emerging Device and I
 nterconnect Technologies\n\n
END:VEVENT
END:VCALENDAR