UPM Institutional Repository

Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique


Citation

Al-Ewiwi, Mahmoud (2006) Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique. Masters thesis, Universiti Putra Malaysia.

Abstract

Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. Each of these agents is connected directly to a different scheduling server. These agents work cooperatively with each other through the Internet using message exchanging.An improved algorithm was implemented to decrease the amount of message exchanging between agents, which increased the performance of the system.


Download File

[img]
Preview
PDF
549082_t_fsktm_2006_2.pdf

Download (135kB)

Additional Metadata

Item Type: Thesis (Masters)
Subject: Web servers - Computer algorithms
Subject: Computer network resources
Call Number: FSKTM 2006 2
Chairman Supervisor: Rozita Binti Johari, PhD
Divisions: Faculty of Computer Science and Information Technology
Depositing User: Users 12 not found.
Date Deposited: 15 May 2008 00:58
Last Modified: 27 May 2013 06:45
URI: http://psasir.upm.edu.my/id/eprint/129
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item