• Journal of Advanced Navigation Technology
• /
• v.2 no.2
• /
• pp.132-142
• /
• 1998

In optical scanning holography, 3-D holographic information of an object is generated by 2-D active optical scanning. The optical scanning beam can be a time-dependent Gaussian apodized Fresnel zone plate. In this technique, the holographic information manifests itself as an electrical signal which can be sent to an electron-beam-addressed spatial light modulator for coherent image reconstruction. This technique can be applied to 3-D optical remote sensing especially for identifying flying objects. In this paper, we first briefly review optical scanning holography and analyze the resolution achievable with the system. We then present mathematical expression of real and virtual image which are responsible for holographic image reconstruction by using Gaussian beam profile.

• 전기의세계
• /
• v.46 no.5
• /
• pp.19-27
• /
• 1997

본 논문은 제 2장에서 실시간 시스템의 기본 특성에 대해 보다 자세하게 살펴본 후, 제 3장에서 플랜트의 동적 특성을 관련 제어이론을 활용하여 실시간 시스템의 가장 중요한 정보인 작업 데드라인을 유도하는 방법을 살펴본다. 제 4장에서는 효율적인 실시간 제어 컴퓨터를 설계 및 평가하기 위해 실시간 시스템 분야에서 수행되는 연구동향으로 다음과 같은 세부 분야를, i) 스케줄링, ii)실시간 컴퓨터 언어, iii)실시간 운영체계(O/S), iv)실시간 동기화, v) 실시간 H/W 구조(architecture), vi) 실시간 통신, vii) 고장허용기법(fault-tolerance)에 대해 설명하고, 마지막 장에서 향후의 관련 연구 과제들에 대해 간단한 소개로 결론짓는다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.5_6
• /
• pp.307-318
• /
• 2003

In this paper, we design and construct a TMO object group that provides the guaranteed real-time services in the distributed object computing environments, and verify execution power of its model for the correct distributed real-time services. The TMO object group we suggested is based on TINA's object group concept. This model consists of TMO objects having real-time properties and some components that support the object management service and the real-time scheduling service in the TMO object group. Also TMO objects can be duplicated or non-duplicated on distributed systems. Our model can execute the guaranteed distributed real-time service on COTS middlewares without restricting the specially ORB or the of operating system. For achieving goals of our model. we defined the concepts of the TMO object and the structure of the TMO object group. Also we designed and implemented the functions and interactions of components in the object group. The TMO object group includes the Dynamic Binder object and the Scheduler object for supporting the object management service and the real-time scheduling service, respectively The Dynamic Binder object supports the dynamic binding service that selects the appropriate one out of the duplicated TMO objects for the clients'request. And the Scheduler object supports the real-time scheduling service that determines the priority of tasks executed by an arbitrary TMO object for the clients'service requests. And then, in order to verify the executions of our model, we implemented the Dynamic Binder object and the Scheduler object adopting the binding priority algorithm for the dynamic binding service and the EDF algorithm for the real-time scheduling service from extending the existing known algorithms. Finally, from the numerical analyzed results we are shown, we verified whether our TMO object group model could support dynamic binding service for duplicated or non-duplicated TMO objects, also real-time scheduling service for an arbitrary TMO object requested from clients.

• Journal of Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1423-1435
• /
• 2010

Building wireless sensor networks requires a constituting sensor node to consider the following limited hardware resources: a small battery lifetime limiting available power supply for the sensor node, a low-power microprocessor with a low-performance computing capability, and scarce memory resources. Despite such limited hardware resources of the sensor node, the sensor node platform needs to activate real-time sensing, guarantee the real-time processing of sensing data, and exchange data between individual sensor nodes concurrently. Therefore, in this paper, we propose an energy-efficient real-time task scheduling technique for battery-powered wireless sensor nodes. The proposed energy-efficient task scheduling technique controls the microprocessor's operating frequency and reduces the power consumption of a task by exploiting the slack time of the task when the actual execution time of the task can be less than its worst case execution time. The outcomes from experiments showed that the proposed scheduling technique yielded efficient performance in terms of guaranteeing the completion of real-time tasks within their deadlines and aiming to provide low power consumption.

• Journal of the Korea Society for Simulation
• /
• v.19 no.4
• /
• pp.99-109
• /
• 2010

Existing research about automated wafer transport management strategy for semiconductor manufacturing equipment was mainly focused on dispatching rules which is optimized to specific system layout, process environment or transfer patterns. But these methods can cause problem as like requiring additional rules or changing whole transport management strategy when applied to new type of process or system. In addition, a lack of consideration for interconnectedness of the added rules can cause unexpected deadlock. In this study, in order to improve these problems, propose dynamic priority based transfer job decision making algorithm which is applicable with regardless of system lay out and transfer patterns. Also, extra rule handling part proposed to support special transfer requirement which is available without damage to generality for maintaining a consistent scheduling policies and minimize loss of stability due to expansion and lead to improve productivity at the same time. Simulation environment of Twin-slot type semiconductor equipment was built In order to measure performance and examine validity about proposed wafer scheduling algorithm.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.357-362
• /
• 2007

