• Title/Summary/Keyword: 머신시뮬레이션

Search Result 83, Processing Time 0.026 seconds

Design of Non-monotonic Deterministic Bolzmann Machine Using FPGA (FPGA를 이용한 비단조 DBM 네트워크 설계)

  • 강형원;박철영
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2004.06a
    • /
    • pp.3-7
    • /
    • 2004
  • 본 연구에서는 학습기능을 갖는 결정론적 볼츠만 머신에 비단조 뉴런을 이용하여 학습 성능을 수치 시뮬레이션을 통하여 분석한다. 먼저 네트워크의 은닉층에 비단조 및 단조뉴런을 이용한 경우에 대하여 각각 활성화 함수로 시그모이드 함수와 end-cut-off 타입의 비단조함수를 사용한 경우에 대하여 성능을 비교한다. 또한, VHDL을 이용해 설계한 DBM 네트워크에 시그모이드 함수와 end-cut-off 타입의 비단조함수를 사용한 경우에 대하여 시뮬레이션을 통해 수치 시뮬레이션과 성능이 같은지 비교하고 그 유용성을 입증한다.

  • PDF

Virtual Machine Provisioning Scheduling with Conditional Probability Inference for Transport Information Service in Cloud Environment (클라우드 환경의 교통정보 서비스를 위한 조건부 확률 추론을 이용한 가상 머신 프로비저닝 스케줄링)

  • Kim, Jae-Kwon;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.20 no.4
    • /
    • pp.139-147
    • /
    • 2011
  • There is a growing tendency toward a vehicle demand and a utilization of traffic information systems. Due to various kinds of traffic information systems and increasing of communication data, the traffic information service requires a very high IT infrastructure. A cloud computing environment is an essential approach for reducing a IT infrastructure cost. And the traffic information service needs a provisioning scheduling method for managing a resource. So we propose a provisioning scheduling with conditional probability inference (PSCPI) for the traffic information service on cloud environment. PSCPI uses a naive bayse inference technique based on a status of a virtual machine. And PSCPI allocates a job to the virtual machines on the basis of an availability of each virtual machine. Naive bayse based PSCPI provides a high throughput and an high availability of virtual machines for real-time traffic information services.

Energy-Aware Virtual Machine Deployment Method for Cloud Computing (클라우드 컴퓨팅 환경에서 사용패턴을 고려한 에너지 효율적인 가상머신 배치 기법)

  • Kim, Minhoe;Park, Minho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.1
    • /
    • pp.61-69
    • /
    • 2015
  • Through Virtual Machine technology(VM), VMs can be packed into much fewer number of physical servers than that of VMs. Since even an idle physical server wastes more than 60% of max power consumption, it has been considered as one of energy saving technologies to minimize the number of physical servers by using the knapsack problem solution based on the computing resources. However, this paper shows that this tightly packed consolidation may not achieve the efficient energy saving. Instead, a service pattern-based VM consolidation algorithm is proposed. The proposed algorithm takes the service time of each VM into account, and consolidates VMs to physical servers in the way to minimize energy consumption. The comprehensive simulation results show that the proposed algorithm gains more than 30% power saving.

Construction of a Compiled-code Simulator Generation System for Efficient Design Exploration in Embedded Core Design (임베디드 코어 설계시 효율적인 설계 공간 탐색을 위한 컴파일드 코드 방식 시뮬레이터 생성 시스템 구축)

  • Kim, Sang-Woo;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.71-79
    • /
    • 2011
  • This paper proposes a compiled-code simulator generation system based-on machine description language for efficient design space exploration in designing an embedded system optimized for a specific application. The proposed system generates a compiled-code simulator which maintains the functional accuracy of an event-driven simulator by determining instruction fetch and decoding processes statically. Generated simulator takes instruction-level and cycle-level simulation for estimating performances in embedded core. To show the efficiency of the constructed compiled-code simulator generator, architecture exploration had been performed for the JPEG encoder application. Starting with MIPS R3000 processor for one embedded core, the proposed system can produce the core showing optimized execution time for the application programming. In this process, a huge amount of simulation time has been used. Cycle-level compiled-code simulator has the functional accuracy and shows performance improvement by 21.7% in terms of simulation speed on the average when compared with an event-driven simulator.

The Development of Shape Guided Automatic Deburring Machine for Mold Products (금형제품용 형상안내형 자동면취기의 개발)

  • Hwang, Jong-Dae;Kim, Jin-Seob;Jung, Yoon-Gyo
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.10 no.1
    • /
    • pp.16-22
    • /
    • 2011
  • Recently, the deburring process which is last process of manufacture is one of the important process for complete product. The development of shape guided automatic deburring machine is essential because manual deburring process has very irregular quality and higher error rate as well as consider irregular shape radius. In order to develop of shape guided automatic deburring machine, in this study, we conducted 3D design, assembly, machine simulation and structural analysis using CATIA. Also, we conducted to make automatic deburring machine and conducted a performance test.

