Efficient task scheduling for large-scale graph data processing in cloud computing: a particle swarm optimization approach

DOI10.61091/JCMCC122-11MaRDI QIDQ6625085

Rui Shang

Publication date: 28 October 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

task schedulingparticle swarm optimizationcloud computingefficiency optimizationlarge-scale graph data

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computer system organization (68Mxx)

Cites Work

• The appropriate scale of competition between online taxis and taxis based on the Lotka-Volterra evolutionary model

This page was built for publication: Efficient task scheduling for large-scale graph data processing in cloud computing: a particle swarm optimization approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6625085)