Online Scheduling in Distributed Message Converter Systems

Thomas Risse, Andreas Wombacher, Mike Surridge, Steve Taylor, Karl Aberer

    Research output: Contribution to conferencePaperpeer-review

    16 Downloads (Pure)

    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.
    Original languageUndefined
    Pages177-184
    Number of pages11
    Publication statusPublished - Aug 2001
    Event13th International Conference on Parallel and Distributed Computing and Systems, PDCS 2001 - Anaheim, CA, USA
    Duration: 21 Aug 200124 Aug 2001

    Conference

    Conference13th International Conference on Parallel and Distributed Computing and Systems, PDCS 2001
    Period21/08/0124/08/01
    Other21-24 August 2001

    Keywords

    • Load Balancing
    • Parallel/Distributed Computing Systems
    • Task Scheduling
    • EWI-10615
    • Performance Evaluation and Measurements
    • IR-64225

    Cite this