Design of High Efficiency Power Supply and Power Amplifier for Ultrasonic Parametric Array Transducer (초음파 파라메트릭 어레이 트랜스듀서용 고효율 전원 및 전력 증폭기 설계)

  • Kim, Jin-Young;Choi, Seung-Soo;Kim, In-Dong;Moon, Won-Kyu
    • Proceedings of the KIPE Conference
    • /
    • 2015.07a
    • /
    • pp.149-150
    • /
    • 2015
  • 압전 마이크로머신 초음파 트랜스듀서(Piezoelectric micro-machined ultrasonic transducers)는 DC 바이어스 전압을 인가해야 구동되는 특성을 가지고 있다. 따라서 초음파 트랜스 듀서를 구동하기 위한 전력증폭기는 DC 바이어스 전압이 요구되므로 기존의 전력증폭기에 비해 효율이 매우 낮아지게 된다. 이를 해결하기 위해 본 논문에서는 압전 마이크로머신 초음파 트랜스듀서를 구동하기 위한 고효율 전력증폭기를 제안한다. 전력증폭기는 AMP부와 전원부로 나뉘며, AMP부는 Class B Amp를 사용하여 높은 증폭 선형성을 갖는다. 전원부는 Amp를 구동하기위한 DC-DC converter가 에너지 회수 동작을 하므로 전력증폭기의 효율을 높일 수 있다. 본 연구에서는 압전 마이크로머신 초음파 트랜스듀서를 구동하기 위한 전력증폭기 회로를 제시하고 시뮬레이션과 실험을 통해 동작 특성을 검증한다.

  • PDF

A Virtual Machine Remapping Scheme for Reducing Relocation Time on a Cloud Cluster (클라우드 클러스터에서 가상머신 재배치시간을 단축하기 위한 재매핑 기법)

  • Kim, Chang-Hyeon;Kim, Jun-Sang;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.19 no.11
    • /
    • pp.1-7
    • /
    • 2014
  • In this paper, we propose a virtual machine(VM) remapping scheme that reduces VM relocation time on a cloud cluster. The proposed scheme finds VMs that should be migrated in sequence from a given VM map, and exchanges destinations of some VMs among them to reduce the VM relocation time. The VMs, the destinations of which will be exchanged, are chosen based on the amount of physical machine's available resources and migration completion time. The exchange of destinations is repeated until the VM relocation time cannot be shortened any further. Through a simulation, we show that the proposed scheme reduces VM relocation time by 42.7% in maximum.

Dynamic Relocation of Virtual Machines for Load Balancing in Virtualization Environment (가상화 환경에서 부하균형을 위한 가상머신 동적 재배치)

  • Sa, Seong-Il;Ha, Chang-Su;Park, Chan-Ik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.12
    • /
    • pp.568-575
    • /
    • 2008
  • Server consolidation by sever virtualization can make one physical machine(PM) to run several virtual machines simultaneously. Although It is attractive in cost, it has complex workload behaviors. For that reason, efficient resource management method is required. Dynamic relocation of virtual machine(VM)[3,4] by live migration[1,2] is one of resource management methods. We proposed SCOA(Server Consolidation Optimizing Algorithm) : a fine-grained load balancing mechanism worked on this dynamic relocation mechanism. We could obtain accurate resource distribution information through pointed physical machines on multi dimensional resource usage coordination, so we could maintain more balanced resource state. In this paper, we show the effectiveness of our algorithm by comparison of experimental results between SCOA and sandpiper[3] by software simulation.

Adaptive VM Allocation and Migration Approach using Fuzzy Classification and Dynamic Threshold (퍼지 분류 및 동적 임계 값을 사용한 적응형 VM 할당 및 마이그레이션 방식)

  • Mateo, John Cristopher A.;Lee, Jaewan
    • Journal of Internet Computing and Services
    • /
    • v.18 no.4
    • /
    • pp.51-59
    • /
    • 2017
  • With the growth of Cloud computing, it is important to consider resource management techniques to minimize the overall costs of management. In cloud environments, each host's utilization and virtual machine's request based on user preferences are dynamic in nature. To solve this problem, efficient allocation method of virtual machines to hosts where the classification of virtual machines and hosts is undetermined should be studied. In reducing the number of active hosts to reduce energy consumption, thresholds can be implemented to migrate VMs to other hosts. By using Fuzzy logic in classifying resource requests of virtual machines and resource utilization of hosts, we proposed an adaptive VM allocation and migration approach. The allocation strategy classifies the VMs according to their resource request, then assigns it to the host with the lowest resource utilization. In migrating VMs from overutilized hosts, the resource utilization of each host was used to create an upper threshold. In selecting candidate VMs for migration, virtual machines that contributed to the high resource utilization in the host were chosen to be migrated. We evaluated our work through simulations and results show that our approach was significantly better compared to other VM allocation and Migration strategies.

Simulation-Based Analysis of C System in C3 System of Systems Via Machine-Learning Based Abstraction of C2 System (머신러닝 기반의 C2 시스템 추상화를 통한 C3 복합체계에서의 시뮬레이션 기반 통신 시스템 분석)

  • Kang, Bong Gu;Seo, Kyung Min;Kim, Byeong Soo;Kim, Tag Gon
    • Journal of the Korea Society for Simulation
    • /
    • v.27 no.1
    • /
    • pp.61-73
    • /
    • 2018
  • In the defense modeling and simulation, for the detailed analysis of the communication system, many studies have carried out the analysis under the C3 SoS(system of systems) which consists of C2(command and control) and C(communication). However, it requires time and space constraints of the C2 system. To solve this problem, this paper proposes a communication analysis method in the standalone system environment which is combined with the C system after abstracting the C2 system. In the abstraction process, we hypothesize the traffic model and mobility model for C system analysis and learn the parameters in the model based on machine learning. Through the proposed method, it is possible to construct traffic and mobility model with different output according to the battlefield. This case study shows how the process can be applied to the C3 SoS and the enhanced accuracy than the existing method. We expect that it is possible to carry out the efficient communication analysis against many experimental scenarios with various communication parameters.