• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10e
• /
• pp.580-582
• /
• 2002

이동 에이전트는 네트워크 내에서 스스로 이동하면서 사용자 또는 다론 개체 대신 행동할 수 있는 컴퓨터 프로그램을 말하며 이동 에이전트가 적용될 수 있는 분야로는 전자상거래, 정보 검색, 병렬／분산 처리, 네트워크 관리 등이 있다. 본 논문에서는 유휴 컴퓨팅자원뿐만 아니라 개별 사용자에 의해 사용중인 컴퓨팅 자원을 포함하는 분산／병렬 처리 환경에서의 스케줄링 방법에 대해 연구하였다. 컴퓨팅 자원이 사용 중일지라도 부하가 적을 경우 적절한 방법으로 분산처리 환경에 포함시킨다면 전체 컴퓨팅 자원들의 사용율은 증대할 것이다. 본 논문에서는 세 가지 스케줄링 방법을 적용하여 작업 노드들을 그룹으로 구성하고, 이동 에이전트를 통해 작업 그룹에 속한 노드들에게 분해할 수 없는 다수의 작업을 할당하여 처리토록 한다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.41 no.6
• /
• pp.23-37
• /
• 2004

Since java thread is an object which is treated as independent process within one execution space in the multiprocessing environment, we can use it for independent process of parallel processing. Using thread and synchronization mechanism of java enables us to write parallel application program easily. Therefore, a lot of results are exist which is apply the feature of java that support parallel processing to the distributed computing environment. In this paper, we introduce a system of environment that support parallel execution of thread which is included in legacy java program. The system named TORB(Transparent Object Request Broker) enables us parallel execution of legacy java program after simple converting process, since it support the feature of programming transparency. TORB is extended version of distributed programming tool that is published by our research team. And it had only typical distributed processing feature that is execute a specified function at the specified computer.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.251-260
• /
• 2002

The parallel/distributed processing with a lot of the idle hosts on the web has the high coot-performance ratio for large-scale applications. It's processing has to show the solutions for unpredictable status such as heterogeneity of hosts, variability of hosts, autonomy of hosts, the supporting performance continuously, and the number of hosts which are participated in computation and so on. In this paper, we propose the strategy of adaptive tack reallocation based on performance the host job processing, spread out geographically Also, It shows the scheme of dynamic host management with dynamic environment, which is changed by lots of hosts on the web during parallel processing for large-scale applications. This paper implements the PDSWeb (Parallel/Distributed Scheme on Web) system, evaluates and applies It to the generation of rendering image with highly intensive computation. The results are showed that the adaptive task reallocation with the variation of hosts has been increased up to maximum 90% and the improvement in performance according to add/delete of hosts.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.91-93
• /
• 2003

디지털 비디오의 사용 증가로 인해 비디오의 인덱싱, 브라우징, 검색과 같은 서비스가 필요하게 되었다. 이와 같은 서비스의 효율적인 구축을 위한 단계 중, 비디오 파싱은 멀티미디어 애플리케이션에서 중요한 부분을 차지하고 있다. 일반적으로. 비디오 파싱은 복잡한 연산을 하기 때문에. 전통적인 단일 컴퓨터에 의한 파싱 방법은 많은 시간이 소요된다. 이러한 문제는 병렬 및 분산 컴퓨팅을 사용하여 파싱에 필요한 시간을 줄임으로써 해결할 수 있다. 본 논문에서는 이질 분산 환경의 멀티 컴퓨터를 사용한 세 가지 MPEG 비디오의 병렬 스케쥴링 알고리즘을 제안하였다. 성능 평가에서는 제안한 스케쥴링 알고리즘의 speedup과 load balancing에 관하여 비교 실험하였으며, 제안한 스케쥴링 알고리즘을 통해 매우 좋은 성능 향상을 얻을 수 있었다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.6 no.6
• /
• pp.555-568
• /
• 2000

The World Wide Web has become the largest virtual system that is almost universal in scope. In recent research, it has become effective to utilize idle hosts existing in the World Wide Web for running applications that require a substantial amount of computation. This novel computing paradigm has been referred to as the advent of global computing. In this paper, we implement and propose a mobile object-based global computing framework called Tiger, whose primary goal is to present novel object-oriented programming libraries that support distribution, dispatching, migration of objects and concurrency among computational activities. The programming libraries provide programmers with access, location and migration transparency for distributed and mobile objects. Tiger's second goal is to provide a system supporting requisites for a global computing environment - scalability, resource and location management. The Tiger system and the programming libraries provided allow a programmer to easily develop an objectoriented parallel and distributed application using globally extended computing resources. We also present the improvement in performance gained by conducting the experiment with highly intensive computations such as parallel fractal image processing and genetic-neuro-fuzzy algorithms.

