Online Scheduling in Distributed Message Converter Systems

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

    Research output: Contribution to conferencePaper

    13 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

    Keywords

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

    Cite this

    Risse, T., Wombacher, A., Surridge, M., Taylor, S., & Aberer, K. (2001). Online Scheduling in Distributed Message Converter Systems. 177-184.
    Risse, Thomas ; Wombacher, Andreas ; Surridge, Mike ; Taylor, Steve ; Aberer, Karl. / Online Scheduling in Distributed Message Converter Systems. 11 p.
    @conference{021cd3c781dd4c36a04ece67c46addd6,
    title = "Online Scheduling in Distributed Message Converter Systems",
    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.",
    keywords = "Load Balancing, Parallel/Distributed Computing Systems, Task Scheduling, EWI-10615, Performance Evaluation and Measurements, IR-64225",
    author = "Thomas Risse and Andreas Wombacher and Mike Surridge and Steve Taylor and Karl Aberer",
    year = "2001",
    month = "8",
    language = "Undefined",
    pages = "177--184",

    }

    Risse, T, Wombacher, A, Surridge, M, Taylor, S & Aberer, K 2001, 'Online Scheduling in Distributed Message Converter Systems' pp. 177-184.

    Online Scheduling in Distributed Message Converter Systems. / Risse, Thomas; Wombacher, Andreas; Surridge, Mike; Taylor, Steve; Aberer, Karl.

    2001. 177-184.

    Research output: Contribution to conferencePaper

    TY - CONF

    T1 - Online Scheduling in Distributed Message Converter Systems

    AU - Risse, Thomas

    AU - Wombacher, Andreas

    AU - Surridge, Mike

    AU - Taylor, Steve

    AU - Aberer, Karl

    PY - 2001/8

    Y1 - 2001/8

    N2 - 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.

    AB - 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.

    KW - Load Balancing

    KW - Parallel/Distributed Computing Systems

    KW - Task Scheduling

    KW - EWI-10615

    KW - Performance Evaluation and Measurements

    KW - IR-64225

    M3 - Paper

    SP - 177

    EP - 184

    ER -

    Risse T, Wombacher A, Surridge M, Taylor S, Aberer K. Online Scheduling in Distributed Message Converter Systems. 2001.