Communications of the ACM
On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Product Form and Local Balance in Queueing Networks
Journal of the ACM (JACM)
IEEE Transactions on Parallel and Distributed Systems
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Multiple-queue backfilling scheduling with priorities and reservations for parallel systems
ACM SIGMETRICS Performance Evaluation Review
Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing
IEEE Transactions on Parallel and Distributed Systems
Introduction to Algorithms
Job Scheduling Under the Portable Batch System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Core Algorithms of the Maui Scheduler
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
Bandwidth-Centric Allocation of Independent Tasks on Heterogeneous Platforms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Conductance and congestion in power law graphs
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Agent-Based Grid Load Balancing Using Performance-Driven Task Scheduling
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
A De-Centralized Scheduling and Load Balancing Algorithm for Heterogeneous Grid Environments
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
ADAPTLOAD: Effective Balancing in Custered Web Servers Under Transient Load Conditions
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
DBGlobe: a service-oriented P2P system for global computing
ACM SIGMOD Record
BOINC: A System for Public-Resource Computing and Storage
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Discouraging Free Riding in a Peer-to-Peer CPU-Sharing Grid
HPDC '04 Proceedings of the 13th IEEE International Symposium on High Performance Distributed Computing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
SP2A: a service-oriented framework for P2P-based Grids
MGC '05 Proceedings of the 3rd international workshop on Middleware for grid computing
Design and Evaluation of a Decentralized System for Grid-wide Fairshare Scheduling
E-SCIENCE '05 Proceedings of the First International Conference on e-Science and Grid Computing
CoMon: a mostly-scalable monitoring system for PlanetLab
ACM SIGOPS Operating Systems Review
Systematic topology analysis and generation using degree correlations
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Concurrency and Computation: Practice & Experience - Grid and Cooperative Computing (GCC2004)
Agent-Based Autonomous Scheduling Mechanism Using Availability in Desktop Grid Systems
CIC '06 Proceedings of the 15th International Conference on Computing
The portable batch scheduler and the maui scheduler on linux clusters
ALS'00 Proceedings of the 4th annual Linux Showcase & Conference - Volume 4
A provisioning model and its comparison with best-effort for performance-cost optimization in grids
Proceedings of the 16th international symposium on High performance distributed computing
Observing the evolution of internet as topology
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Optimizing server placement in hierarchical grid environments
The Journal of Supercomputing
Adaptive Allocation of Independent Tasks to Maximize Throughput
IEEE Transactions on Parallel and Distributed Systems
Centralized versus distributed schedulers for multiple bag-of-task applications
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Queuing network of scale free topology: on modelling large scale network
The Journal of Supercomputing
Hi-index | 0.00 |
This paper addresses the scheduling problem in decentralized grid systems. Such problem focuses on computing a large set of arbitrary tasks to optimize the system performance while minimizing the average system costs. The mainstream solution flourished in recent literatures is to maximize the total system throughput by modeling such systems in either a network flow or a tree. However, most of them neglect the movements of tasks and load-dependent system costs which, in fact, are crucial to the system performance in real situations. In this paper, a Service-Oriented Overlay Network (SOON) is presented, in which the service nodes encapsulate both computation and communication resources and the links are used to track the movements of tasks instead of describing communication. An analytical Cost-Charge (C2) model, in which both running cost and service charge are dependent on load, is proposed to describe the problem by incorporating degree-dependent task allocation into a closed queuing network model. The Infinitesimal Perturbation Analysis (IPA) is applied to solve C2 theoretically. Following the theoretical analysis, a scalable decentralized scheduler named Liana (the movements of tasks in the proposed system like the growth and spread of evergreen liana, so we use Liana to name the proposed scheduler) is proposed. The major components of Liana are an autonomous scheduling algorithm and a Degree-Driven Protocol (DDP). Furthermore, trace based simulations on the test bed distributed widely across the world are implemented to compare the system performance by Liana with recent approaches. The proposed approach shows promising results that the close-to-optimal service utilization is achieved when taking system cost into account.