• Electronics and Telecommunications Trends
• /
• v.26 no.1
• /
• pp.80-88
• /
• 2011

데이터의 효과적인 활용이 경쟁력 확보에 주요한 요인이나, 데이터 폭증은 유용한 정보를 얻는데 필요한 처리 시간의 지연을 야기하고 있다. 개인 맞춤형 서비스, 방범 방재 서비스 등 모니터링 & 대응 서비스를 위해 분석할 데이터의 양이 급증하고 있으며, 텍스트, 영상, 오디오 등 비정형 데이터에 대한 실시간 분석 필요성이 증대하고 있다. 대량의 폭증하는 데이터에 대한 실시간 분석 처리 환경을 제공하기 위해 분산 병렬 컴퓨팅 기술과 데이터 스트림 연속 처리 기술이 활용되고 있다. 본고에서는 폭증하는 데이터 스트림 처리를 위하여 확장성 및 유연한 처리 환경을 제공하는 분산 스트림 컴퓨팅 기술에 대해 소개한다.

• Journal of Korea Multimedia Society
• /
• v.7 no.5
• /
• pp.755-765
• /
• 2004

Recently, the Internet-based distributed/parallel computing using many of idle hosts has been demonstrated its usefulness for processings of a large-scale task and involving several important issues. While executing a large-scale task, the realtime monitoring is required for adaptive strategy of the performance and state change of host. This paper provides the realtime monitoring and visualization on global computing infrastructure called PDP(Parallel Distributed Processing) which is a parallel computing framework implemented with Jana for parallel computing on the Internet.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.1
• /
• pp.25-36
• /
• 2004

This paper proposes and measures the performance of a distributed EIT (Electrical Impedance Tomography) image reconstruction algorithm which has a master-slave structure. The image construction is a computation based application of which the execute time is proportional to the cube of the unknowns. After receiving a specific frame from the master, each computing node extracts the basic elements by executing the first iteration of Kalman Filter in parallel. Then the master merges the basic element lists into one group and then performs the sequential iterations with the reduced number of unknowns. Every computing node has MATLAB functions as well as extended library implemented for the exchange of MATLAB data structure. The master implements another libraries such as threaded multiplication, partitioned inverse, and fast Jacobian to improve the speed of the serial execution part. The parallel library reduces the reconstruction time of image visualization about by half, while the distributed grouping scheme further reduces by about 12 times for the given target object when there are 4 computing nodes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.499-502
• /
• 2012

빅 데이터 분석의 시대가 도래하면서 대용량 데이터의 특성과 계산 집약적 연산의 특성을 동시에 가지는 문제 해결에 대한 요구가 늘어나고 있다. 대용량 데이터 처리의 경우 각종 분산 파일 시스템과 분산/병렬 컴퓨팅 기술들이 이미 많이 사용되고 있으며, 계산 집약적 연산 처리의 경우에도 GPGPU 활용 기술의 발달로 보편화되는 추세에 있다. 하지만 대용량 데이터와 계산 집약적 연산 이 두 가지 특성을 모두 가지는 문제를 처리하기 위해서는 많은 제약 사항들을 해결해야 하는데, 본 논문에서는 이에 대한 대안으로 분산 컴퓨팅 프레임워크인 Hadoop MapReduce와 Nvidia의 GPU 병렬 컴퓨팅 아키텍처인 CUDA 흘 연동하는 방안을 제시하고, 이를 밀집행렬(dense matrix) 연산에 적용했을 때 얻을 수 있는 성능 개선 효과에 대해 소개하고자 한다.

• The KIPS Transactions:PartA
• /
• v.8A no.3
• /
• pp.235-244
• /
• 2001

Development of network and computer technology results in many studies to use physically distributed computers as a single resource. Generally, these studies have focused on developing environments based on message passing. These environments are mainly used to solve problems for scientific computation and process in parallel suing inside parallelism of the given problems. Therefore, these environments provide high parallelism generally, while it is difficult to program and use as well as it is required to have user accounts in the distributed computers. If a given problem is divided into completely independent subproblems, more efficient environment can be provided. We can find these problems in bio-informatics, 3D animatin, graphics, and etc., so the development of new environment for these problems can be considered to be very important. Therefore, we suggest new environment called InterCom based on a proxy computing, which can solve these problems efficiently, and explain the implementation of this environment. This environment consists of agent, server, and client. Merits of this environment are easy programing, no need of user accounts in the distributed computers, and easiness by compiling distributed code automatically.