Pith. sign in

REVIEW 3 major objections 6 minor 138 references

Task Scheduling in Geo-Distributed Computing: A Survey

T0 review · 3 major / 6 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This survey contends that task scheduling across geo-distributed cloud, edge, cloud-edge, and supercomputer systems can be usefully classified by a two-axis taxonomy of environment and objective, and that this map exposes where research…

desk verdict Plausible taxonomy and broad coverage, but the HPC pillar inflates the corpus with non-geo-distributed schedulers and the survey lacks a documented selection method, so 'comprehensive' is doing too much work. read the letter →

arxiv 2501.15504 v1 pith:TL5WZMK5 submitted 2025-01-26 cs.DC

Yujian Wu , Shanjiang Tang , Ce Yu , Bin Yang , Chao Sun , Jian Xiao , Hutong Wu This is my paper · ORCID
classification cs.DC
keywords Geo-DistributedTaskschedulingWorkflowOptimizationEdgecomputingCloud-edgeHPCobjectives
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper is a survey that aims to give researchers a complete map of task scheduling in geo-distributed computing, covering four settings: cloud data centers spread across regions, edge networks, cloud-edge collaborations, and geographically distributed supercomputers. The authors' central claim is that every existing scheduling method in these settings can be classified by environment and by the objective it targets—performance, fairness, or fault tolerance—and that doing so reveals where the field is concentrated and where it is thin. If the map is right, a researcher entering the area can quickly locate the relevant technique family for their problem and see which objectives and environments remain underserved. The survey also argues that previous reviews missed the HPC and supercomputer case, and that emerging workloads and new hardware are the key open challenges.

What carries the argument

The load-bearing mechanism is the two-axis taxonomy: environment (geo-distributed cloud, edge, cloud-edge, geo-distributed supercomputer) crossed with scheduling objective (performance, fairness, fault tolerance). Under performance, the taxonomy splits into computing-resource utilization and data management, and each cell is further filled by method type—heuristic, AI-based, mathematical, or hybrid. This grid is what allows the survey to place each surveyed article in a unique cell and to read the distribution of work as evidence about where the field is concentrated and where it is empty.

What would settle it

A reader could test the comprehensiveness claim by running a defined literature search with explicit queries and a date range on the topic and checking how many of the retrieved papers are absent from the survey's reference list and cannot be assigned to one of its four environments; a substantial number of such omissions would falsify the claim.

Watch

Extended reading notes

Core claim

The authors' central claim is that the literature on geo-distributed task scheduling, which earlier reviews treated environment by environment, can be read as one coherent design space. They organize that space along two axes: four computing infrastructures—geo-distributed cloud, edge, cloud-edge, and geo-distributed supercomputer (HPC)—and three scheduling objectives—performance, fairness, and fault tolerance. Within performance, they further separate work that optimizes the use of computing resources from work that optimizes data management, and they classify every surveyed method as heuristic, AI-based, mathematical, or hybrid. On this basis they conclude that no previous survey covered all four environments, that supercomputer scheduling in particular had been left out, and that the resulting map exposes the field's gaps, with fairness and fault tolerance far less developed than performance, along with the open problems posed by emerging AI and multimodal workloads, next-generation hardware, and cross-border security and privacy.

Load-bearing premise

The survey assumes its selected set of papers is a comprehensive and representative sample of geo-distributed task scheduling research, because it does not report a reproducible search protocol or inclusion criteria.

Editorial extensions

If this is right

  • A researcher facing a scheduling problem can use the taxonomy to identify which environment and objective their task belongs to and immediately see the method families—heuristic, AI-based, mathematical, or hybrid—that have been tried there.
  • The survey's explicit comparison across all four environments supports the conclusion that performance-driven scheduling is far more developed than fairness and fault tolerance, marking the latter as the most promising space for new algorithms.
  • Naming geo-distributed supercomputing as a fourth environment widens the scheduling research agenda beyond latency-sensitive web and IoT workloads to tightly coupled, bandwidth-intensive scientific computing.
  • The open-issue analysis in Section 6 gives a concrete agenda: scheduling for LLM inference and multimodal AI workloads, for next-generation quantum and nano-computing hardware, and for security and privacy constraints that span jurisdictions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next step the authors do not take is to use their own grid as a quantitative map, counting papers per cell and then weighing whether the sparse cells reflect genuine research gaps or simply differences in how problems are named across communities.
  • The taxonomy could be stress-tested on boundary systems such as serverless geo-distributed computing, satellite edge computing, and federated learning clusters, which may not fit cleanly into any single one of the four environment boxes.
  • Because the survey is qualitative, it does not say which method wins on a given objective; an editorially inferred consequence is that the field now needs a common benchmark with shared workloads, failure models, and cost metrics before the taxonomy can guide technique selection.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. The paper surveys task scheduling in geo-distributed computing, organizing 137 references into four environments (geo-distributed cloud, edge, cloud-edge, and geo-distributed supercomputer/HPC) and classifying each work by scheduling objective (performance, fairness, fault-tolerance) and by method family (heuristic, AI-based, mathematical, hybrid). The authors argue in Section 1 that earlier surveys are limited to one environment or to cloud/grid combinations and that this is the first comprehensive review to cover all four environments, with the HPC pillar being a key differentiator. They present a taxonomy for each environment, summarize representative algorithms, and close with challenges and open issues in Section 6 and a conclusion in Section 7.

Significance. If the taxonomy and coverage are accurate, the survey would be a genuinely useful reference: it applies a consistent objective-based organizing principle across four paradigms, it spans recent works up to 2024 from reputable venues, and it explicitly addresses fairness and fault-tolerance in every environment, which many prior surveys treat only in passing. The paper also identifies meaningful open issues such as emerging AI/LLM workloads and next-generation hardware. However, the two central claims—comprehensiveness of the corpus and distinctness of the four-environment taxonomy—are currently not verifiable because the survey omits its literature selection methodology, and the HPC pillar contains entries that appear to be conventional HPC/grid schedulers without explicit geo-distribution. Since these claims define the survey's value, they need to be substantiated or carefully scoped before the paper can be recommended for acceptance.

major comments (3)
  1. [Sections 1 and 7] The survey claims in Section 7 to provide 'a comprehensive review of state-of-the-art task scheduling techniques across four distinct geo-distributed computing systems,' but Section 1 gives no search queries, databases, date range, or inclusion/exclusion criteria. As a result, the 137-reference corpus cannot be verified as comprehensive or representative; it is a hand-selected sample. Please add a methodology subsection documenting the literature search and screening process, or revise the 'comprehensive' claims to be explicitly scoped to the works surveyed.
  2. [Section 5] Section 5 defines geo-distributed supercomputer computing (GDSC) as coordinating tasks across globally distributed HPC nodes, but it does not specify how cited works qualify as geo-distributed. Several entries appear to target conventional HPC or grid environments without modeling multiple geographically separated sites or WAN costs: reference [125] on intra- and inter-server scheduling in HPC data centers, [126] MRSch for multi-resource HPC scheduling, [128] hierarchical task allocation for energy-aware HPC clouds, [130] parallel job scheduling in HPC grids with nature-inspired meta-heuristics, [131] HPC task scheduling on IaaS cloud infrastructures, [133] malleable job scheduling for supercomputers, and [134]/[135] rollback-recovery in HPC systems. If these works are not geo-distributed under the paper's own definition, they are misclassified, and the claimed distinctness of the HPC pillar (Section 1) is substantially overstated. Please add per-reference justification for geo-distribution, or narrow the section's title and claims accordingly.
  3. [Figure 2 and Section 2.1.1] There is an internal contradiction in the taxonomy: Figure 2 classifies references [38] and [39] under 'MILP with Branch and Cut,' but Section 2.1.1 (under the heading 'MILP with Branch and Bound') states that OPRS [39] employs a branch-and-bound algorithm. Please correct the figure or the text and verify the solver classification for both references, because this inconsistency undermines confidence in the accuracy of the taxonomy.
minor comments (6)
  1. [Section 2.1.1] The heading 'Mixed Linear Integer Programming' should read 'Mixed Integer Linear Programming' to match standard terminology and the MILP abbreviation.
  2. [Section 2.1.2] In the Data Placement Optimization paragraph, 'Data placement problem ca also be solved using reinforcement learning' contains a typo: 'ca' should be 'can.'
  3. [Section 3.1.1] In the Divide-and-Conquer paragraph, 'breath-first search' should be 'breadth-first search.'
  4. [Section 3.1.2] The text attributes algorithms named 'Okita' and 'Okita*' to reference [98], whose listed authors are Pang et al.; please confirm that these algorithm names are correct and appear in the cited paper, and clarify the naming for readers.
  5. [Table 1] The entry 'Extreme Low' latency for GDSC is counterintuitive for geographically distributed supercomputers, where WAN communication typically introduces high latency; please clarify whether this refers to user-perceived response latency for certain workloads or to inter-node communication latency, and consider rewording.
  6. [Section 6] References [136] and [137] are YouTube videos; consider replacing them with archival citations (papers, technical reports, or official documentation) for stability and verifiability.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the survey organizes external literature and makes no derivation claims that reduce to its own inputs.

full rationale

