Journal of information and communication convergence engineering

  • 제9권2호
  • /
  • Pages.141-149
  • /
  • 2011
  • /
  • 2234-8255(pISSN)
  • /
  • 2234-8883(eISSN)
한국정보통신학회 (The Korea Institute of Information and Commucation Engineering)
권호 표지
DOI QR코드

DOI QR Code

Compromise Scheme for Assigning Tasks on a Homogeneous Distributed System

  • Kim, Joo-Man (Department of Applied IT and Engineering, Pusan National University)
  • 투고 : 2011.02.18
  • 심사 : 2011.04.15
  • 발행 : 2011.04.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

We consider the problem of assigning tasks to homogeneous nodes in the distributed system, so as to minimize the amount of communication, while balancing the processors' loads. This issue can be posed as the graph partitioning problem. Given an undirected graph G=(nodes, edges), where nodes represent task modules and edges represent communication, the goal is to divide n, the number of processors, as to balance the processors' loads, while minimizing the capacity of edges cut. Since these two optimization criteria conflict each other, one has to make a compromise between them according to the given task type. We propose a new cost function to evaluate static task assignments and a heuristic algorithm to solve the transformed problem, explicitly describing the tradeoff between the two goals. Simulation results show that our approach outperforms an existing representative approach for a variety of task and processing systems.

키워드

참고문헌

  1. B. W. Kernighan and S. Lin, ''An efficient heuristic procedure for partitioning graphs,'' Bell Syst. Tech. J., vol. 49, pp. 291-307, Feb. 1970. https://doi.org/10.1002/j.1538-7305.1970.tb01770.x
  2. H. S. Stone, ''Critical load factors in distributed computer systems,'' IEEE Trans. Software Eng., vol. SE-4, pp. 254-258, May 1978. https://doi.org/10.1109/TSE.1978.231502
  3. S. H. Bokhari, ''A shortest tree algorithm for optimal assignments across space and time in a distributed processor systems,'' IEEE Trans. Software Eng., vol. SE-7, pp. 583-589, Nov. 1981. https://doi.org/10.1109/TSE.1981.226469
  4. S. H. Bokhari, ''Assignment Problems in Parallel and Distributed Computing,'' Kluwer Academic Publishers, Boston, 1987.
  5. S. Pulidas, D. Towsley, and J. A. Stankovic, "Embedding gradient estimators in loadbalancing algorithms," Proc. 8th Int. Conf. Distributed Comput. Syst., pp. 482-490,1988.
  6. C. -H. Lee, C. -I. Park, and M. Kim, ''Efficient algorithm for graphpartitioning problem using a problem transformation method,'' Computer-Aided Design, vol. 21, pp. 611-618, Dec. 1989. https://doi.org/10.1016/0010-4485(89)90159-0
  7. V. M. Lo, ''Heuristic algorithms for task assignment in distributed systems,'' IEEE Trans. Comput., vol. C-7-37, pp. 1384-1397, Nov. 1988.
  8. C. -H. Lee, K. G. Shin, ''Optimal task assignment in Homogeneous Networks,'' IEEE Trans. on Parallel and Distributed Systems., vol.8, No.2, pp. 119-129, Feb 1997. https://doi.org/10.1109/71.577254
  9. J. -M. Kim, C. -H, Lee, ''A Repeated Mapping Scheme of Task Modules with Minimum Communication Cost in Hypercube Multicomputers,'' ETRI Journal., vol.20, No.4, pp.327-245, Dec, 1998. https://doi.org/10.4218/etrij.98.0198.0402
  10. A. Salman, I. Ahmad, S. Al-Madani, "Particle swarm optimization for task assignment problem," Microprocessors and Microsystems 26, pp.363-371, 2002. https://doi.org/10.1016/S0141-9331(02)00053-4
  11. J. -M.Kim, ''Task assignment to consider the communication costs and the load balancing in Distributed and Parallel Systems,'' PhD thesis., Chungnam National University, Aug. 2003.
  12. B. Ucar, C. Aykanat, K. Kaya and M. Ikinci, "Task assignment in heterogeneous computing systems," j. Parallel Distrib. Comput. 66, pp.32-46, 2006. https://doi.org/10.1016/j.jpdc.2005.06.014
  13. J. -M. Orduna, F. Silla and J. Duato, "On the development of a communication-aware task mapping technique," J. Systems Archit. 50(4), pp.207-220, 2004. https://doi.org/10.1016/j.sysarc.2003.09.002
  14. M. Kafil, I. Ahmad, "Optimal Task Assignment in Heterogeneous Distributed Computing Systems," IEEE Concurrency, vol. 6 no. 3, pp.42-51, Jully-Sept. 1998. https://doi.org/10.1109/4434.708255
  15. A.P. Tom, C.S.R. Murthy, "Optimal task allocation in distributed systems by graph matching and state space search," J. Systems and Software 46 (1) pp.59-75, 1999. https://doi.org/10.1016/S0164-1212(98)10088-2