JOURNAL ARTICLE

Utility-based Computing Model for Grid

Abstract

Within service-oriented Grids, resources may be advertised and traded as services and participants need to have economic incentive. Grid can be seen as a multi-agent system, agent are rational and state their QoS requirements in the form of a utility function which maximize is his goal. In this paper, we propose utility-based computing model for grid. We consider the problem of task scheduling subject to time and budget constrains as joint utility function, and scheduling object is to maximize total attained utility. This scheduling problem can be shown to be NP-hard, thus we present a joint utility function scheduling algorithm (JUFS) for this problem. The performance of model is analyzed by SPNP software package. The numerical results show that JUFS can provide user more utility.

Keywords:
Computer science Grid computing Grid Distributed computing Scheduling (production processes) Dynamic priority scheduling Fair-share scheduling Job shop scheduling Quality of service Mathematical optimization Schedule Operating system Computer network

Metrics

5
Cited By
0.27
FWCI (Field Weighted Citation Impact)
9
Refs
0.65
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Distributed and Parallel Computing Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Parallel Computing and Optimization Techniques
Physical Sciences →  Computer Science →  Hardware and Architecture
Distributed systems and fault tolerance
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.