This paper is a survey, not a derivation. Its central claim is that it provides 'a comprehensive review of state-of-the-art task scheduling techniques across four distinct geo-distributed computing systems' (Section 7), organized by environment and by objective. There are no equations, no fitted parameters, no predictions from a model, and no uniqueness theorems invoked to force a conclusion. The taxonomy into geo-distributed cloud, edge, cloud-edge, and geo-distributed supercomputer computing is the authors' organizing frame, and each cited work is summarized as external evidence rather than as an input that is later renamed as an output. The skeptic's concern that some Section 5 references may be ordinary HPC or grid schedulers rather than geo-distributed HPC is a question about scope and completeness of the literature selection, not about circularity: even if the HPC pillar were misclassified, the survey's content would still be a summary of external papers rather than a conclusion entailed by its own definitions. No load-bearing self-citations appear: the reference list contains no prior work by the present authors that is invoked to justify the survey's premise, and no cited result is used to forbid alternative interpretations. Therefore, no circular step can be exhibited, and the appropriate finding is no significant circularity.

Assumptions & free parameters 0 free parameters · 2 assumptions · 0 invented entities

The survey introduces no fitted parameters, no mathematical axioms beyond reading assumptions, and no invented entities. The load-bearing implicit premises are the completeness of the taxonomy and the accuracy of the paraphrased summaries of 137 cited papers.

assumptions (2)
  • domain assumption The four-environment, three-objective taxonomy is a complete and meaningful organization of geo-distributed task scheduling literature.
    The survey's structure and claimed comprehensiveness rest on this classification; no validation or inter-rater process is reported.
  • domain assumption The summarized descriptions of cited works accurately reflect the original papers.
    The survey paraphrases over 130 papers; no verification protocol or author checks are described, so accuracy is assumed.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Task Scheduling in Geo-Distributed Computing: A Survey." pith.science (2026). https://pith.science/paper/TL5WZMK5

@misc{pith2026250115504,
  author       = {Pith},
  title        = {Pith review of: Task Scheduling in Geo-Distributed Computing: A Survey},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TL5WZMK5}},
  note         = {Machine review of arXiv:2501.15504}
}
read the original abstract

Geo-distributed computing, a paradigm that assigns computational tasks to globally distributed nodes, has emerged as a promising approach in cloud computing, edge computing, cloud-edge computing and supercomputer computing (HPC). It enables low-latency services, ensures data locality, and handles large-scale applications. As global computing capacity and task demands increase rapidly, scheduling tasks for efficient execution in geo-distributed computing systems has become an increasingly critical research challenge. It arises from the inherent characteristics of geographic distribution, including heterogeneous network conditions, region-specific resource pricing, and varying computational capabilities across locations. Researchers have developed diverse task scheduling methods tailored to geo-distributed scenarios, aiming to achieve objectives such as performance enhancement, fairness assurance, and fault-tolerance improvement. This survey provides a comprehensive and systematic review of task scheduling techniques across four major distributed computing environments, with an in-depth analysis of these approaches based on their core scheduling objectives. Through our analysis, we identify key research challenges and outline promising directions for advancing task scheduling in geo-distributed computing.

Figures

Figures reproduced from arXiv: 2501.15504 by the authors.

