• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.299-301
• /
• 2012

본 논문에서는 3D SW와 같은 고사양의 SW를 서버 기반의 온라인 SW 서비스로 제공하기 위하여 클라이언트의 GPU를 사용하여 그래픽 분할 실행 서비스를 제공하기 위한 데스크탑 창의 가상화에 대하여 소개한다. 그래픽 분할 실행은 서버에서 SW를 구동하고 실행되는 SW의 데이터 집중적인 작업은 서버에서 실행하고, 그래픽 작업들은 서버에서 처리되지 않고, GPU 가상화를 이용하여 클라이언트의 GPU에서 처리하여 SW를 서비스하는 방법이다. 이를 위하여 본 논문에서는 3D 그래픽 정보의 클라이언트 렌더링을 API 리모팅을 이용하여 처리하는 방법에 대하여 소개하고, 실행되는 SW의 2D 그래픽 기반 윈도우를 서버의 윈도우 관리 시스템에 독립적으로 클라이언트 PC에서 가상화하여 처리하는 방법을 제안한다. 또한, 제안된 방법이 서버의 창 관리 시스템에 종속적인 경우와 비교하여 사용자에게 유연한 서비스를 제공함을 알아본다.

• Journal of Internet Computing and Services
• /
• v.12 no.6
• /
• pp.53-62
• /
• 2011

In this paper, we introduce a method of graphic offloading computing using a GPU virtualization technology in order to provide high demanding software like 3D software as an on-line software service. When the offloading software is executed on server's software virtualization environment, its graphic works are processed on a client's GPU using GPU virtualization, while on the other its data works are processed on server's CPU. To do that, we propose a method of rendering graphics information on client side GPU using API Remoting method. Also, we show the better performance than server based rendering method when we serve offloading software which include dynamical 3D graphics that display images are frequently changed through on-line. Moreover, we describe a method to virtualize offloading software by a process level and manage client's configuration information in order to decrease server's load when we provide software service to multiple clients.

• KIISE Transactions on Computing Practices
• /
• v.20 no.10
• /
• pp.555-560
• /
• 2014

This paper proposes the data security technology for the desktop virtualization environment using the separated software execution method. In the virtual environment where allocates separate VMs to the users, there is a benefit that the programs in one guest machine are isolated from the programs running in another guest machine, whereas in the separated execution environment that supports application virtualization, the isolation is not offered and it causes the data security problem because the applications are executed by the one root privilege in the server. To solve this problem, we provides the data security method using the server storage filter, the viewer filter, and the file mapping table in this paper.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.209-211
• /
• 2012

본 논문에서는 서버 기반 SW 서비스의 분할 실행 기술에서 API 리모팅 방법을 통해 서버에서 실행되는 SW 의 그래픽 렌더링 작업을 클라이언트에 전송할 때, 효율적인 스레드 및 버퍼 관리 방법을 제안하였다. 또한, 기존의 API 리모팅 방법과 비교하여 우수한 성능을 제공함을 실험을 통해 보여주었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.181-184
• /
• 2011

최근 컴퓨터 가상화 기술이 발전됨에 따라 필요한 소프트웨어를 서비스 형태로 사용하는 소프트웨어 서비스(Software as a Service SaaS)가 많은 응용분야에서 사용되고 있다. 그러나 소프트웨어 서비스를 제공하는 기존 시스템은 사용자의 증가에 서버 성능이 급속히 저하되는 문제점과 일시적인 사용자 폭증으로 생기는 핫스팟(Hotspot)에 안정적인 서비스를 제공하지 못하는 문제점을 가지고 있다. 이러한 문제점들을 해결하기 위하여 본 논문은 소프트웨어 실행을 위한 작업들이 모두 서버에서 실행되는 것이 아니라 데이터 집중적인 작업들은 서버에서 직접 실행하고 그래픽 집중적인 작업들은 네트워크 전송을 통하여 클라이언트에서 처리되는 분할 실행 방식과 개별적으로 운영되는 SaaS 서버들을 하나로 통합하는 시스템을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.309-311
• /
• 2012

