Lower bounds for constrained task allocation problem in distributed computing environment

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

1 Scopus citations

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

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Lower bounds for constrained task allocation problem in distributed computing environment'. Together they form a unique fingerprint.

Cite this