TY - GEN
T1 - Lower bounds for constrained task allocation problem in distributed computing environment
AU - Pendharkar, Parag C.
PY - 2012
Y1 - 2012
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
T2 - 2012 25th IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2012
Y2 - 29 April 2012 through 2 May 2012
ER -