최근 데스크탑 가상화 서비스와 관련한 솔루션들이 많아지고 있다. 하지만, 이들 솔루션은 클라이언트의 수가 늘어날수록 서버의 부담이 커지며, 특히 3D 그래픽을 지원하는 고사양의 SW 를 지원하기 어려운 한계를 가지고 있다. 이러한 제약을 극복하기 위해 서버에서 데이터 집중적인 작업을 실행하고, 클라이언트 PC 에서는 그래픽 처리와 같은 사용자 인터페이스 작업을 분담하여 실행하는 서버 기반 그래픽 분할 실행 기술[4]이 제안되었다. 본 논문에서는 그래픽 분할 실행 기술을 개발하는데 있어 이미지 비트맵 관련 함수가 실행되었을 때 나타나는 비트맵 불일치 현상을 해결하기 위해 백업 비트맵을 이용한 가상 비트맵 관리 기법을 제안하여 궁극적으로 분할 실행 기술 개발을 지원하고자 한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.337-347
• /
• 2007

An embedded system is called a multi-mode embedded system if it performs multiple applications by dynamically reconfiguring the system functionality. Further, the embedded system is called a multi-mode multi-task embedded system if it additionally supports multiple tasks to be executed in a mode. In this Paper, we address a HW/SW partitioning problem, that is, HW/SW partitioning of multi-mode multi-task embedded applications with timing constraints of tasks. The objective of the optimization problem is to find a minimal total system cost of allocation/mapping of processing resources to functional modules in tasks together with a schedule that satisfies the timing constraints. The key success of solving the problem is closely related to the degree of the amount of utilization of the potential parallelism among the executions of modules. However, due to an inherently excessively large search space of the parallelism, and to make the task of schedulabilty analysis easy, the prior HW/SW partitioning methods have not been able to fully exploit the potential parallel execution of modules. To overcome the limitation, we propose a set of comprehensive HW/SW partitioning techniques which solve the three subproblems of the partitioning problem simultaneously: (1) allocation of processing resources, (2) mapping the processing resources to the modules in tasks, and (3) determining an execution schedule of modules. Specifically, based on a precise measurement on the parallel execution and schedulability of modules, we develop a stepwise refinement partitioning technique for single-mode multi-task applications. The proposed techniques is then extended to solve the HW/SW partitioning problem of multi-mode multi-task applications. From experiments with a set of real-life applications, it is shown that the proposed techniques are able to reduce the implementation cost by 19.0% and 17.0% for single- and multi-mode multi-task applications over that by the conventional method, respectively.

• The Journal of the Korea Contents Association
• /
• v.16 no.10
• /
• pp.608-616
• /
• 2016

The Smith-Watrman (SW) algorithm is a local alignment algorithm which is one of important operations in DNA sequence analysis. The SW algorithm finds the optimal local alignment with respect to the scoring system being used, but it has a problem to demand long execution time. To solve the problem of SW, some methods to perform SW in distributed and parallel manner have been proposed. The ADAM which is a distributed and parallel processing framework for DNA sequence has parallel SW. However, the parallel SW of the ADAM does not consider that the SW is a dynamic programming method, so the parallel SW of the ADAM has the limit of its performance. In this paper, we propose a method to enhance the parallel SW of ADAM. The proposed parallel SW (PSW) is performed in two phases. In the first phase, the PSW splits a DNA sequence into the number of partitions and assigns them to multiple nodes. Then, the original Smith-Waterman algorithm is performed in parallel at each node. In the second phase, the PSW estimates the portion of data sequence that should be recalculated, and the recalculation is performed on the portions in parallel at each node. In the experiment, we compare the proposed PSW to the parallel SW of the ADAM to show the superiority of the PSW.

• The KIPS Transactions:PartA
• /
• v.9A no.4
• /
• pp.491-496
• /
• 2002

Most partitioning algorithms for hardware- software codesign do not consider scheduling. Therefore, partitioning should be performed again if time constraints art not satisfied in scheduling the partitioned results. Existing FDS-applied methods which consider scheduling in partitioning decide the control step of the node to schedule while selecting nodes for partitioning. In selecting nodes for partitioning, several aspects should be considered together such as added cost or time due to the partition of the node, or the degree of interference due to the scheduling of the node. At this time, the induced force, which means the degree of intereference of scheduling other nodes, is computed all over the control step of the corresponding node and other depending nodes. In this paper, a new FDS-applied partitioning algorithm is proposed, where partitioning is performed using the defined scheduling urgency and relative scheduling urgency of the nodes. Since the nodes are partitioned by the computation of relative scheduling urgencies only at the earliest control step and the latest control step among the assignable steps, the time complexity for the computation of induced force could be improve. Experimental result on the benchmarks show the improvement of execution time of the proposed algorithm compared to the existing FDS-applied methods.