Task allocation for maximizing reliability of distributed systems: A simulated annealing approach Export

@article{attiya06taskalloc, abstract = {This paper addresses the problem of task allocation in heterogeneous distributed systems with the goal of maximizing the system reliability. It first develops an allocation model for reliability based on a cost function representing the unreliability caused by the execution of tasks on the system processors and the unreliability caused by the interprocessor communication time subject to constraints imposed by both the application and the system resources. It then presents a heuristic algorithm derived from the well-known simulated annealing (SA) technique to quickly solve the mentioned problem. The performance of the proposed algorithm is evaluated through experimental studies on a large number of randomly generated instances. Indeed, the quality of solutions are compared with those derived by using the branch-and-bound (BB) technique.}, author = {Attiya, Gamal and Hamam, Yskandar}, citeulike-article-id = {3153830}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.jpdc.2006.06.006}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6WKJ-4KPP47V-1/2/07d8d7ddc86ddb32d7d02318a68d8d1d}, doi = {10.1016/j.jpdc.2006.06.006}, journal = {Journal of Parallel and Distributed Computing}, keywords = {fault-tolerance, simulated-annealing, task-allocation}, month = {October}, number = {10}, pages = {1259--1266}, posted-at = {2008-08-25 15:48:50}, priority = {2}, title = {Task allocation for maximizing reliability of distributed systems: A simulated annealing approach}, url = {http://dx.doi.org/10.1016/j.jpdc.2006.06.006}, volume = {66}, year = {2006} }

TY - JOUR ID - attiya06taskalloc L3 - citeulike-article-id:3153830 N2 - This paper addresses the problem of task allocation in heterogeneous distributed systems with the goal of maximizing the system reliability. It first develops an allocation model for reliability based on a cost function representing the unreliability caused by the execution of tasks on the system processors and the unreliability caused by the interprocessor communication time subject to constraints imposed by both the application and the system resources. It then presents a heuristic algorithm derived from the well-known simulated annealing (SA) technique to quickly solve the mentioned problem. The performance of the proposed algorithm is evaluated through experimental studies on a large number of randomly generated instances. Indeed, the quality of solutions are compared with those derived by using the branch-and-bound (BB) technique. IS - 10 JF - Journal of Parallel and Distributed Computing EP - 1266 TI - Task allocation for maximizing reliability of distributed systems: A simulated annealing approach VL - 66 SP - 1259 KW - fault-tolerance KW - simulated-annealing KW - task-allocation AU - Attiya, Gamal AU - Hamam, Yskandar PY - 2006/10// UR - http://dx.doi.org/10.1016/j.jpdc.2006.06.006 ER -