The University of Southampton
University of Southampton Institutional Repository

Online Scheduling in Distributed Message Converter Systems

Online Scheduling in Distributed Message Converter Systems
Online Scheduling in Distributed Message Converter Systems
The optimal distribution of jobs among hosts in distributed environments is an important factor to achieve high performance. The optimal strategy depends on the application. In this paper we present a new online scheduling strategy for distributed EDI converter system. The strategy is based on the Bin-Stretching approach. The original algorithm has been enhanced to satisfy the business goals of meeting deadlines, priority processing, low response time and high throughput. The algorithm can be flexible adapted to different objective goals due to its two-stage strategy. We show by simulation and measurements on a real system that the modified Bin-Stretching approach fulfills the objective goals while requiring only low computational effort.
Online scheduling, load balancing, distributed message conversion, performance measurement
177-184
Risse, Thomas
4a491b46-c60d-4b27-9aba-7e8e2c6373b6
Wombacher, Andreas
807da29c-2bf7-49cc-b27c-4e9877e52b2c
Surridge, Mike
3bd360fa-1962-4992-bb16-12fc4dd7d9a9
Taylor, Steve
9ee68548-2096-4d91-a122-bbde65f91efb
Aberer, Karl
1d79d3bf-686a-4fab-a8f3-88607fd6fb7d
Risse, Thomas
4a491b46-c60d-4b27-9aba-7e8e2c6373b6
Wombacher, Andreas
807da29c-2bf7-49cc-b27c-4e9877e52b2c
Surridge, Mike
3bd360fa-1962-4992-bb16-12fc4dd7d9a9
Taylor, Steve
9ee68548-2096-4d91-a122-bbde65f91efb
Aberer, Karl
1d79d3bf-686a-4fab-a8f3-88607fd6fb7d

Risse, Thomas, Wombacher, Andreas, Surridge, Mike, Taylor, Steve and Aberer, Karl (2001) Online Scheduling in Distributed Message Converter Systems. Parallel and Distributed Computing Systems (PDCS 2001), Anaheim,, United States. 20 - 23 Aug 2001. pp. 177-184 .

Record type: Conference or Workshop Item (Other)

Abstract

The optimal distribution of jobs among hosts in distributed environments is an important factor to achieve high performance. The optimal strategy depends on the application. In this paper we present a new online scheduling strategy for distributed EDI converter system. The strategy is based on the Bin-Stretching approach. The original algorithm has been enhanced to satisfy the business goals of meeting deadlines, priority processing, low response time and high throughput. The algorithm can be flexible adapted to different objective goals due to its two-stage strategy. We show by simulation and measurements on a real system that the modified Bin-Stretching approach fulfills the objective goals while requiring only low computational effort.

Text
2001-PDCS2001.pdf - Other
Download (114kB)

More information

Published date: 2001
Additional Information: Event Dates: 21-24 August 2001
Venue - Dates: Parallel and Distributed Computing Systems (PDCS 2001), Anaheim,, United States, 2001-08-20 - 2001-08-23
Keywords: Online scheduling, load balancing, distributed message conversion, performance measurement
Organisations: Electronics & Computer Science, IT Innovation

Identifiers

Local EPrints ID: 257291
URI: http://eprints.soton.ac.uk/id/eprint/257291
PURE UUID: 3d643f08-319d-48d1-b73b-f459fc90991e
ORCID for Steve Taylor: ORCID iD orcid.org/0000-0002-9937-1762

Catalogue record

Date deposited: 21 Mar 2003
Last modified: 18 Feb 2021 16:51

Export record

Contributors

Author: Thomas Risse
Author: Andreas Wombacher
Author: Mike Surridge
Author: Steve Taylor ORCID iD
Author: Karl Aberer

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×