Figure 1
Figure 1. An overview of geo-distributed task scheduling. We categorize scheduling strategies across Geo-Distributed Cloud Computing, Cloud-Edge [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Taxonomy of studies on optimizations under geo-distributed cloud computing infrastructure. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. An example of a geo-distributed computing architecture exploit [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: An example of a geo-distributed computing environment focus [PITH_FULL_IMAGE:figures/full_fig_p007_4.png]
Figure 5
Figure 5. Figure 5: An overview of specific edge computing scenarios. [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]
Figure 6
Figure 6. Figure 6: An overview of the Mobile Crowd-sourcing System (MCS). [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 7
Figure 7. Figure 7: An architecture of the cloud & edge collaborative computing [PITH_FULL_IMAGE:figures/full_fig_p012_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

138 extracted references · 76 canonical work pages

  1. [125]

    Intra- and Inter-Server Smart Task Scheduling for Profit and Energy Optimization of HPC Data Centers,

    S. A. Mamun, A. Gilday, A. K. Singh, A. Ganguly, G. V . Merrett, X. Wang, and B. M. Al-Hashimi, “Intra- and Inter-Server Smart Task Scheduling for Profit and Energy Optimization of HPC Data Centers,” Journal of Low Power Electronics and Applications, vol. 10, no. 4, p. 32, Oct. 2020. [Online]. Available: https://www.mdpi.com/2079-9268/10/4/32

    2020

  2. [126]

    MRSch: Multi-Resource Scheduling for HPC,

    B. Li, Y. Fan, M. Dearing, Z. Lan, P . Rich, W. Allcock, and M. Papka, “MRSch: Multi-Resource Scheduling for HPC,” in2022 IEEE International Conference on Cluster Computing (CLUSTER) . Heidelberg, Germany: IEEE, Sep. 2022, pp. 47–57. [Online]. Available: https://ieeexplore.ieee.org/document/9912684/

    work page arXiv 2022

  3. [128]

    Modeling and simulation of hierarchical task allocation system for energy-aware HPC clouds,

    P . Arabas, “Modeling and simulation of hierarchical task allocation system for energy-aware HPC clouds,” Simulation Modelling Practice and Theory , vol. 107, p. 102221, Feb. 2021. [Online]. Available: https://linkinghub.elsevier.com/retrieve/ pii/S1569190X20301568

    2021

  4. [130]

    Performance-aware energy-efficient parallel job scheduling in HPC grid using nature-inspired hybrid meta-heuristics,

    A. Chhabra, G. Singh, and K. S. Kahlon, “Performance-aware energy-efficient parallel job scheduling in HPC grid using nature-inspired hybrid meta-heuristics,” Journal of Ambient Intelligence and Humanized Computing , vol. 12, no. 2, pp. 1801–1835, Feb. 2021. [Online]. Available: https://link.springer. com/10.1007/s12652-020-02255-w

    work page doi:10.1007/s12652-020-02255-w 2021

  5. [131]

    Multi-criteria HPC task scheduling on IaaS cloud infrastructures using meta-heuristics,

    Chhabra, Amit and Singh, Gurvinder and Kahlon, Karanjeet Singh, “Multi-criteria HPC task scheduling on IaaS cloud infrastructures using meta-heuristics,” Cluster Computing, vol. 24, no. 2, pp. 885–918, Jun. 2021. [Online]. Available: https: //link.springer.com/10.1007/s10586-020-03168-1

    work page doi:10.1007/s10586-020-03168-1 2021

  6. [133]

    Enhancing supercomputer performance with malleable job scheduling strategies,

    J. Posner, F. Hupfeld, and P . Finnerty, “Enhancing supercomputer performance with malleable job scheduling strategies,” in Euro- pean Conference on Parallel Processing. Springer, 2023, pp. 180–192

    2023

  7. [134]

    Towards management of energy consumption in hpc systems with fault tolerance,

    M. Mor ´an, J. Balladini, D. Rexachs, and E. Rucci, “Towards management of energy consumption in hpc systems with fault tolerance,” in 2020 IEEE Congreso Bienal de Argentina (ARGEN- CON). IEEE, 2020, pp. 1–8

    2020

  8. [135]

    Exploring energy saving opportunities in fault tolerant HPC systems,

    M. Morn, J. Balladini, D. Rexachs, and E. Rucci, “Exploring energy saving opportunities in fault tolerant HPC systems,” Journal of Parallel and Distributed Computing , vol. 185, p. 104797, Mar. 2024. [Online]. Available: https://linkinghub.elsevier.com/ retrieve/pii/S0743731523001673

    2024

  9. [39]

    Workload and energy management of geo-distributed datacenters considering demand response programs,

    M. Zhao, X. Wang, and J. Mo, “Workload and energy management of geo-distributed datacenters considering demand response programs,” Sustainable Energy Technologies and Assess- ments, vol. 55, p. 102851, Feb. 2023. [Online]. Available: https: //linkinghub.elsevier.com/retrieve/pii/S2213138822008992

    2023

  10. [38]

    CASPER: Carbon-Aware Scheduling and Provisioning for Distributed Web Services

    A. Souza, S. Jasoria, B. Chakrabarty, A. Bridgwater, A. Lundberg, F. Skogh, A. Ali-Eldin, D. Irwin, and P . Shenoy, “CASPER: Carbon-Aware Scheduling and Provisioning for Distributed Web Services,” Mar. 2024, arXiv:2403.14792 [cs, math]. [Online]. Available: http://arxiv.org/abs/2403.14792

    work page Pith review arXiv 2024

Show all 138 references
  1. [1]

    A comprehensive survey for scheduling techniques in cloud computing,

    M. Kumar, S. Sharma, A. Goel, and S. Singh, “A comprehensive survey for scheduling techniques in cloud computing,” Journal of Network and Computer Applications , vol. 143, pp. 1–33, Oct. 2019. [Online]. Available: https://linkinghub.elsevier.com/retrieve/ pii/S1084804519302036

    2019

  2. [2]

    A review of task scheduling based on meta-heuristics approach in cloud computing,

    P . Singh, M. Dutta, and N. Aggarwal, “A review of task scheduling based on meta-heuristics approach in cloud computing,” Knowledge and Information Systems, vol. 52, no. 1, pp. 1–51, Jul. 2017. [Online]. Available: http://link.springer.com/10. 1007/s10115-017-1044-2

    2017

  3. [3]

    Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends,

    E. H. Houssein, A. G. Gad, Y. M. Wazery, and P . N. Suganthan, “Task Scheduling in Cloud Computing based on Meta-heuristics: Review, Taxonomy, Open Challenges, and Future Trends,” Swarm and Evolutionary Computation , vol. 62, p. 100841, Apr. 2021. [Online]. Available: https: /...

    2021

  4. [4]

    Towards workflow scheduling in cloud computing: A comprehensive analysis,

    M. Masdari, S. ValiKardan, Z. Shahi, and S. I. Azar, “Towards workflow scheduling in cloud computing: A comprehensive analysis,” Journal of Network and Computer Applications , vol. 66, pp. 64–82, May 2016. [Online]. Available: https://linkinghub. elsevier.com/retrieve/pii/S108...

    2016

  5. [5]

    A State-of-the- Art Review of Task Scheduling for Edge Computing: A Delay-Sensitive Application Perspective,

    A. Avan, A. Azim, and Q. H. Mahmoud, “A State-of-the- Art Review of Task Scheduling for Edge Computing: A Delay-Sensitive Application Perspective,” Electronics, vol. 12, no. 12, p. 2599, Jun. 2023. [Online]. Available: https: //www.mdpi.com/2079-9292/12/12/2599

    2023

  6. [6]

    Task scheduling techniques in cloud computing: A literature survey,

    A. Arunarani, D. Manjula, and V . Sugumaran, “Task scheduling techniques in cloud computing: A literature survey,” Future Generation Computer Systems , vol. 91, pp. 407–415, Feb. 2019. [Online]. Available: https://linkinghub.elsevier.com/retrieve/ pii/S0167739X17321519

    2019

  7. [7]

    Resource Scheduling in Edge Computing: A Survey,

    Q. Luo, S. Hu, C. Li, G. Li, and W. Shi, “Resource Scheduling in Edge Computing: A Survey,” IEEE Communications Surveys & Tutorials, vol. 23, no. 4, pp. 2131–2165, 2021. [Online]. Available: https://ieeexplore.ieee.org/document/9519636/

    2021

  8. [8]

    Task scheduling algorithms for energy optimization in cloud environment: a comprehensive review,

    R. Ghafari, F. H. Kabutarkhani, and N. Mansouri, “Task scheduling algorithms for energy optimization in cloud environment: a comprehensive review,” Cluster Computing , vol. 25, no. 2, pp. 1035–1093, Apr. 2022. [Online]. Available: https://doi.org/10.1007/s10586-021-03512-z

    2022 doi

  9. [9]

    Cost optimization approaches for scientific workflow scheduling in cloud and grid computing: A review, classifications, and open issues,

    E. N. Alkhanak, S. P . Lee, R. Rezaei, and R. M. Parizi, “Cost optimization approaches for scientific workflow scheduling in cloud and grid computing: A review, classifications, and open issues,” Journal of Systems and Software , vol. 113, pp. 1–26, Mar. 2016. [Online]. Availa...

    2016

  10. [10]

    Energy-Aware Cloud Workflow Applications Scheduling With Geo-Distributed Data,

    X. Li, W. Yu, R. Ruiz, and J. Zhu, “Energy-Aware Cloud Workflow Applications Scheduling With Geo-Distributed Data,” IEEE Transactions on Services Computing , vol. 15, no. 2, pp. 891–903, Mar. 2022. [Online]. Available: https://ieeexplore.ieee. org/document/8954766/

    2022

  11. [11]

    Deadline-constrained energy-aware workflow schedul- ing in geographically distributed cloud data centers,

    M. Hussain, L.-F. Wei, A. Rehman, F. Abbas, A. Hussain, and M. Ali, “Deadline-constrained energy-aware workflow schedul- ing in geographically distributed cloud data centers,” Future Generation Computer Systems, vol. 132, pp. 211–222, 2022

    2022

  12. [12]

    Energy Utilization Task Scheduling for MapReduce in Heterogeneous Clusters,

    J. Wang, X. Li, R. Ruiz, J. Yang, and D. Chu, “Energy Utilization Task Scheduling for MapReduce in Heterogeneous Clusters,” IEEE Transactions on Services Computing , vol. 15, no. 2, pp. 931–944, Mar. 2022. [Online]. Available: https: //ieeexplore.ieee.org/document/8959320/

    2022

  13. [13]

    Efficient multi-attribute precedence-based task scheduling for edge computing in geo-distributed cloud environment,

    C. Li, C. Zhang, B. Ma, and Y. Luo, “Efficient multi-attribute precedence-based task scheduling for edge computing in geo-distributed cloud environment,” Knowledge and Information Systems, vol. 64, no. 1, pp. 175–205, Jan. 2022. [Online]. Available: https://doi.org/10.1007/s10...

    2022 doi

  14. [14]

    Cluster load based content distribution and speculative execution for geographically distributed cloud environment,

    C. Li, M. Song, Q. Zhang, and Y. Luo, “Cluster load based content distribution and speculative execution for geographically distributed cloud environment,” Computer Networks , vol. 186, p. 107807, Feb. 2021. [Online]. Available: https://linkinghub. elsevier.com/retrieve/pii/S1...

    2021

  15. [15]

    Big Data Processing Workflows Oriented Real-Time Scheduling Algorithm using Task-Duplication in Geo-Distributed Clouds,

    H. Chen, J. Wen, W. Pedrycz, and G. Wu, “Big Data Processing Workflows Oriented Real-Time Scheduling Algorithm using Task-Duplication in Geo-Distributed Clouds,” IEEE Transactions on Big Data , vol. 6, no. 1, pp. 131–144, Mar. 2020. [Online]. Available: https://ieeexplore.ieee...

    2020

  16. [16]

    MAST: Global Scheduling of ML Training across Geo-Distributed Datacenters at Hyperscale

    A. Choudhury, Y. Wang, T. Pelkonen, K. Srinivasan, A. Jain, S. Lin, D. David, S. Soleimanifard, M. Chen, A. Yadav, R. Tijori- wala, D. Samoylov, and C. Tang, “MAST: Global Scheduling of ML Training across Geo-Distributed Datacenters at Hyperscale.”

  17. [17]

    Uncertainty Level-Based Algorithms by Managing Renewable Energy for Geo-Distributed Datacenters,

    S. Padhi and R. B. V . Subramanyam, “Uncertainty Level-Based Algorithms by Managing Renewable Energy for Geo-Distributed Datacenters,” Cluster Computing , Jan. 2024. [Online]. Available: https://link.springer.com/10.1007/s10586-023-04216-2

    2024 doi

  18. [18]

    Spatial and thermal aware methods for efficient workload management in distributed data centers,

    A. Ali and . zkasap, “Spatial and thermal aware methods for efficient workload management in distributed data centers,” Future Generation Computer Systems , vol. 153, pp. 360–374, Apr. 2024. [Online]. Available: https://linkinghub.elsevier.com/ retrieve/pii/S0167739X23004685

    2024

  19. [19]

    Multi-objective optimization-based workflow scheduling for applications with data locality and deadline constraints in geo-distributed clouds,

    D. Wu, X. Wang, X. Wang, M. Huang, R. Zeng, and K. Yang, “Multi-objective optimization-based workflow scheduling for applications with data locality and deadline constraints in geo-distributed clouds,” Future Generation Computer Systems , vol. 157, pp. 485–498, Aug. 2024. [Onl...

    2024

  20. [20]

    Federated geo-distributed clouds: optimizing resource allocation based on request type using autonomous and multi-objective resource sharing model,

    F. Ebadifard and S. M. Babamir, “Federated geo-distributed clouds: optimizing resource allocation based on request type using autonomous and multi-objective resource sharing model,” Big Data Research, vol. 24, p. 100188, 2021

    2021

  21. [21]

    Dual Optimization of Revenue and Expense in Geo-Distributed Data Centers Using Smart Grid,

    S. Khalid and I. Ahmad, “Dual Optimization of Revenue and Expense in Geo-Distributed Data Centers Using Smart Grid,” IEEE Transactions on Cloud Computing , vol. 11, no. 2, pp. 1622–1635, Apr. 2023, conference Name: IEEE Transactions on Cloud Computing. [Online]. Available: htt...

    2023

  22. [22]

    Revenue and Energy Cost-Optimized Biobjective Task Scheduling for Green Cloud Data Centers,

    H. Yuan, H. Liu, and J. Bi, “Revenue and Energy Cost-Optimized Biobjective Task Scheduling for Green Cloud Data Centers,” IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND EN- GINEERING, vol. 18, no. 2, 2021

    2021

  23. [23]

    Resource and Cost Aware Glowworm Mapreduce Optimization Based Big Data Processing in Geo Distributed Data Center,

    S. Nithyanantham and G. Singaravel, “Resource and Cost Aware Glowworm Mapreduce Optimization Based Big Data Processing in Geo Distributed Data Center,” Wireless Personal Communi- cations, vol. 117, no. 4, pp. 2831–2852, Apr. 2021. [Online]. Available: http://link.springer.com/...

    2021 doi

  24. [24]

    Firefly algorithm and learning-based geographical task scheduling for operational cost minimization in distributed green data centers,

    A. C. Ammari, W. Labidi, F. Mnif, H. Yuan, M. Zhou, and M. Sarrab, “Firefly algorithm and learning-based geographical task scheduling for operational cost minimization in distributed green data centers,” Neurocomputing, vol. 490, pp. 146–162, Jun. 2022. [Online]. Available: ht...

    2022

  25. [25]

    Energy Consumption and Performance Optimized Task Scheduling in Distributed Data Centers,

    H. Yuan, J. Bi, J. Zhang, and M. Zhou, “Energy Consumption and Performance Optimized Task Scheduling in Distributed Data Centers,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, vol. 52, no. 9, pp. 5506–5517, Sep. 2022. [Online]. Available: https://ieeexplore.iee...

    2022

  26. [26]

    Biobjective Task Scheduling for Distributed Green Data Centers,

    H. Yuan, J. Bi, and A. C. Ammari, “Biobjective Task Scheduling for Distributed Green Data Centers,” IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING , vol. 18, no. 2, 2021

    2021

  27. [27]

    Energy-Efficient and QoS- Optimized Adaptive Task Scheduling and Management in Clouds,

    H. Yuan, J. Bi, and M. Zhou, “Energy-Efficient and QoS- Optimized Adaptive Task Scheduling and Management in Clouds,” IEEE Transactions on Automation Science and Engineering, vol. 19, no. 2, pp. 1233–1244, Apr. 2022. [Online]. Available: https://ieeexplore.ieee.org/document/9296374/

    2022

  28. [28]

    Adaptive Partitioning for Large-Scale Graph Analytics in Geo-Distributed Data Centers,

    A. C. Zhou, J. Luo, R. Qiu, H. Tan, B. He, and R. Mao, “Adaptive Partitioning for Large-Scale Graph Analytics in Geo-Distributed Data Centers,” in 2022 IEEE 38th International Conference on Data Engineering (ICDE) . Kuala Lumpur, Malaysia: IEEE, May 2022, pp. 2818–2830. [Onlin...

    2022

  29. [29]

    Sustainable AIGC Workload Scheduling of Geo-Distributed Data Centers: A Multi-Agent Reinforcement Learning Approach,

    S. Zhang, M. Xu, W. Y. Bryan Lim, and D. Niyato, “Sustainable AIGC Workload Scheduling of Geo-Distributed Data Centers: A Multi-Agent Reinforcement Learning Approach,” in GLOBE- IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XX,NO. XX, XXX. XXXX 17 COM 2023 - 2023 I...

    2023

  30. [30]

    Cost-optimized Task Scheduling with Improved Deep Q-Learning in Green Data Centers,

    J. Bi, Z. Yu, and H. Yuan, “Cost-optimized Task Scheduling with Improved Deep Q-Learning in Green Data Centers,” in2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC) . Prague, Czech Republic: IEEE, Oct. 2022, pp. 556–561. [Online]. Available: https://iee...

    2022

  31. [31]

    A Deep Reinforcement Learning Approach to Resource Management in Hybrid Clouds Harnessing Renewable Energy and Task Scheduling,

    J. Zhao, M. A. Rodriguez, and R. Buyya, “A Deep Reinforcement Learning Approach to Resource Management in Hybrid Clouds Harnessing Renewable Energy and Task Scheduling,” in 2021 IEEE 14th International Conference on Cloud Computing (CLOUD) . Chicago, IL, USA: IEEE, Sep. 2021, ...

    2021

  32. [32]

    Geography-Aware Task Scheduling for Profit Maximization in Distributed Green Data Centers,

    H. Yuan, J. Bi, and M. Zhou, “Geography-Aware Task Scheduling for Profit Maximization in Distributed Green Data Centers,” IEEE Transactions on Cloud Computing , vol. 10, no. 3, pp. 1864–1874, Jul. 2022. [Online]. Available: https: //ieeexplore.ieee.org/document/9112635/

    2022

  33. [33]

    Profit Maximization for Geographically Dispersed Green Data Centers,

    A. Kiani and N. Ansari, “Profit Maximization for Geographically Dispersed Green Data Centers,” IEEE Transactions on Smart Grid, vol. 9, no. 2, pp. 703–711, Mar. 2018. [Online]. Available: http://ieeexplore.ieee.org/document/7464292/

    2018

  34. [34]

    MapReduce Task Scheduling in Heterogeneous Geo-Distributed Data Centers,

    X. Li, F. Chen, R. Ruiz, and J. Zhu, “MapReduce Task Scheduling in Heterogeneous Geo-Distributed Data Centers,” IEEE Transactions on Services Computing , vol. 15, no. 6, pp. 3317–3329, Nov. 2022, conference Name: IEEE Transactions on Services Computing. [Online]. Available: ht...

    2022

  35. [35]

    Joint optimization of operational cost and carbon emission in multiple data center micro- grids,

    X. Hao, P . Liu, and Y. Deng, “Joint optimization of operational cost and carbon emission in multiple data center micro- grids,” Frontiers in Energy Research , vol. 12, p. 1344837, Feb

  36. [36]

    Stochastic programming for cost optimization in geographically distributed Internet data centers,

    P . Wang, Y. Cao, Z. Ding, H. Tang, X. Wang, and M. Cheng, “Stochastic programming for cost optimization in geographically distributed Internet data centers,” CSEE Journal of Power and Energy Systems , vol. 8, no. 4, pp. 1215–1232, 2020. [Online]. Available: https://ieeexplore...

    2020

  37. [37]

    An Optimal Task Placement Strategy in Geo-Distributed Data Centers Involving Renewable Energy,

    R. Wang, Y. Lu, K. Zhu, J. Hao, P . Wang, and Y. Cao, “An Optimal Task Placement Strategy in Geo-Distributed Data Centers Involving Renewable Energy,” IEEE Access , vol. 6, pp. 61 948–61 958, 2018. [Online]. Available: https: //ieeexplore.ieee.org/document/8493571/

    2018

  38. [40]

    Carbon Management of Multi-Datacenter Based On Spatio-Temporal Task Migration,

    T. Yang, H. Jiang, Y. Hou, and Y. Geng, “Carbon Management of Multi-Datacenter Based On Spatio-Temporal Task Migration,” IEEE TRANSACTIONS ON CLOUD COMPUTING, vol. 11, no. 1, pp. 1078–1090, 2023

    2023

  39. [41]

    Blockchain-based decentralized workload and energy management of geo-distributed data centers,

    S. Sajid, M. Jawad, K. Hamid, M. U. Khan, S. M. Ali, A. Abbas, and S. U. Khan, “Blockchain-based decentralized workload and energy management of geo-distributed data centers,” Sustainable Computing: Informatics and Systems , vol. 29, p. 100461, Mar. 2021. [Online]. Available: ...

    2021

  40. [42]

    Managing data center cluster as non-wire alternative: A case in balancing market,

    Y. Cao, F. Cao, Y. Wang, J. Wang, L. Wu, and Z. Ding, “Managing data center cluster as non-wire alternative: A case in balancing market,” Applied Energy , vol. 360, p. 122769, Apr. 2024. [Online]. Available: https://linkinghub.elsevier.com/ retrieve/pii/S0306261924001521

    2024

  41. [43]

    Joint energy optimization on the server and network sides for geo- distributed data centers,

    Y. Qin, W. Han, Y. Yang, and W. Yang, “Joint energy optimization on the server and network sides for geo- distributed data centers,” The Journal of Supercomputing , vol. 77, no. 7, pp. 7757–7790, Jul. 2021. [Online]. Available: https://link.springer.com/10.1007/s11227-020-03523-4

    2021 doi

  42. [44]

    Turbo: Dynamic and Decentralized Global Analytics via Machine Learning,

    H. Wang, D. Niu, and B. Li, “Turbo: Dynamic and Decentralized Global Analytics via Machine Learning,” IEEE Transactions on Parallel and Distributed Systems , vol. 31, no. 6, pp. 1372–1386, Jun. 2020. [Online]. Available: https: //ieeexplore.ieee.org/document/8951093/

    2020

  43. [45]

    Energy and Network Aware Workload Management for Geographically Distributed Data Centers,

    N. Hogade, S. Pasricha, and H. J. Siegel, “Energy and Network Aware Workload Management for Geographically Distributed Data Centers,” IEEE Transactions on Sustainable Computing , vol. 7, no. 2, pp. 400–413, Apr. 2022. [Online]. Available: https://ieeexplore.ieee.org/document/9445675/

    2022

  44. [46]

    Game-Theoretic Deep Reinforce- ment Learning to Minimize Carbon Emissions and Energy Costs for AI Inference Workloads in Geo-Distributed Data Centers,

    N. Hogade and S. Pasricha, “Game-Theoretic Deep Reinforce- ment Learning to Minimize Carbon Emissions and Energy Costs for AI Inference Workloads in Geo-Distributed Data Centers,” arXiv preprint, 2024

    2024

  45. [47]

    Power-Aware Allocation of Graph Jobs in Geo-Distributed Cloud Networks,

    S. Hosseinalipour, A. Nayak, and H. Dai, “Power-Aware Allocation of Graph Jobs in Geo-Distributed Cloud Networks,” IEEE Transactions on Parallel and Distributed Systems , vol. 31, no. 4, pp. 749–765, Apr. 2020. [Online]. Available: https: //ieeexplore.ieee.org/document/8847383/

    2020

  46. [48]

    An effective scheduling strategy based on hypergraph partition in geographically distributed datacenters,

    C. Li, Y. Zhang, Z. Hao, and Y. Luo, “An effective scheduling strategy based on hypergraph partition in geographically distributed datacenters,” Computer Networks, vol. 170, p. 107096, Apr. 2020. [Online]. Available: https://linkinghub.elsevier.com/ retrieve/pii/S138912861930684X

    2020

  47. [49]

    Spatiotemporal Task Scheduling for Hetero- geneous Delay-Tolerant Applications in Distributed Green Data Centers,

    H. Yuan and J. Bi, “Spatiotemporal Task Scheduling for Hetero- geneous Delay-Tolerant Applications in Distributed Green Data Centers,” IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, vol. 16, no. 4, 2019

    2019

  48. [50]

    GMTA: A Geo- Aware Multi-Agent Task Allocation Approach for Scientific Workflows in Container-Based Cloud,

    M. Niu, B. Cheng, Y. Feng, and J. Chen, “GMTA: A Geo- Aware Multi-Agent Task Allocation Approach for Scientific Workflows in Container-Based Cloud,” IEEE Transactions on Network and Service Management , vol. 17, no. 3, pp. 1568–1581, Sep. 2020, rate: 2. [Online]. Available: ht...

    2020

  49. [51]

    Profit-Sensitive Spatial Scheduling of Multi-Application Tasks in Distributed Green Clouds,

    H. Yuan, J. Bi, and M. Zhou, “Profit-Sensitive Spatial Scheduling of Multi-Application Tasks in Distributed Green Clouds,” IEEE Transactions on Automation Science and Engineering, vol. 17, no. 3, pp. 1097–1106, Jul. 2020. [Online]. Available: https://ieeexplore.ieee.org/docume...

    2020

  50. [52]

    Fine- grained and arbitrary task scheduling for heterogeneous applications in distributed green clouds,

    H. Yuan, M. Zhou, Q. Liu, and A. Abusorrah, “Fine- grained and arbitrary task scheduling for heterogeneous applications in distributed green clouds,” IEEE/CAA Journal of Automatica Sinica , pp. 1–13, 2020. [Online]. Available: https://ieeexplore.ieee.org/document/9106869/

    2020

  51. [53]

    Optimizing Network Transfers for Data Analytic Jobs Across Geo-Distributed Datacenters,

    L. Chen, S. Liu, and B. Li, “Optimizing Network Transfers for Data Analytic Jobs Across Geo-Distributed Datacenters,” IEEE Transactions on Parallel and Distributed Systems , vol. 33, no. 2, pp. 403–414, Feb. 2022, conference Name: IEEE Transactions on Parallel and Distributed ...

    2022

  52. [54]

    Endpoint-Flexible Coflow Scheduling Across Geo- Distributed Datacenters,

    W. Li, X. Yuan, K. Li, H. Qi, X. Zhou, and R. Xu, “Endpoint-Flexible Coflow Scheduling Across Geo- Distributed Datacenters,” IEEE Transactions on Parallel and Distributed Systems , vol. 31, no. 10, pp. 2466– 2481, Oct. 2020, conference Name: IEEE Transactions on Parallel and D...

    2020

  53. [55]

    Optimizing Geo-Distributed Data Analytics with Coordinated Task Scheduling and Routing,

    L. Zhao, Y. Yang, A. Munir, A. X. Liu, Y. Li, and W. Qu, “Optimizing Geo-Distributed Data Analytics with Coordinated Task Scheduling and Routing,” IEEE Transactions on Parallel and Distributed Systems , vol. 31, no. 2, pp. 279–293, Feb. 2020, conference Name: IEEE Transactions...

    2020

  54. [56]

    SDN-enabled Resource Provisioning Framework for Geo-Distributed Streaming Analytics,

    H. Mostafaei and S. Afridi, “SDN-enabled Resource Provisioning Framework for Geo-Distributed Streaming Analytics,” ACM Transactions on Internet Technology , vol. 23, no. 1, pp. 18:1–18:21, Feb. 2023. [Online]. Available: https://dl.acm.org/doi/10.1145/ 3571158

    2023

  55. [57]

    Service Function Chain Deployment and Network Flow Scheduling in Geo- Distributed Data Centers,

    L. Gu, J. Hu, D. Zeng, S. Guo, and H. Jin, “Service Function Chain Deployment and Network Flow Scheduling in Geo- Distributed Data Centers,” IEEE Transactions on Network Science and Engineering, vol. 7, no. 4, pp. 2587–2597, Oct. 2020. [Online]. Available: https://ieeexplore.i...

    2020

  56. [58]

    Alibaba maxcompute,

    “Alibaba maxcompute,” https://www.alibabacloud.com/zh/ product/maxcompute, 2024, accessed 10. July. 2024

    2024

  57. [59]

    Yugong: geo-distributed data and job placement at scale,

    Y. Huang, Y. Shi, Z. Zhong, Y. Feng, J. Cheng, J. Li, H. Fan, C. Li, T. Guan, and J. Zhou, “Yugong: geo-distributed data and job placement at scale,” Proceedings of the VLDB Endowment , IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XX,NO. XX, XXX. XXXX 18 vol. 12, ...

    2019

  58. [60]

    Cost-Aware Partitioning for Efficient Large Graph Processing in Geo-Distributed Datacenters,

    A. C. Zhou, B. Shen, Y. Xiao, S. Ibrahim, and B. He, “Cost-Aware Partitioning for Efficient Large Graph Processing in Geo-Distributed Datacenters,” IEEE Transactions on Parallel and Distributed Systems , vol. 31, no. 7, pp. 1707–1723, Jul. 2020. [Online]. Available: https://ie...

    2020

  59. [61]

    Job scheduling for distributed machine learning in optical WAN,

    L. Liu, H. Yu, G. Sun, L. Luo, Q. Jin, and S. Luo, “Job scheduling for distributed machine learning in optical WAN,” Future Generation Computer Systems , vol. 112, pp. 549–560, Nov. 2020. [Online]. Available: https://linkinghub.elsevier.com/ retrieve/pii/S0167739X20302612

    2020

  60. [62]

    Trading Cost and Throughput in Geo-Distributed Analytics With A Two Time Scale Approach,

    X. Xu, W. Li, R. Xu, H. Qi, K. Li, X. Zhou, and S. Chen, “Trading Cost and Throughput in Geo-Distributed Analytics With A Two Time Scale Approach,” IEEE Transactions on Cloud Computing , vol. 10, no. 3, pp. 2163–2177, Jul. 2022. [Online]. Available: https://ieeexplore.ieee.org...

    2022

  61. [63]

    Network Cost-Aware Geo-Distributed Data Analytics System,

    K. Oh, M. Zhang, A. Chandra, and J. Weissman, “Network Cost-Aware Geo-Distributed Data Analytics System,” IEEE Transactions on Parallel and Distributed Systems , vol. 33, no. 6, pp. 1407–1420, Jun. 2022, conference Name: IEEE Transactions on Parallel and Distributed Systems. [...

    2022

  62. [64]

    Optimal Query Plans for Geo-distributed Data Analytics at Scale,

    A. Pradhan, S. Karthik, and R. S., “Optimal Query Plans for Geo-distributed Data Analytics at Scale,” in Proceedings of the 7th Joint International Conference on Data Science & Management of Data (11th ACM IKDD CODS and 29th COMAD) . Bangalore India: ACM, Jan. 2024, pp. 247–25...

    2024

  63. [65]

    Online Training Flow Scheduling for Geo-Distributed Machine Learning Jobs Over Heterogeneous and Dynamic Networks,

    L. Fan, X. Zhang, Y. Zhao, K. Sood, and S. Yu, “Online Training Flow Scheduling for Geo-Distributed Machine Learning Jobs Over Heterogeneous and Dynamic Networks,” IEEE Transactions on Cognitive Communications and Networking , vol. 10, no. 1, pp. 277–291, Feb. 2024. [Online]. ...

    2024

  64. [66]

    Less is More: Service Profit Maximization in Geo-Distributed Clouds,

    Z. Yang, Y. Cui, X. Wang, M. Li, and Y. Liu, “Less is More: Service Profit Maximization in Geo-Distributed Clouds,” IEEE Transactions on Cloud Computing , vol. 10, no. 3, pp. 1925–1940, Jul. 2022. [Online]. Available: https: //ieeexplore.ieee.org/document/9200715/

    1925

  65. [67]

    Congestion-Aware Traffic Allocation for Geo-Distributed Data Centers,

    X. Tao, K. Ota, M. Dong, W. Borjigin, H. Qi, and K. Li, “Congestion-Aware Traffic Allocation for Geo-Distributed Data Centers,” IEEE Transactions on Cloud Computing , vol. 10, no. 3, pp. 1675–1687, Jul. 2022. [Online]. Available: https: //ieeexplore.ieee.org/document/9112674/

    2022

  66. [68]

    HCEC: An efficient geo-distributed deep learning training strategy based on wait-free back-propagation,

    Y. Song, Y. Ai, X. Xiao, Z. Liu, Z. Tang, and K. Li, “HCEC: An efficient geo-distributed deep learning training strategy based on wait-free back-propagation,” Journal of Systems Architecture , vol. 148, p. 103070, Mar. 2024. [Online]. Available: https: //linkinghub.elsevier.co...

    2024

  67. [69]

    Cross-MapReduce: Data transfer reduction in geo-distributed MapReduce,

    S. M. Marzuni, A. Savadi, A. N. Toosi, and M. Naghibzadeh, “Cross-MapReduce: Data transfer reduction in geo-distributed MapReduce,” Future Generation Computer Systems , vol. 115, pp. 188–200, Feb. 2021. [Online]. Available: https://linkinghub. elsevier.com/retrieve/pii/S016773...

    2021

  68. [70]

    Optimal data placement strategy considering capacity limitation and load balancing in geograph- ically distributed cloud,

    C. Li, Q. Cai, and Y. Lou, “Optimal data placement strategy considering capacity limitation and load balancing in geograph- ically distributed cloud,” Future Generation Computer Systems , vol. 127, pp. 142–159, Feb. 2022. [Online]. Available: https: //linkinghub.elsevier.com/r...

    2022

  69. [71]

    Multi-objective optimization of data deployment and scheduling based on the minimum cost in geo-distributed cloud,

    T. Xie, C. Li, N. Hao, and Y. Luo, “Multi-objective optimization of data deployment and scheduling based on the minimum cost in geo-distributed cloud,” Computer Communications , vol. 185, pp. 142–158, Mar. 2022. [Online]. Available: https: //linkinghub.elsevier.com/retrieve/pi...

    2022

  70. [72]

    SpeCH: A scalable framework for data placement of data-intensive services in geo-distributed clouds,

    A. Atrey, G. Van Seghbroeck, H. Mora, F. De Turck, and B. Volckaert, “SpeCH: A scalable framework for data placement of data-intensive services in geo-distributed clouds,” Journal of Network and Computer Applications , vol. 142, pp. 1–14, Sep. 2019. [Online]. Available: https:...

    2019

  71. [73]

    GeoCol: A Geo- distributed Cloud Storage System with Low Cost and Latency using Reinforcement Learning,

    H. Wang, H. Shen, Z. Li, and S. Tian, “GeoCol: A Geo- distributed Cloud Storage System with Low Cost and Latency using Reinforcement Learning,” in 2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS) . DC, USA: IEEE, Jul. 2021, pp. 149–159. [Online]...

    2021

  72. [74]

    Placement of parameter server in wide area network topology for geo-distributed machine learning,

    Y. Li, C. Fan, X. Zhang, and Y. Chen, “Placement of parameter server in wide area network topology for geo-distributed machine learning,” Journal of Communications and Networks , vol. 25, no. 3, pp. 370–380, Jun. 2023. [Online]. Available: https://ieeexplore.ieee.org/document/...

    2023

  73. [75]

    GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers,

    M. W. Convolbo, J. Chou, C.-H. Hsu, and Y. C. Chung, “GEODIS: towards the optimization of data locality-aware job scheduling in geo-distributed data centers,” Computing, vol. 100, no. 1, pp. 21–46, Jan. 2018. [Online]. Available: http://link.springer.com/10.1007/s00607-017-0564-7

    2018 doi

  74. [76]

    Data locality optimization based on data migration and hotspots prediction in geo-distributed cloud environment,

    C. Li, J. Zhang, T. Ma, H. Tang, L. Zhang, and Y. Luo, “Data locality optimization based on data migration and hotspots prediction in geo-distributed cloud environment,” Knowledge-Based Systems , vol. 165, pp. 321–334, Feb. 2019. [Online]. Available: https://linkinghub.elsevie...

    2019

  75. [77]

    Scalable and Adaptive Data Replica Placement for Geo-Distributed Cloud Storages,

    K. Liu, J. Peng, J. Wang, W. Liu, Z. Huang, and J. Pan, “Scalable and Adaptive Data Replica Placement for Geo-Distributed Cloud Storages,” IEEE Transactions on Parallel and Distributed Systems , vol. 31, no. 7, pp. 1575–1587, Jul. 2020. [Online]. Available: https://ieeexplore....

    2020

  76. [78]

    A Framework of Hypergraph-Based Data Placement Among Geo-Distributed Datacenters,

    B. Yu and J. Pan, “A Framework of Hypergraph-Based Data Placement Among Geo-Distributed Datacenters,” IEEE Transactions on Services Computing , vol. 13, no. 3, pp. 395– 409, May 2020. [Online]. Available: https://ieeexplore.ieee.org/ document/7947216/

    2020

  77. [79]

    Distributed Data Strategies to Support Large-Scale Data Analysis Across Geo-Distributed Data Centers,

    T. Z. Emara and J. Z. Huang, “Distributed Data Strategies to Support Large-Scale Data Analysis Across Geo-Distributed Data Centers,” IEEE Access, vol. 8, pp. 178 526–178 538, 2020. [Online]. Available: https://ieeexplore.ieee.org/document/9208652/

    2020

  78. [80]

    QoS-Aware Data Placement for MapReduce Applications in Geo-Distributed Data Centers,

    W. Chen, B. Liu, I. Paik, Z. Li, and Z. Zheng, “QoS-Aware Data Placement for MapReduce Applications in Geo-Distributed Data Centers,” IEEE Transactions on Engineering Management , vol. 68, no. 1, pp. 120–136, Feb. 2021. [Online]. Available: https://ieeexplore.ieee.org/document...

    2021

  79. [81]

    Efficient Scheduling of Scientific Workflows Using Hot Metadata in a Multisite Cloud,

    J. Liu, L. Pineda, E. Pacitti, A. Costan, P . Valduriez, G. Antoniu, and M. Mattoso, “Efficient Scheduling of Scientific Workflows Using Hot Metadata in a Multisite Cloud,” IEEE Transactions on Knowledge and Data Engineering , vol. 31, no. 10, pp. 1940–1953, Oct. 2019. [Online...

    1940

  80. [82]

    Hybrid Deep Learning Framework for Privacy Preservation in Geo-Distributed Data Centre,

    S. Nithyanantham and G. Singaravel, “Hybrid Deep Learning Framework for Privacy Preservation in Geo-Distributed Data Centre,” Intelligent Automation & Soft Computing , vol. 32, no. 3, pp. 1905–1919, 2022. [Online]. Available: https://www. techscience.com/iasc/v32n3/45915

    1905

  81. [83]

    Privacy Regulation Aware Process Mapping in Geo-Distributed Cloud Data Centers,

    A. C. Zhou, Y. Xiao, Y. Gong, B. He, J. Zhai, and R. Mao, “Privacy Regulation Aware Process Mapping in Geo-Distributed Cloud Data Centers,” IEEE Transactions on Parallel and Distributed Systems, vol. 30, no. 8, pp. 1872–1888, Aug. 2019. [Online]. Available: https://ieeexplore....

    2019

  82. [84]

    Scheduling Jobs across Geo-Distributed Datacenters with Max-Min Fairness,

    L. Chen, S. Liu, B. Li, and B. Li, “Scheduling Jobs across Geo-Distributed Datacenters with Max-Min Fairness,” IEEE Transactions on Network Science and Engineering , vol. 6, no. 3, pp. 488–500, Jul. 2019. [Online]. Available: https: //ieeexplore.ieee.org/document/8269831/

    2019

  83. [85]

    Fault-tolerant scheduling and data placement for scientific workflow processing in geo-distributed clouds,

    C. Li, J. Liu, M. Wang, and Y. Luo, “Fault-tolerant scheduling and data placement for scientific workflow processing in geo-distributed clouds,” Journal of Systems and Software , vol. 187, p. 111227, May 2022. [Online]. Available: https: //linkinghub.elsevier.com/retrieve/pii/...

    2022

  84. [86]

    Two- level task scheduling with multi-objectives in geo-distributed and large-scale SaaS cloud,

    P . Zhang, X. Ma, Y. Xiao, W. Li, and C. Lin, “Two- level task scheduling with multi-objectives in geo-distributed and large-scale SaaS cloud,” World Wide Web , vol. 22, no. 6, pp. 2291–2319, Nov. 2019. [Online]. Available: https: //doi.org/10.1007/s11280-019-00680-2

    2019 doi

  85. [87]

    Geo-Distributed IoT Data Analytics With Deadline Constraints Across Network Edge,

    Y. Chen, L. Luo, B. Ren, and D. Guo, “Geo-Distributed IoT Data Analytics With Deadline Constraints Across Network Edge,” IEEE Internet of Things Journal , vol. 9, no. 22, pp. 22 914–22 929, Nov. 2022, conference Name: IEEE Internet of Things Journal. [Online]. Available: https...

    2022

  86. [88]

    Chatziliadis, E

    X. Chatziliadis, E. T. Zacharatou, A. Eracar, S. Zeuch, and V . Markl, “Efficient Placement of Decomposable Aggregation IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XX,NO. XX, XXX. XXXX 19 Functions for Stream Processing over Large Geo-Distributed Topologies,” 2024

    2024

  87. [89]

    Compact Scheduling for Task Graph Oriented Mobile Crowdsourcing,

    L. Wang, Z. Yu, Q. Han, D. Yang, S. Pan, Y. Yao, and D. Zhang, “Compact Scheduling for Task Graph Oriented Mobile Crowdsourcing,” IEEE Transactions on Mobile Computing , pp. 1–1, 2020. [Online]. Available: https://ieeexplore.ieee.org/ document/9268126/

    2020

  88. [90]

    Scheduling Multi-Component Applications Across Federated Edge Clusters With Phare,

    G. Castellano, S. Galantino, F. Risso, and A. Manzalini, “Scheduling Multi-Component Applications Across Federated Edge Clusters With Phare,” IEEE Open Journal of the Communications Society , vol. 5, pp. 1814–1826, 2024. [Online]. Available: https://ieeexplore.ieee.org/documen...

    2024

  89. [91]

    Asynchronous Deep Reinforcement Learning for Collaborative Task Computing and On-Demand Resource Allocation in Vehicular Edge Computing,

    L. Liu, J. Feng, X. Mu, Q. Pei, D. Lan, and M. Xiao, “Asynchronous Deep Reinforcement Learning for Collaborative Task Computing and On-Demand Resource Allocation in Vehicular Edge Computing,” IEEE Transactions on Intelligent Transportation Systems , vol. 24, no. 12, pp. 15 513...

    2023

  90. [92]

    Collaborative task offloading and resource scheduling framework for heterogeneous edge computing,

    J. Ren, T. Hou, H. Wang, H. Tian, H. Wei, H. Zheng, and X. Zhang, “Collaborative task offloading and resource scheduling framework for heterogeneous edge computing,” Wireless Net- works, vol. 30, no. 5, pp. 3897–3909, Jul. 2024. [Online]. Available: https://link.springer.com/1...

    2024 doi

  91. [93]

    Distributed Task Scheduling in Serverless Edge Computing Networks for the Internet of Things: A Learning Approach,

    Q. Tang, R. Xie, F. R. Yu, T. Chen, R. Zhang, T. Huang, and Y. Liu, “Distributed Task Scheduling in Serverless Edge Computing Networks for the Internet of Things: A Learning Approach,” IEEE Internet of Things Journal , vol. 9, no. 20, pp. 19 634–19 648, Oct. 2022. [Online]. Av...

    2022

  92. [94]

    QoS Driven Task Offloading with Statistical Guarantee in Mobile Edge Computing,

    Q. Li, S. Wang, A. Zhou, X. Ma, F. Yang, and A. X. Liu, “QoS Driven Task Offloading with Statistical Guarantee in Mobile Edge Computing,” IEEE Transactions on Mobile Computing , pp. 1–1, 2020. [Online]. Available: https://ieeexplore.ieee.org/ document/9123603/

    2020

  93. [95]

    Optimizing task allocation in multi-query edge analytics,

    A.-V . Michailidou, C. Bellas, and A. Gounaris, “Optimizing task allocation in multi-query edge analytics,” Cluster Computing , Apr. 2024. [Online]. Available: https://link.springer.com/10. 1007/s10586-024-04427-1

    2024

  94. [96]

    EV-Assisted Computing for Energy Cost Saving at Edge Data Centers,

    H. Liao, G. Tang, D. Guo, K. Wu, and L. Luo, “EV-Assisted Computing for Energy Cost Saving at Edge Data Centers,” IEEE Transactions on Mobile Computing , pp. 1–13, 2024. [Online]. Available: https://ieeexplore.ieee.org/document/10415216/

    2024

  95. [97]

    Elastic Deployment of Software Containers in Geo-Distributed Computing Environments,

    F. Rossi, V . Cardellini, and F. L. Presti, “Elastic Deployment of Software Containers in Geo-Distributed Computing Environments,” in 2019 IEEE Symposium on Computers and Communications (ISCC) . Barcelona, Spain: IEEE, Jun. 2019, pp. 1–7. [Online]. Available: https://ieeexplor...

    2019

  96. [98]

    Online scheduling algorithms for unbiased distributed learning over wireless edge networks,

    J. Pang, Z. Han, R. Zhou, H. Tan, and Y. Cao, “Online scheduling algorithms for unbiased distributed learning over wireless edge networks,” Journal of Systems Architecture , vol. 131, p. 102673, Oct. 2022. [Online]. Available: https: //linkinghub.elsevier.com/retrieve/pii/S138...

    2022

  97. [99]

    Enabling Streaming Analytics in Satellite Edge Computing via Timely Evaluation of Big Data Queries,

    Z. Xu, G. Xu, H. Wang, W. Liang, Q. Xia, and S. Wang, “Enabling Streaming Analytics in Satellite Edge Computing via Timely Evaluation of Big Data Queries,” IEEE Transactions on Parallel and Distributed Systems , vol. 35, no. 1, pp. 105–122, Jan. 2024, conference Name: IEEE Tra...

    2024

  98. [100]

    Multi- Stage Geo-Distributed Data Aggregation With Coordinated Computation and Communication in Edge Compute First Networking,

    Z. Liu, X. Yuan, J. Yuan, J. Zhang, Z. Gu, and L. Zhang, “Multi- Stage Geo-Distributed Data Aggregation With Coordinated Computation and Communication in Edge Compute First Networking,” Journal of Lightwave Technology , vol. 41, no. 8, pp. 2289–2300, Apr. 2023. [Online]. Avail...

    2023

  99. [101]

    Architecture of virtual edge data center with intelligent metadata service of a geo-distributed file system,

    W. Dou, B. Liu, C. Lin, X. Wang, X. Jiang, and L. Qi, “Architecture of virtual edge data center with intelligent metadata service of a geo-distributed file system,” Journal of Systems Architecture , vol. 128, p. 102545, Jul. 2022. [Online]. Available: https: //linkinghub.elsev...

    2022

  100. [102]

    FairHealth: Long-Term Proportional Fairness-Driven 5G Edge Healthcare in Internet of Medical Things,

    X. Lin, J. Wu, A. K. Bashir, W. Yang, A. Singh, and A. A. AlZubi, “FairHealth: Long-Term Proportional Fairness-Driven 5G Edge Healthcare in Internet of Medical Things,” IEEE Transactions on Industrial Informatics , vol. 18, no. 12, pp. 8905–8915, Dec. 2022. [Online]. Available...

    2022

  101. [103]

    Cost-aware & Fault-tolerant Geo-distributed Edge Computing for Low-latency Stream Processing,

    J. Xu and B. Palanisamy, “Cost-aware & Fault-tolerant Geo-distributed Edge Computing for Low-latency Stream Processing,” in 2021 IEEE 7th International Conference on Collaboration and Internet Computing (CIC) . Atlanta, GA, USA: IEEE, Dec. 2021, pp. 117–124. [Online]. Availabl...

    2021

  102. [104]

    FTPipeHD: A Fault-Tolerant Pipeline-Parallel Distributed Training Approach for Heterogeneous Edge Devices,

    Y. Chen, Q. Yang, S. He, Z. Shi, J. Chen, and M. Guizani, “FTPipeHD: A Fault-Tolerant Pipeline-Parallel Distributed Training Approach for Heterogeneous Edge Devices,” IEEE Transactions on Mobile Computing , vol. 23, no. 4, pp. 3200– 3212, Apr. 2024. [Online]. Available: https:...

    2024

  103. [105]

    Deadline- Aware Dynamic Task Scheduling in EdgeCloud Collaborative Computing,

    Y. Zhang, B. Tang, J. Luo, and J. Zhang, “Deadline- Aware Dynamic Task Scheduling in EdgeCloud Collaborative Computing,” Electronics, vol. 11, no. 15, p. 2464, Aug. 2022. [Online]. Available: https://www.mdpi.com/2079-9292/11/15/ 2464

    2022

  104. [106]

    Efficient Deployment of Large Language Model across Cloud-Device Systems,

    F. Yang, Z. Wang, H. Zhang, Z. Zhu, X. Yang, G. Dai, and Y. Wang, “Efficient Deployment of Large Language Model across Cloud-Device Systems,” in 2024 IEEE 37th International System-on-Chip Conference (SOCC) . Dresden, Germany: IEEE, Sep. 2024, pp. 1–6. [Online]. Available: htt...

    2024

  105. [107]

    GeoClone: Online Task Replication and Scheduling for Geo-Distributed Analytics under Uncertainties,

    T. Wang, Z. Qian, L. Jiao, X. Li, and S. Lu, “GeoClone: Online Task Replication and Scheduling for Geo-Distributed Analytics under Uncertainties,” in 2020 IEEE/ACM 28th International Symposium on Quality of Service (IWQoS) . Hang Zhou, China: IEEE, Jun. 2020, pp. 1–10. [Online...

    2020

  106. [108]

    An Edge-Cloud Collaboration Framework for Generative AI Service Provision with Synergetic Big Cloud Model and Small Edge Models,

    Y. Tian, Z. Zhang, Y. Yang, Z. Chen, Z. Yang, R. Jin, T. Q. S. Quek, and K.-K. Wong, “An Edge-Cloud Collaboration Framework for Generative AI Service Provision with Synergetic Big Cloud Model and Small Edge Models,” Jan. 2024, arXiv:2401.01666 [cs]. [Online]. Available: http:/...

    2024 arXiv

  107. [109]

    ECFA: An Efficient Convergent Firefly Algorithm for Solving Task Scheduling Prob- lems in Cloud-Edge Computing,

    L. Yin, J. Sun, J. Zhou, Z. Gu, and K. Li, “ECFA: An Efficient Convergent Firefly Algorithm for Solving Task Scheduling Prob- lems in Cloud-Edge Computing,” IEEE Transactions on Services Computing, vol. 16, no. 5, pp. 3280–3293, Sep. 2023. [Online]. Available: https://ieeexplo...

    2023

  108. [110]

    Generative AI as a Service in 6G Edge- Cloud: Generation Task Offloading by In-context Learning,

    H. Zhou, C. Hu, D. Yuan, Y. Yuan, D. Wu, X. Liu, Z. Han, and C. Zhang, “Generative AI as a Service in 6G Edge- Cloud: Generation Task Offloading by In-context Learning,” Aug. 2024, arXiv:2408.02549 [cs, eess]. [Online]. Available: http://arxiv.org/abs/2408.02549

    2024 arXiv

  109. [111]

    Collaborative Service Placement, Task Scheduling, and Resource Allocation for Task Offloading With Edge- Cloud Cooperation,

    W. Fan, L. Zhao, X. Liu, Y. Su, S. Li, F. Wu, and Y. Liu, “Collaborative Service Placement, Task Scheduling, and Resource Allocation for Task Offloading With Edge- Cloud Cooperation,” IEEE Transactions on Mobile Computing , vol. 23, no. 1, pp. 238–256, Jan. 2024. [Online]. Ava...

    2024

  110. [112]

    Dynamic Task Scheduling in Cloud-Assisted Mobile Edge Computing,

    X. Ma, A. Zhou, S. Zhang, Q. Li, A. X. Liu, and S. Wang, “Dynamic Task Scheduling in Cloud-Assisted Mobile Edge Computing,” IEEE Transactions on Mobile Computing , vol. 22, no. 4, pp. 2116–2130, Apr. 2023. [Online]. Available: https://ieeexplore.ieee.org/document/9547734/

    2023

  111. [113]

    Geo- distributed efficient deployment of containers with Kubernetes,

    F. Rossi, V . Cardellini, F. Lo Presti, and M. Nardelli, “Geo- distributed efficient deployment of containers with Kubernetes,” Computer Communications , vol. 159, pp. 161–174, Jun. 2020. [Online]. Available: https://linkinghub.elsevier.com/retrieve/ pii/S0140366419317931

    2020

  112. [114]

    Efficient Flow-Based Scheduling for Geo-Distributed Simulation Tasks in Collaborative Edge and Cloud Environments,

    Z. Miao, P . Yong, Z. Jiancheng, and Y. Quanjun, “Efficient Flow-Based Scheduling for Geo-Distributed Simulation Tasks in Collaborative Edge and Cloud Environments,” IEEE Transactions on Parallel and Distributed Systems , vol. 33, no. 12, pp. 3442–3459, Dec. 2022. [Online]. Av...

    2022

  113. [115]

    A TTL-based Approach for Data Aggregation in Geo-distributed Streaming Analytics,

    D. Kumar, J. Li, A. Chandra, and R. K. Sitaraman, “A TTL-based Approach for Data Aggregation in Geo-distributed Streaming Analytics,” vol. 3, no. 2

  114. [116]

    AggNet: Cost-Aware Aggregation Networks for Geo-distributed Stream- ing Analytics

    D. Kumar, A. Chandra, S. Ahmad, and R. K. Sitaraman, “AggNet: Cost-Aware Aggregation Networks for Geo-distributed Stream- ing Analytics.”

  115. [117]

    NBSync: Parallelism of Local Computing and Global Synchronization for Fast Distributed Machine Learning in WANs,

    H. Zhou, Z. Li, H. Yu, L. Luo, and G. Sun, “NBSync: Parallelism of Local Computing and Global Synchronization for Fast Distributed Machine Learning in WANs,” IEEE IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XX,NO. XX, XXX. XXXX 20 Transactions on Services Computi...

    2023

  116. [118]

    run runData: Re-Distributing Data via Piggybacking for Geo-Distributed Data Analytics Over Edges,

    Y. Jin, Z. Qian, S. Guo, S. Zhang, L. Jiao, and S. Lu, “run runData: Re-Distributing Data via Piggybacking for Geo-Distributed Data Analytics Over Edges,” IEEE Transactions on Parallel and Distributed Systems , vol. 33, no. 1, pp. 40–55, Jan. 2022, conference Name: IEEE Transa...

    2022

  117. [119]

    Time-continuous computing offloading algorithm with user fairness guarantee,

    H. Hao, W. Ding, and W. Zhang, “Time-continuous computing offloading algorithm with user fairness guarantee,” Journal of Network and Computer Applications, vol. 223, p. 103826, Mar. 2024. [Online]. Available: https://linkinghub.elsevier.com/retrieve/ pii/S1084804524000031

    2024

  118. [120]

    OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds,

    Z. Han, H. Tan, X.-Y. Li, S. H.-C. Jiang, Y. Li, and F. C. M. Lau, “OnDisc: Online Latency-Sensitive Job Dispatching and Scheduling in Heterogeneous Edge-Clouds,” IEEE/ACM Transactions on Networking , vol. 27, no. 6, pp. 2472–2485, Dec. 2019. [Online]. Available: https://ieeex...

    2019

  119. [121]

    IoTEF: A Federated Edge-Cloud Architecture for Fault-Tolerant IoT Applications,

    A. Javed, J. Robert, K. Heljanko, and K. Frmling, “IoTEF: A Federated Edge-Cloud Architecture for Fault-Tolerant IoT Applications,” Journal of Grid Computing , vol. 18, no. 1, pp. 57–80, Mar. 2020. [Online]. Available: http://link.springer.com/ 10.1007/s10723-019-09498-8

    2020 doi

  120. [122]

    QoS-Aware Task Placement With Fault-Tolerance in the Edge-Cloud,

    H. Sun, H. Yu, G. Fan, and L. Chen, “QoS-Aware Task Placement With Fault-Tolerance in the Edge-Cloud,” IEEE Access, vol. 8, pp. 77 987–78 003, 2020. [Online]. Available: https://ieeexplore.ieee.org/document/9017972/

    2020

  121. [123]

    Accelerate Supercomputing through Cross-Region Interconnection,

    J. Han, W. Zhang, H. Shi, Y. Zhou, C. Tang, and J. Pan, “Accelerate Supercomputing through Cross-Region Interconnection,” in 2022 IEEE Smartworld, Ubiquitous Intelligence & Computing, Scalable Computing & Communications, Digital Twin, Privacy Computing, Metaverse, Autonomous &...

    2022

  122. [124]

    Efficient in-situ workflow planning for geographically distributed heterogeneous environments,

    F. Li and F. Song, “Efficient in-situ workflow planning for geographically distributed heterogeneous environments,” Future Generation Computer Systems , vol. 149, pp. 105–121, Dec. 2023. [Online]. Available: https://linkinghub.elsevier.com/retrieve/ pii/S0167739X23002601

    2023

  123. [127]

    ExaLB: a mathematical framework for load balancing to support distributed exascale computing environments,

    F. Mollasalehi, E. M. Khaneghah, A. R. Showkatabadi, S. A. Seyednejad, and F. Gholamrezaie, “ExaLB: a mathematical framework for load balancing to support distributed exascale computing environments,” CCF Transactions on High Performance Computing, vol. 5, no. 4, pp. 390–415, ...

    2023 doi

  124. [129]

    Deep Reinforcement Learning Enhanced Greedy Algorithm for Online Scheduling of Batched Tasks in Cloud in Cloud HPC Systems,

    Y. Yang and H. Shen, “Deep Reinforcement Learning Enhanced Greedy Algorithm for Online Scheduling of Batched Tasks in Cloud in Cloud HPC Systems,” IEEE Transactions on Parallel and Distributed Systems , pp. 1–1, 2021. [Online]. Available: https://ieeexplore.ieee.org/document/9664254/

    2021

  125. [132]

    Research on performance optimization of virtual data space across WAN,

    J. Huo, Z. Huo, L. Xiao, and Z. He, “Research on performance optimization of virtual data space across WAN,” Frontiers of Computer Science , vol. 18, no. 6, p. 186505, Dec. 2024. [Online]. Available: https://link.springer.com/10.1007/s11704-023-3087-8

    2024 doi

  126. [136]

    Santa mode & video in advanced voice - 12 days of openai: Day 6,

    K. Weil, J. Shannon, M. Qin, and R. Zellers, “Santa mode & video in advanced voice - 12 days of openai: Day 6,” https://www.youtube.com/watch?v=NIQDnWlwYyQ, 2024, accessed: 2025-01-21. [Online]. Available: https://www.youtube. com/watch?v=NIQDnWlwYyQ

    2024

  127. [137]

    1-800-chat-gpt - 12 days of openai: Day 10,

    K. Weil, A. Woodford, and A. Crookes, “1-800-chat-gpt - 12 days of openai: Day 10,” https://www.youtube.com/watch?v= LWa6OHeNK3s, 2024, accessed: 2025-01-21. [Online]. Available: https://www.youtube.com/watch?v=LWa6OHeNK3s

    2024

  128. [2024]

    Available: https://www.frontiersin.org/articles/ 10.3389/fenrg.2024.1344837/full

    [Online]. Available: https://www.frontiersin.org/articles/ 10.3389/fenrg.2024.1344837/full

    2024

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.