1992•Unpublished venueRequires access

Competitive distributed job scheduling (extended abstract)

Baruch Awerbuch, Shay Kutten, David Peleg

Abstract

This paper examines the problem of balancing the job load in a network of processors, and introduces an online algorithm for scheduling a sequence of jobs in a competitive manner. The algorithm is shown to be polylog (n)-competitive according to a strict definition that forces the online algorithm to be competitive even when considering any bounded area of the network and bounded period of time.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 56 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Competitive analysis, Computer science, Bounded function, Online algorithm, Scheduling (production processes), Job shop scheduling, Distributed computing, Processor scheduling