In distributed systems like cluster systems, in order to get more performance improvement, the initial task placement system precisely estimates and correctly assigns the resource requirement by the process. The resource-based initial job placement scheme needs the prediction of resource usage of a task in order to fit it to the most suitable hosts. However, the wrong prediction of resource usage causes serious performance degradation in dynamic load balancing systems. Therefore, in this paper, to resolve the problem due to the wrong prediction, we propose a new load metric. By the new load metric, the resource-based initial job placement scheme can work without priori knowledge about the type of process. Simulation results show that the dynamic load balancing system using the proposed approach achieves shorter execution times than the conventional approaches.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.307-312
• /
• 2008

최근 전기 전력 도메인의 IT화 (전력 IT) 가 본격적으로 진행되면서 전기 데이터를 취득하기 위한 기기들 뿐만 아니라 전력 운영 환경이 변화를 도모하고 있다 본 논문에서는 이런 전력 IT 의 일환으로 개발된 지능형 전력 정보 모니터링 시스템 (K-WAMS)을 소개하고자 한다. 이 시스템은 이기종 분산 환경에서 전력 정보를 실시간으로 전송 받아 현재 전력계통의 상황을 직관적으로 판단할 수 있는 정보를 제공하여 광역 정전을 예방하고자 하는 조기경보시스템 (Early Warning System) 이다. 또한, 전력계통의 안정성 여부를 판단하는 지능형 에이전트의 구현을 통해 광역 정전을 예견하는 지수를 제공하고, 실시간 데이터 처리 및 이력 데이터 저장 에이전트들을 통해 현재 취득되고 있는 현장 데이터 모니터링 기능을 제공한다. K-WAMS 는 실시간으로 전송 처리되는 고속 대용량 데이터들의 처리 지연, 동적 환경으로 인한 네트워크의 부하문제를 해결하기 위해서 IPC Shared Memory 기법을 이용하였고, 동적 프로세스들의 작업 스케줄링을 관리하기 위한 IPC Message Queue 기법을 이용하였다. 또한 논리적 기능 기반으로 설계된 현재 중앙 급전소(GCC) 단위의 설계 모델은 향후 지역 급전소(RCC) 단위로 설치 될 경우 재사용 되어 개발 생산성을 향상시킬 것으로 예상된다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.171-172
• /
• 2009

가상화 기술을 기반으로 하는 클라우드 컴퓨팅은 시스템 내에 존재하는 자원을 분할하여 이용하거나 독립적으로 존재하는 자원을 통합하는 측면에서는 매우 편리하고 용이하다. 또한 컴퓨팅 자원의 활용률을 극대화하는 이점도 존재한다. 하지만 가상화 기술 자체만으로는 사용자의 요청에 동적으로 가상화된 자원, 즉 가상 머신(Virtual Machine)을 생성, 복제, 할당 및 삭제 등의 관리 작업에 어려움이 존재한다. 따라서 본 논문에서는 Xen 과 Globus Toolkit 을 기반으로 구축된 환경에서 가상 머신의 관리를 편리하게 처리할 수 있는 가상 머신 매니저를 그리드 서비스로 설계 및 구현하였다. 또한 사용자의 요청을 효율적으로 처리하기 위해 작업과 자원에 대한 실시간 스케줄링 방법을 제안한다.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.31-37
• /
• 2008

In this paper, we propose a dynamic job relocation strategy that considering application's characteristics in multiple grid sites. This scheme classifies application to execute in multiple grid sites by their characteristics : computing intensive application, network intensive application. Also, it eliminates the communication between sites by allocating the network intensive application in single site, thus reducing the total job execution time. But if a number of free nodes to execute the network intensive application aren't found in single site, the proposed scheme the first allocates the network intensive application in multiple sites to minimize network latency. Then if the network intensive application being executed in multiple sites suitable free nodes are found in single site. the proposed scheme relocates the application being executed in multiple sites to another single site. This results in reducing the total job execution time. Through simulation, we show that the proposed dynamic job reallocation strategy improves the performance of Data Grid environment compared with previous strategies.

• KIISE Transactions on Computing Practices
• /
• v.23 no.9
• /
• pp.572-577
• /
• 2017

Virtualization allows multiple virtual machines to share the resources of a physical machine in order to utilize idle resources. The purpose of virtualization is the efficient allocation of resources among virtual machines. However, the efficient allocation of resources is difficult because the workload characteristics of each virtual machine cannot be understood in the current virtualization environment. This causes performance interference among virtual machines, which leads to performance degradation of the virtual machine. Previous works have been carried out to develop a method of solving such performance interference. This paper introduces a representative method, a CPU scheduling method that guarantees I/O performance by using feedback control to solve performance interference. In addition, we compare and analyze a model-based feedback control method and a dynamic feedback control method.