• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.04a
• /
• pp.729-734
• /
• 2000

전통적인 기존의 슬라이싱 기법들은 종속 그래프를 통해 슬라이스를 산출하였고, 슬라이스의 정확성을 입증하였다. 그러나, 기존의 종속 그래프 기법은 정적 슬라이싱 기법을 바탕으로 하기 때문에 프로시져 간의 매개변수별 자료 전달 링크를 나타내기 위하여 많은 정점들과 간선들이 필요하다. 그래서 그래프가 매우 복잡하다. 본 논문에서는 어떤 작업을 처리하기 위해 관련된 여러 개의 프로그램으로 구성된 소프트웨어 시스템의 슬라이싱을 수행하기 위한 동적 시스템 종속 그래프의 표현법에 대해 제안하였다. 그리고, 본 논문에서 제안한 동적 시스템 종속 그래프 기법과 기존의 프로그램 종속 그래프 기법에 대한 복잡도 측정 공식을 제안하였으며, 동적 시스템 종속 그래프 기법이 기존의 기법에 비해 그래프의 복잡도가 작아 효율적임을 보였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2020.05a
• /
• pp.56-59
• /
• 2020

최근 초저지연, 초고속, 초연결 네트워크를 요구하는 기술들이 급속하게 발전하고 있다. 기존 4G 네트워크는 위 요구사항을 만족할 수 없었기 때문에 5G 네트워크가 등장했다. 5G 네트워크는 네트워크 가상화 기반 네트워크 슬라이싱을 통해 각각의 서비스 마다 독립적인 네트워크 환경을 제공한다. 그러나 네트워크에 참여하는 서비스가 다양해질수록 트래픽 부하가 폭발적으로 증가할 것으로 예상되며 트래픽 부하에 따른 병목현상이 발생할 가능성이 여전히 존재한다. 본 논문에서는 인공 신경망 알고리즘 RNN을 활용하여 트래픽을 예측하고 예측 결과를 기반으로 네트워크 슬라이스의 자원을 선제적으로 조절하는 기계학습 기반 네트워크 슬라이싱 자원 예약 기법을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2022.11a
• /
• pp.159-161
• /
• 2022

클라우드의 동작은 고속의 데이터 처리 부분과 처리된 많은 데이터를 원하는 사용자들에게 전송하는 부분으로 나누어 동작한다. 고속의 데이터를 처리하는 것은 중요하지만 분산형태의 클러스터 클라우드는 중앙 집중 클라우드 보다 클라우드 간의 정보 교환 및 데이터 전송에 관한 네트워크의 중요성이 강조된다. 기존의 IPv4 에서는 네트워크 슬라이싱이 없기 때문에 서비스 별 네트워크의 간소화를 할 수 없었다. 본 논문에서는 클러스터 클라우드의 네트워크를 SDN 환경을 제안하며 SDN 의 핵심 기술인 네트워크 슬라이싱을 클라우드에 적용하는 모델 설계를 제시하고자 한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.12
• /
• pp.182-189
• /
• 2019

3D printing technology is changing the paradigm of consumer-oriented design in supplier-oriented mass production. 3D printing technology in construction is expected to be able to replace existing wet methods along with modular construction. Recently, a number of cases of building construction using 3D printing using mortar-based materials have been announced in many regions, including North America, Europe, and Asia. In this study, we developed a design support tool with a slicing function to output 3D modeling for architecture for a 3D printing machine. We analyzed the process and the function of slicing programs that are commercially available. Seven slicing functions required for the architectural field were derived by analyzing cases, expert reviews, and related literature. The derived functions were extended from the slicing functions to develop the design support tools. Detailed algorithms and processes need to be developed for future derived functions.

• Journal of the Korea Computer Graphics Society
• /
• v.22 no.5
• /
• pp.17-26
• /
• 2016

This paper presents an adaptive slicing method based on merging vertical layer polylines. Firstly, we slice the input 3D polygon model uniformly with the minimum printable thickness, which results in bounding polylines of the cross section at each layer. Next, we group a set of layer polylines according to vertical connectivity. We then remove polylines in overdense area of each group. The number of layers to merge is determined by the layer thickness computed using the cusp height of the layer. A set of layer polylines are merged into a single polyline by removing the polylines within the layer thickness. The proposed method maintains the shape features as well as reduces the printing time. For evaluation, we sliced ten 3D polygon models using our method and a global adaptive slicing method and measured the total length of polylines which determines the printing time. The result showed that the total length from our method was shorter than the other method for all ten models, which meant that our method achieved less printing time.

