Home > Research > Publications & Outputs > Exploiting incomplete information to manage mul...

Research

Links

Text available via DOI:

Keywords

View graph of relations

Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

Standard

Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. / Dell'Olmo, Paolo; Iovanella, Antonio; Lulli, Guglielmo et al.
In: Computers and Operations Research, Vol. 35, No. 5, 05.2008, p. 1589-1600.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Harvard

Dell'Olmo, P, Iovanella, A, Lulli, G & Scoppola, B 2008, 'Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates', Computers and Operations Research, vol. 35, no. 5, pp. 1589-1600. https://doi.org/10.1016/j.cor.2006.09.005

APA

Dell'Olmo, P., Iovanella, A., Lulli, G., & Scoppola, B. (2008). Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. Computers and Operations Research, 35(5), 1589-1600. https://doi.org/10.1016/j.cor.2006.09.005

Vancouver

Dell'Olmo P, Iovanella A, Lulli G, Scoppola B. Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. Computers and Operations Research. 2008 May;35(5):1589-1600. Epub 2006 Oct 18. doi: 10.1016/j.cor.2006.09.005

Author

Dell'Olmo, Paolo ; Iovanella, Antonio ; Lulli, Guglielmo et al. / Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates. In: Computers and Operations Research. 2008 ; Vol. 35, No. 5. pp. 1589-1600.

Bibtex

@article{3beb672700cd49ee8bad1a4b616fe556,
title = "Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates",
abstract = "In this paper a semi-online algorithm for scheduling multiprocessor tasks with partial information is proposed. We consider the case in which it is possible to exploit probabilistic information and use this information to obtain better solutions in comparison with standard non clairvoyant on-line algorithms. A wide computational analysis shows the effectiveness of our algorithm. Moreover, we also consider a test framework with a continuous generation of tasks in order to study the behavior of the proposed approach in real applications, which confirms the efficiency of our approach. ",
keywords = "Computational analysis, Multiprocessor task scheduling, Semi-online algorithm",
author = "Paolo Dell'Olmo and Antonio Iovanella and Guglielmo Lulli and Benedetto Scoppola",
year = "2008",
month = may,
doi = "10.1016/j.cor.2006.09.005",
language = "English",
volume = "35",
pages = "1589--1600",
journal = "Computers and Operations Research",
issn = "0305-0548",
publisher = "Elsevier Ltd",
number = "5",

}

RIS

TY - JOUR

T1 - Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates

AU - Dell'Olmo, Paolo

AU - Iovanella, Antonio

AU - Lulli, Guglielmo

AU - Scoppola, Benedetto

PY - 2008/5

Y1 - 2008/5

N2 - In this paper a semi-online algorithm for scheduling multiprocessor tasks with partial information is proposed. We consider the case in which it is possible to exploit probabilistic information and use this information to obtain better solutions in comparison with standard non clairvoyant on-line algorithms. A wide computational analysis shows the effectiveness of our algorithm. Moreover, we also consider a test framework with a continuous generation of tasks in order to study the behavior of the proposed approach in real applications, which confirms the efficiency of our approach.

AB - In this paper a semi-online algorithm for scheduling multiprocessor tasks with partial information is proposed. We consider the case in which it is possible to exploit probabilistic information and use this information to obtain better solutions in comparison with standard non clairvoyant on-line algorithms. A wide computational analysis shows the effectiveness of our algorithm. Moreover, we also consider a test framework with a continuous generation of tasks in order to study the behavior of the proposed approach in real applications, which confirms the efficiency of our approach.

KW - Computational analysis

KW - Multiprocessor task scheduling

KW - Semi-online algorithm

U2 - 10.1016/j.cor.2006.09.005

DO - 10.1016/j.cor.2006.09.005

M3 - Journal article

AN - SCOPUS:34748923525

VL - 35

SP - 1589

EP - 1600

JO - Computers and Operations Research

JF - Computers and Operations Research

SN - 0305-0548

IS - 5

ER -