Improved scheduling in rings

Dekel Tsur

doi:10.1016/j.jpdc.2007.02.002

Improved scheduling in rings

Dekel Tsur

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of frac(3, 2) + sqrt(2).

Original language	English
Pages (from-to)	531-535
Number of pages	5
Journal	Journal of Parallel and Distributed Computing
Volume	67
Issue number	5
DOIs	https://doi.org/10.1016/j.jpdc.2007.02.002
State	Published - 1 May 2007

Keywords

Approximation algorithms
Scheduling

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Artificial Intelligence

Access to Document

10.1016/j.jpdc.2007.02.002

Cite this

@article{bfb81b313b724280ab6d8434565f7ac1,

title = "Improved scheduling in rings",

abstract = "We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of frac(3, 2) + sqrt(2).",

keywords = "Approximation algorithms, Scheduling",

author = "Dekel Tsur",

year = "2007",

month = may,

day = "1",

doi = "10.1016/j.jpdc.2007.02.002",

language = "English",

volume = "67",

pages = "531--535",

journal = "Journal of Parallel and Distributed Computing",

issn = "0743-7315",

publisher = "Academic Press Inc.",

number = "5",

}

TY - JOUR

T1 - Improved scheduling in rings

AU - Tsur, Dekel

PY - 2007/5/1

Y1 - 2007/5/1

N2 - We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of frac(3, 2) + sqrt(2).

AB - We study the problem of scheduling unit size jobs on n processors connected by a ring. We show a distributed algorithm for this problem with an approximation ratio of frac(3, 2) + sqrt(2).

KW - Approximation algorithms

KW - Scheduling

UR - https://www.scopus.com/pages/publications/34047157779

U2 - 10.1016/j.jpdc.2007.02.002

DO - 10.1016/j.jpdc.2007.02.002

M3 - Article

AN - SCOPUS:34047157779

SN - 0743-7315

VL - 67

SP - 531

EP - 535

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

IS - 5

ER -

Improved scheduling in rings

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this