• Journal of Internet Computing and Services
• /
• v.13 no.1
• /
• pp.37-44
• /
• 2012

Numerous scientists who are engaged in compute-intensive researches require more computing facilities than before, while the computing resource and techniques are increasingly becoming more advanced. For this reason, many works for e-Science environment have been actively invested and established around the world, but still the scientists look for an intuitive experimental environment, which is guaranteed the improved environmental facilities without additional configurations or installations. In this paper, we present an integrated scientific workflow execution environment for Scientific applications supporting workflow design with high performance computing infrastructure and accessibility for web browser. This portal supports automated consecutive execution of computation jobs in order of the form defined by workflow design tool and execution service concerning characteristics of each job to batch over distributed grid resources. Workflow editor of the portal presents a high-level frontend and easy-to-use interface with monitoring service, which shows the status of workflow execution in real time so that user can check the intermediate data during experiments. Therefore, the scientists can take advantages of the environment to improve the productivity of study based on HTC.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.554-557
• /
• 2016

Recently, supercomputer has been increasingly adopted as a computing environment for scientific simulation as well as education, healthcare and national defence. Especially, supercomputing system with heterogeneous computing resources is gaining resurgence of interest as a next-generation problem solving environment, allowing theoretical and/or experimental research in various fields to be free of time and spatial limits. However, traditional supercomputing services have only been handled through a simple form of command-line based console, which leads to the critical limit of accessibility and usability of heterogeneous computing resources. To address this problem, in this paper, we provide the design and implementation of web-based HPC (High Performance Computing) job management framework for computational scientific simulation. The proposed framework has highly extensible design principles, providing the abstraction interfaces of job scheduler (as well as bundle scheduler plug-ins for LoadLeveler, Sun Grid Engine, OpenPBS scheduler) in order to easily incorporate the broad spectrum of heterogeneous computing resources such as cluster, computing cloud and grid. We also present the detailed specification of HTTP standard based RESTful endpoints, which manage simulation job's life-cycles such as job creation, submission, control and status monitoring, etc., enabling various 3rd-party applications to be newly created on top of the proposed framework.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.441-448
• /
• 2008

The molecular docking system needs a large amount of computation and requires super-computing power. Since the experiment requires a large amount of time, the experiment is conducted in the distributed environment or in the grid environment. Recently, researches on using parallel GPU of far higher performance than that of CPU in scientific computing have been very actively conducted. CUDA is an open technique by which a parallel GPU programming is made possible. This study proposes the molecular docking system using CUDA. It also proposes algorithm that parallels energy-minimizing-computation. To verify such experiments, this study conducted a comparative analysis on the time required for experimenting molecular docking in general CPU and the time and performance of the parallel GPU-based molecular docking which is proposed in this study.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.71-85
• /
• 2006

The environment of computational grid is composed of the LAN/WAN each of which has different efficiency and heterogeneous network conditions, and where various programs are running. In this environment, the role of the resource selection broker is very important because the work of each node is performed by considering heterogeneous network environment and the computing power of each node according to the characteristics of a program. In this paper, a new resource selection broker is presented that decides the number of work processes to be allocated at each node by considering network state information and the performance of each node according to the characteristics of a program in the environment of computational grid. The proposed resource selection broker has three steps as follows. First, the performance ratio of each node is computed using latency-bandwidth-cpu mixture information reflecting the characteristics of a program, and the number of work processes that will be performed at each node are decided by this ratio. Second, RSL file is automatically made based on the number of work processes decided at the previous step. Finally, each node creates work processes by using that RSL file and performs the work which has been allocated to itself. As experimental results, the proposed method reflecting characteristics of a program, compared with the existing (uniformity) and latency-bandwidth method is improved $278%\sim316%,\;524%\sim595%,\;924%\sim954%$ in the point of work amount, work process number, and node number respectively.

• The Journal of Korean Association of Computer Education
• /
• v.12 no.4
• /
• pp.57-64
• /
• 2009

