HOHiroto Oshima

Hiroto Oshima

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hiroto Oshima has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Joint Optimization of Data Placement and Task Scheduling for Distributed Green Data Centers With Optical Satellite Networks

    by Hiroto Oshima, Hiroaki Hashida, Yuichi Kawamoto, Nei Kato, Kazushi Sugyo, Yohei Hasegawa, Masayuki Ariyoshi

    Distributed green data centers powered by renewable energy have garnered considerable attention owing to their potential to enhance both sustainability and disaster resilience. To interconnect these geographically dispersed sites, low-Earth orbit satellite optical communications offer a promising solution, providing low-latency and high-bandwidth connectivity. However, the efficient operation of such a system hinges on a comprehensive task scheduling strategy that addresses two critical factors: task assignment—determining which data center should process each task—and processor performance control—regulating the operational speed of each processor. The effectiveness of this strategy is deeply intertwined with data placement decisions, as the location of stored data directly influences the set of data centers eligible to execute specific tasks. Optimizing this system is particularly challenging owing to the inherent variability in two primary factors: the availability of renewable energy and the quality of satellite communication links, both of which fluctuate with weather. To address these challenges, this study proposes a framework for the joint optimization of data placement and task scheduling. The proposed approach simultaneously considers fluctuating communication and power resources to maximize user task satisfaction. The problem is formulated as a mixed-integer nonlinear programming problem, and efficient solutions are obtained through computationally efficient alternating optimization algorithms. The proposed method significantly enhances task satisfaction rates compared with conventional approaches that optimize data placement and task scheduling in isolation, particularly under heterogeneous task distributions and adverse weather conditions, demonstrating its robustness and adaptability.