• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.58-71
• /
• 2002

Generally, multi-dimensional data such as image and spatial data require large amount of storage space. There is a limit to store and manage those large amount of data in single workstation. If we manage the data on parallel computing environment which is being actively researched these days, we can get highly improved performance. In this paper, we propose a parallel high-dimensional index structure that exploits the parallelism of the parallel computing environment. The proposed index structure is nP(processor)-n$\times$mD(disk) architecture which is the hybrid type of nP-nD and lP-nD. Its node structure increases fan-out and reduces the height of a index tree. Also, A range search algorithm that maximizes I/O parallelism is devised, and it is applied to K-nearest neighbor queries. Through various experiments, it is shown that the proposed method outperforms other parallel index structures.

• The Korean Journal of Applied Statistics
• /
• v.31 no.3
• /
• pp.383-396
• /
• 2018

Various parallel processing R packages are used for fast processing and the analysis of big data. Parallel processing is used when the work can be decomposed into tasks that are non-interdependent. In some cases, each task decomposed for parallel processing can also be decomposed into non-interdependent subtasks. We have to choose whether to parallelize the decomposed tasks in the first step or to parallelize the subtasks in the second step when facing nested parallelism situations. This choice has a significant impact on the speed of computation; consequently, it is important to understand the nature of the work and decide where to do the parallel processing. In this paper, we provide an idea of how to apply parallel computing effectively to problems by illustrating how to select a parallelism point for the bandwidth selection of nonparametric regression.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1932-1940
• /
• 2000

We must solve problems caused by mobile computing environments for supporting efficient mobile computing services. The problem is the use of wireless medium having high error rates and low bandwidth, and the sudden network disconnection to reduce the power consumption of a mobile host and the cost of the network connection. For these problems, we proposed the architecture of the partial connection manager and designed and implemented that in this paper. In particular, The partial connection manager creates the limited number of mobile agents according to priority and sends them in parallel to server systems and combines results of them process rapidly the user request. By applying the proposed partial connection manager to the mobile computing services called cybermarket, we knew that the mobile agent technique could be suited to the mobile computing environment and overcome the partial connection problem caused by eh mobile computing environment.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.121-124
• /
• 2015

Recent global and cloud computing render the Internet and Web application to be a paramount field since it is uncomplicated to access and less time and space limitation. On the other hand, a growing number of computations using grid computing techniques indicates the requirements and quantities of large-scale computations are becoming foremost progressively. Therefore, that will be much practicable if there is a Web-based service that could provide Grid computing functions. In this paper, Several similar Web-based cloud and parallel computing systems will be discussed and a model of Web application termed GCaaS which supports grid computing services will be introduced.

• Nuclear Medicine and Molecular Imaging
• /
• v.43 no.5
• /
• pp.443-450
• /
• 2009

Purpose: Conventional image reconstruction uses simplified physical models of projection. However, real physics, for example 3D reconstruction, takes too long time to process all the data in clinic and is unable in a common reconstruction machine because of the large memory for complex physical models. We suggest the realistic distributed memory model of fast-reconstruction using parallel processing on personal computers to enable large-scale technologies. Materials and Methods: The preliminary tests for the possibility on virtual manchines and various performance test on commercial super computer, Tachyon were performed. Expectation maximization algorithm with common 2D projection and realistic 3D line of response were tested. Since the process time was getting slower (max 6 times) after a certain iteration, optimization for compiler was performed to maximize the efficiency of parallelization. Results: Parallel processing of a program on multiple computers was available on Linux with MPICH and NFS. We verified that differences between parallel processed image and single processed image at the same iterations were under the significant digits of floating point number, about 6 bit. Double processors showed good efficiency (1.96 times) of parallel computing. Delay phenomenon was solved by vectorization method using SSE. Conclusion: Through the study, realistic parallel computing system in clinic was established to be able to reconstruct by plenty of memory using the realistic physical models which was impossible to simplify.

• KIPS Transactions on Computer and Communication Systems
• /
• v.10 no.9
• /
• pp.243-250
• /
• 2021

Recently, with the development of cloud computing, interest in database outsourcing is increasing. However, when the database is outsourced, there is a problem in that the information of the data owner is exposed to internal and external attackers. Therefore, in this paper, we propose a parallel range query processing algorithm that supports privacy protection. The proposed algorithm uses the Paillier encryption system to support data protection, query protection, and access pattern protection. To reduce the operation cost of a checking protocol (SRO) for overlapping regions in the existing algorithm, the efficiency of the SRO protocol is improved through a garbled circuit. The proposed parallel range query processing algorithm is largely composed of two steps. It consists of a parallel kd-tree search step that searches the kd-tree in parallel and safely extracts the data of the leaf node including the query, and a parallel data search step through multiple threads for retrieving the data included in the query area. On the other hand, the proposed algorithm provides high query processing performance through parallelization of secure protocols and index search. We show that the performance of the proposed parallel range query processing algorithm increases in proportion to the number of threads and the proposed algorithm shows performance improvement by about 5 times compared with the existing algorithm.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1777-1788
• /
• 1999

The portability of Java language makes it possible to use heterogeneous computers without re-compiling of application programs. Java applet can also be transported to other computers via Web browser. In this research, a Cooperative Web Computing Environment(CWCE) that uses idle computers on the Intranet for cooperative parallel computing work is suggested. The CWCE allows to use more than a manager computer that sends applets and manages communication between other computers. The number of manager computers can be determined according to the characteristics of computing environment and any chosen application program. It can reduce the amount of communication overhead for the application programs especially with synchronized communication. For the CWCE, a decision function to determine the managing level is provided. The CWCE turns out to be useful computing environment for the applications with less computation request ratio and multi-managing can help to reduce the communication overhead especially for the applications with a high ratio of synchronization purpose communications.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.10
• /
• pp.38-45
• /
• 2004

In this paper, a parallel visualization algorithm is proposed for efficient visualization of the massive data generated from large-scale parallel finite element analysis through investigating the characteristics of parallel rendering methods. The proposed parallel visualization algorithm is designed to be highly compatible with the characteristics of domain-wise computation in parallel finite element analysis by using the sort-last-sparse approach. In the proposed algorithm, the binary tree communication pattern is utilized to reduce the network communication time in image composition routine. Several benchmarking tests are carried out by using the developed in-house software, and the performance of the proposed algorithm is investigated.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.69-81
• /
• 2001

This paper describes a parallel programming environment to help programmer to write parallel programs. Parallel program must be write according to the character of the various hardware or program. So it is difficult for the programs to write the parallel programmer. In this paper, we propose and implement a parallel programming environment using graph type intermediate representation form, and graph user interface is provided for programmer to get parallel programs easily, This parallel environment supports special functions using graph type intermediate representation form. The special functions involve program editing. data dependence analysis, loop transformation. CFG, PDG, HTG. This parallel environment helps users make parallelism and optimization easy through showing the intermediate code with graph.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.149-154
• /
• 2001

Parallel performance of a Myrinet based PC-cluster was tested and compared with a conventional Fast-Ethernet system. A preconditioned Navier-Stokes code was parallelized with domain decomposition technique, and used for the parallel performance test. Speed-up ratio was examined as a major performance parameter depending on the number of processor and the network topology. As was expected, Myrinet system shows a superior parallel performance to the Fast-Ethernet system even with a single network adpater for a dual processor SMP machine. A test for the dependency on problem size also shows that network communication speed is a crucial factor for parallelized computational fluid dynamics analysis and the Myrinet system is a plausible candidate for high performance parallel computing system.