Protein structure comparison is a task that requires a lot of computing resources because many atoms in proteins need to be processed. To address the issue, Grid computing environment has been employed for processing time-consuming jobs in a distributed manner. However, controling the Grid computing environment may not be easy for non-experts. In this paper, we present a JXTA-based system for protein structure comparison that can be easily controled by non-experts. To search proteins similar to a query protein, the geometric hashing algorithm that consists of preprocessing and recognition was employed. Experimental results indicate that the system can find the correct protein structure for a given query protein structure and the proposed system can be easily extended to solve the protein docking problem. It is expected that the proposed system can be useful for non-experts, especially users who do not have sophisticated knowledge of distributed systems in general such as college students who major in biology or chemistry.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.3
• /
• pp.365-370
• /
• 2007

Many engineering problems often require the large amount of computing resources for iterative simulations of problems treating many parameters and input files. In order to overcome the situation, this paper proposes an e-Science based computational system. The system exploits the Grid computing technology to establish an integrated web service environment which supports distributed high throughput computational simulations and remote executions. The proposed system provides an easy-to-use parametric study service where a computational service includes real time monitoring. To verify usability of the proposed system, two kinds of applications were introduced. The first application is an Aerospace Integrated Research System (e-AIRS). The e-AIRS adapts the proposed computational system to solve CFD problems. The second one is design and optimization of protein 3-dimensional structures in structural biology.

• The KIPS Transactions:PartA
• /
• v.18A no.4
• /
• pp.123-128
• /
• 2011

As the global grid has grown in size, large-scale distributed data analysis schemes have gained momentum. Over the last few years, a number of methods have been introduced for allocating data intensive tasks across distributed and heterogeneous computing platforms. However, these approaches have a limited potential for scaling up computing nodes so that they can serve more tasks simultaneously. This paper tackles the scalability and communication delay for computing nodes. We propose a distributed data node for storing and allocating the data. This paper also provides data provisioning method based on the steady states for minimizing the communication delay between the data source and the computing nodes. The experimental results show that scalability and communication delay can be achieved in our system.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.3
• /
• pp.84-95
• /
• 2005

This paper presents solution heuristics to solving optimal multiple-viewpoint location problems that are based on topographic features. The visibility problem is to maximise the viewshed area for a set of viewpoints on digital elevation models (DEM). For this analysis, five areas are selected, and fundamental topographic features (peak, pass, and pit) are extracted from the DEMs of the study areas. To solve the visibility problem, at first, solution approaches based on the characteristics of the topographic features are explored, and then, a benchmark test is undertaken that solution performances of the solution methods, such as computing times, and visible area sizes, are compared with the performances of traditional spatial heuristics. The feasibility of the solution methods, then, are discussed with the benchmark test results. From the analysis, this paper can conclude that fundamental topographic features based solution methods suggest a new sight of visibility analysis approach which did not discuss in traditional algorithmic approaches. Finally, further research avenues are suggested such as exploring more sophisticated selection process of topographic features related to visibility analysis, exploiting systematic methods to extract topographic features, and robust spatial analytical techniques and optimization techniques that enable to use the topographic features effectively.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.95-101
• /
• 2004

The scheduling problem that maps independent tasks to heterogeneous resources in distributed computing systems is known as NP-complete［1］. GRID［2］ is an example of distributed systems that consisted of heterogeneous resources. Many algorithms to solve this problem have been presented［1,3,4,5］. The scheduling algorithm can be classified into static scheduling algorithms and dynmic scheduling algorithms. A dynamic scheduling algorithm can be used when we can not predict the priority of tasks. Moreover, a dynamic scheduling algorithm can be divided into on-line mode algorithm and batch mode algorithm according to the scheduling time［1,6］. In this paper, we propose a new on-line mode scheduling algorithm. By extensive simulation, we can see that our scheduling algorithm outperforms previous scheduling algorithms.