• Proceedings of the Korean Information Science Society Conference
• /
• 1999.10a
• /
• pp.557-559
• /
• 1999

프로그램 슬라이싱은 프로그램의 특정 문장에서 변수에 영향을 주는 문장들을 분해하는 방법으로 디버깅, 최적화, 프로그램 유지보수, 테스팅, 재사용 부품 추출 그리고 프로그램 이해를 포함하는 여러 응용 분야들에서 그 유용성을 확인할 수 있다. 본 논문은 포인터 변수와 포인터 변수에 의해 참조되는 동적 객체, 구조체, 배열을 포함하는 프로그램에 대한 정확한 슬라이스 생성에 관한 연구이다. 포인터 변수와 같은 복잡한 구조를 가지는 프로그램에서 포인터 변수나 포인터 변수가 참조하는 객체의 상태를 파악하기 위해서 객체 참조상태 그래프를 제시한다.

• Journal of Korea Multimedia Society
• /
• v.3 no.1
• /
• pp.92-100
• /
• 2000

For the operation of the practical software systems, the development of new software, extension and modification phases of current software are successively needed through the new requirements added and their errors debugging detected. We need to understand current program exactly during a working serial jobs. When we'd like to extract the statements which influence the variable of specific statement of program, we generally analyze the program behavior through execution trace of program for the input values. It is important to compute dynamic program slice related to all statements that actually affect the value of a variable occurrence for a given program input and to develop techniques of its implementation. But traditional dynamic slicing techniques are inconvenient to make program execution history at the beginning implementation. In this paper, we propose a new improved algorithm which can produce program slice by use of dynamic control information and program slicing techniques except execution history file. Also we can find that the proposed program slicing approach is more efficient than the traditional program slicing algorithm on the practical testing environment.

• Journal of KIISE:Software and Applications
• /
• v.35 no.12
• /
• pp.741-752
• /
• 2008

Aspect-Oriented Software Development(AOSD) is the software development methodology that classifies concerns of the system and identifies crosscutting concerns and organizes aspect class, and AOSD has emerged as an important user-oriented software development methodology with high maintainability. However, most of related studies worked on identification and specification and coding of crosscutting concerns. And there have been few studies on slicing technique for tracing method of specified crosscutting concerns. Therefore, this paper proposes slicing technique based on AOSD that identifies and specifies crosscutting concerns through interactive analysis between use cases; also, suggests slicing technique which improves traceability centering on identified crosscutting concerns; applies the aspect-oriented slicing technique to Learning Management System(LMS) for case-study. LMS is a cyber educational system that demands a lot of functional changes and expansion, so it is effective to apply AOSD with high maintainability in developing LMS; and shows the results that compared with related studies by comparing six elements.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1542-1555
• /
• 1999

This paper proposes an algorithm for class hierarchies which can optimize member data and member function. This algorithm considers single/multiple inheritance, static/dynamic binding, overloading/overriding, pure virtual/virtual function, and constructor on the hierarchy of C++ class. We need to eliminate unused function that possesses many component element, because the program uses a limited of function in class hierarchies. Previous works on slicing mainly focused on selecting output data and including the related program statement. It was consists of structured programming language and also centralized on error detection, maintenance, and flexible testing. In this paper, we extend to the object-oriented language, makes a linked-table for objects to raise the efficiency of information management, and proposes necessary algorithm for optimizing system Through this process, we can obtain the simplification of program code and the progress of system performance by eliminating unused member data and member function.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.3
• /
• pp.495-504
• /
• 2012

This paper presents various speed optimization techniques for software implementation of the HIGHT block cipher on CPUs and GPUs. We considered 32-bit and 64-bit operating systems for CPU implementations. After we applied the bit-slicing and byte-slicing techniques to HIGHT, the encryption speed recorded 1.48Gbps over the intel core i7 920 CPU with a 64-bit operating system, which is up to 2.4 times faster than the previous implementation. We also implemented HIGHT on an NVIDIA GPU equipped with CUDA, and applied various optimization techniques, such as storing most frequently used data like subkeys and the F lookup table in the shared memory; and using coalesced access when reading data from the global memory. To our knowledge, this is the first result that implements and optimizes HIGHT on a GPU. We verified that the byte-slicing technique guarantees a speed-up of more than 20%, resulting a speed which is 31 times faster than that on a CPU.