Nash Equilibrium Based Task Scheduling Algorithm of Multi-schedulers in Grid Computing

YI Kan; WANG Ru-chuan

您当前的位置：

首页 >

文章列表页 >

Nash Equilibrium Based Task Scheduling Algorithm of Multi-schedulers in Grid Computing

更新时间：2025-07-16

- Nash Equilibrium Based Task Scheduling Algorithm of Multi-schedulers in Grid Computing
- Acta Electronica Sinica Vol. 37, Issue 2, Pages: 329-333(2009)
- 作者机构：
  
  1. 南京邮电大学计算机学院,江苏,南京,210003
  2. State Key Laboratory for Novel Software Technology at Nanjing University,Jiangsu,Nanjing,China,210093
  3. 南京邮电大学计算机学院江苏南京,210003
  4. State Key Laboratory for Novel Software Technology at Nanjing UniversityNanjingJiangsu 210093China
- 作者简介：
- 基金信息：
- DOI：
  CLC： TP393
- Published：2009
- 稿件说明：
移动端阅览
YI Kan, WANG Ru-chuan. Nash Equilibrium Based Task Scheduling Algorithm of Multi-schedulers in Grid Computing[J]. Acta Electronica Sinica, 2009, 37(2): 329-333.
DOI：

YI Kan, WANG Ru-chuan. Nash Equilibrium Based Task Scheduling Algorithm of Multi-schedulers in Grid Computing[J]. Acta Electronica Sinica, 2009, 37(2): 329-333. DOI：

摘要

目前网格任务调度算法主要是针对1×

型即单调度节点多资源的网格环境

而针对

m×n

型的网格环境研究较少.论文用

M/M/1排队系统对m×n

型网格环境建模

然后以每个调度节点调度任务的平均完成时间为优化目标

提出了

m×n

型网格环境任务调度的Nash均衡问题

并利用粒子群算法求得该Nash均衡解.通过仿真验证了该算法在单位时间内平均完成的任务数

网络平均负载

以及系统的平均负载上均优于基于均匀调度策略的调度算法.

Abstract

At present

grid task scheduling Algorithms focus on 1×

type grid

namely one scheduler and

resources but neglect

m×n

type grid.We built a Grid model of

m×n

type grid using

M/M/1

queue system

and promoted the concept of task scheduling Nash equilibrium among multi-schedulers.The optimal objective of each scheduler is mean complete time per task.The Nash equilibrium took advantage of PSO to be solved.By simulations

we conclude that the new algorithm is better than the algorithm based on the mean scheduling strategies in mean finished task numbers per time

mean load of network and mean load of Grid resources.

关键词

Keywords

references

Views

1571

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Task Segmentation and Path Optimization in Heterogeneous Cloud-Edge-End Computing Power Network

Task Scheduling Algorithm Based on Dynamic Potential Game for Edge Compute First Networking

A Dynamic Task Scheduling for Wireless Sensor and Actuator Networks

Related Author

MA Bo

YU Ying-jie

WU Sha-chen

NI Chang

LU Qin

CHEN Chao

LI Chuan-huang

ZHANG Jing

Related Institution

School of Information and Electronic Engineering, Zhejiang Gongshang University

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications

College of Computer ScienceSoochow UniversitySuzhouJiangsu 215006China

College of Computer Science,Soochow University

南京邮电大学宽带无线通信与传感网技术教育部重点实验室

⁰