Lower bounds for constrained task allocation problem in distributed computing environment

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper, we propose three lower bounds to the constrained task allocation problem (CTAP). These three lower bounds are: a heuristic lower bound (HLB), a linear programming relaxation (LPR) lower bound and a lagrangean relaxation with subgradient optimization (LRSO) based lower bound. We empirically compare the performance of these three bounds under different task executing times. Our experiments with real-world CTAPs indicate that the LPR provides efficient and tight lower bounds for the CTAP.

Original languageEnglish (US)
Title of host publication2012 25th IEEE Canadian Conference on Electrical and Computer Engineering
Subtitle of host publicationVision for a Greener Future, CCECE 2012
DOIs
StatePublished - Dec 7 2012
Event2012 25th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2012 - Montreal, QC, Canada
Duration: Apr 29 2012May 2 2012

Publication series

Name2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012

Other

Other2012 25th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2012
CountryCanada
CityMontreal, QC
Period4/29/125/2/12

Fingerprint

Distributed computer systems
Linear programming
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Electrical and Electronic Engineering

Cite this

Pendharkar, P. C. (2012). Lower bounds for constrained task allocation problem in distributed computing environment. In 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012 [6335052] (2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012). https://doi.org/10.1109/CCECE.2012.6335052
Pendharkar, Parag C. / Lower bounds for constrained task allocation problem in distributed computing environment. 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012. 2012. (2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012).
@inproceedings{7ce4a416a9674f1cb5475e03ed1eb313,
title = "Lower bounds for constrained task allocation problem in distributed computing environment",
abstract = "In this paper, we propose three lower bounds to the constrained task allocation problem (CTAP). These three lower bounds are: a heuristic lower bound (HLB), a linear programming relaxation (LPR) lower bound and a lagrangean relaxation with subgradient optimization (LRSO) based lower bound. We empirically compare the performance of these three bounds under different task executing times. Our experiments with real-world CTAPs indicate that the LPR provides efficient and tight lower bounds for the CTAP.",
author = "Pendharkar, {Parag C.}",
year = "2012",
month = "12",
day = "7",
doi = "10.1109/CCECE.2012.6335052",
language = "English (US)",
isbn = "9781467314336",
series = "2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012",
booktitle = "2012 25th IEEE Canadian Conference on Electrical and Computer Engineering",

}

Pendharkar, PC 2012, Lower bounds for constrained task allocation problem in distributed computing environment. in 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012., 6335052, 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012, 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2012, Montreal, QC, Canada, 4/29/12. https://doi.org/10.1109/CCECE.2012.6335052

Lower bounds for constrained task allocation problem in distributed computing environment. / Pendharkar, Parag C.

2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012. 2012. 6335052 (2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Lower bounds for constrained task allocation problem in distributed computing environment

AU - Pendharkar, Parag C.

PY - 2012/12/7

Y1 - 2012/12/7

N2 - In this paper, we propose three lower bounds to the constrained task allocation problem (CTAP). These three lower bounds are: a heuristic lower bound (HLB), a linear programming relaxation (LPR) lower bound and a lagrangean relaxation with subgradient optimization (LRSO) based lower bound. We empirically compare the performance of these three bounds under different task executing times. Our experiments with real-world CTAPs indicate that the LPR provides efficient and tight lower bounds for the CTAP.

AB - In this paper, we propose three lower bounds to the constrained task allocation problem (CTAP). These three lower bounds are: a heuristic lower bound (HLB), a linear programming relaxation (LPR) lower bound and a lagrangean relaxation with subgradient optimization (LRSO) based lower bound. We empirically compare the performance of these three bounds under different task executing times. Our experiments with real-world CTAPs indicate that the LPR provides efficient and tight lower bounds for the CTAP.

UR - http://www.scopus.com/inward/record.url?scp=84870474974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870474974&partnerID=8YFLogxK

U2 - 10.1109/CCECE.2012.6335052

DO - 10.1109/CCECE.2012.6335052

M3 - Conference contribution

AN - SCOPUS:84870474974

SN - 9781467314336

T3 - 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012

BT - 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering

ER -

Pendharkar PC. Lower bounds for constrained task allocation problem in distributed computing environment. In 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012. 2012. 6335052. (2012 25th IEEE Canadian Conference on Electrical and Computer Engineering: Vision for a Greener Future, CCECE 2012). https://doi.org/10.1109/CCECE.2012.6335052