리눅스 클러스터에서 JAVA를 이용한 Clique 계산의 병렬화
(A) Parallelization of Clique Calculation Using JAVA on Linux Cluster
리눅스 클러스터 JAVA Clique 계산 병렬화;
- 원문 URL
Though computer technology is developing rapidly, there are a lot of hard problems such as the maximum clique problem. To solve these problems, various methods are studied. When it is used the existing brute-force method for a hard problem, a great deal of time is requested. The purpose of this thesis is to implement a method of finding maximum clique efficiently. It is important to know a structure and a function of protein which takes charge of important role in life phenomenon. Basis of protein functional study is to compare structure of protein, and finding similar substructures between two proteins corresponds to the maximum clique problem. In this thesis, we designed a clique searching system which implements the very efficient branch-and-bound algorithm developed by O¨stergard for finding maximum clique. The proposed system was designed for Linux cluster environment by using the MPI library which is a standard message passing library and Java technology. Since the system is designed and implemented in platform-independent Java program, it can easily port into other computing environments. Furthermore, our system can solve the problem efficiently through parallel processing that divide range of sub-problems, and we are able to confirm the efficiency through experiments about various graphs.