Skip to content Skip to navigation
University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • |
  • About

University of Warwick
Publications service & WRAP

Highlight your research

  • WRAP
    • Home
    • Search WRAP
    • Browse by Warwick Author
    • Browse WRAP by Year
    • Browse WRAP by Subject
    • Browse WRAP by Department
    • Browse WRAP by Funder
    • Browse Theses by Department
  • Publications Service
    • Home
    • Search Publications Service
    • Browse by Warwick Author
    • Browse Publications service by Year
    • Browse Publications service by Subject
    • Browse Publications service by Department
    • Browse Publications service by Funder
  • Statistics
  • Help & Advice
University of Warwick

The Library

  • Login

A scheduling algorithm for revenue maximisation for cluster-based Internet services

Tools
- Tools
+ Tools

Xue, James W. J., He, Ligang and Jarvis, Stephen A. (2007) A scheduling algorithm for revenue maximisation for cluster-based Internet services. In: International Conference on Parallel and Distributed Systems, Hsinchu, TAIWAN, DEC 05-07, 2007. Published in: 2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2 pp. 853-860.

Full text not available from this repository.

Abstract

This paper proposes a new priority scheduling algorithm to maximise site revenue of session-based multi-tier Internet services in a multicluster environment. This research is part of a larger study in support of large-scale online trading systems and, as a result, this case study is chosen as a demonstrator for the techniques presented in this paper The trading system is partitioned into a number of operations (trade, query etc.), which by their very nature are divided into orders of importance in terms of transactional response. The algorithm in this paper is based on Mean Value Analysis (MVA), which is used for the calculation of performance metrics concerning the queuing networks and workload allocation decision support in the multicluster In addition to this, the priority assignment is based on combination of three attributes of any given request: (i) the sender class; (ii) the operation and, (iii) the status of the user's portfolio (i. e.number of items in the user's portfolio). A discrete event simulator has been developed to evaluate the performance of the priority scheduling scheme with different combinations of request attributes in various experimental scenarios. Our study aims to develop a dynamic scheduling policy, which takes into account real-time system parameters and optimises the site revenue. Although our priority scheduling algorithm is designed for an online trading system, it can be applied to most e-Commerce systems in which differentiated services are required.

Item Type: Conference Item (UNSPECIFIED)
Subjects: Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
Series Name: International Conference on Parallel and Distributed Systems - Proceedings
Journal or Publication Title: 2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2
Publisher: IEEE
ISBN: 978-1-4244-1889-3
ISSN: 1521-9097
Date: 2007
Number of Pages: 8
Page Range: pp. 853-860
Identification Number: 10.1109/ICPADS.2007.4447841
Publication Status: Published
Title of Event: International Conference on Parallel and Distributed Systems
Location of Event: Hsinchu, TAIWAN
Date(s) of Event: DEC 05-07, 2007
URI: http://wrap.warwick.ac.uk/id/eprint/29858

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item View Item
twitter

Email us: publications@warwick.ac.uk
Contact Details
About Us