• 통합자연과학논문집
• /
• 제14권4호
• /
• pp.189-196
• /
• 2021

Recently, as a countermeasure for cyber breach attacks and confidential leak incidents on PC hard disk memory storage data of the metaverse industry, it is required when reviewing and developing a remote-based regular/real-time monitoring and analysis security system. The reason for this is that more than 90% of information security leaks occur on edge-end PCs, and tangible and intangible damage, such as an average of 1.20 billion won per metaverse industrial security secret leak (the most important facts and numerical statistics related to 2018 security, 10.2018. the same time as responding to the root of the occurrence of IT WORLD on the 16th, as it becomes the target of malicious code attacks that occur in areas such as the network system web due to interworking integration when building IT infrastructure, Deep-Access-based regular/real-time remote. The concept of memory analysis and audit system is key.

• 한국컴퓨터산업학회논문지
• /
• 제3권9호
• /
• pp.1167-1176
• /
• 2002

(경성) 실시간시스템에 있어서, 모든 긴급한 태스크는 만기라고 하는 시간적 제약조건을 충족시켜야만 한다. 개방시스템 환경이나 멀티미디어 서비스들을 위한 것들과 같은 많은 컴퓨터시스템들은 온라인으로 도착하는 새로운 작업들을 허용할 수 있느냐 없느냐에 대한 실시간 제어를 위한 효율적인 스케쥴가능성 검사를 필요로 한다. 비록 지금까지 여러가지의 다항식복잡도를 갖는 스케쥴 가능성 검사들이 제안되어 왔지만 이들은 시스템에 상당한 과부하가 걸릴때에는 이 시스템의 스케쥴 가능성을 종종 정확하게 판정하지 못한다. 더욱이, 온라인 실시간 스케쥴가능성검사들에 있어서의 대부분의 연구들이 주기적인 태스크 응용들에 집중되어 있다. 그래서 본 논문에서는 시스템에 과부하가 발생할 때 비주기적이며 선점가능한 태스크 집합들로 구성된 부정확한 온라인 실시간 태스크 시스템을 실행하기 이전에 스케쥴가능한지를 예측할 수 있는 효율적인 온라인 실시간 스케쥴 가능성 검사 알고리즘을 제시하였다.

• 한국IT서비스학회지
• /
• 제13권1호
• /
• pp.209-220
• /
• 2014

Most of monitoring systems in logistics industry have limitations on monitoring container information in real-time. And customers only could check information gathered from certain points through web browser. That is why it is very hard to take actions in advance when emergency situation has happened. But if customers could check information such as position and status of freight in real-time through their mobile devices, they could take prompt actions. So, in this study, mobile application based on mobile devices is developed to monitor position and status information of the container in real-time. Entire devices monitoring container in aspect of logistics security are handled by workers in the field. So it is strongly required to develop monitoring system operated in mobile devices. For that reason this study aims to develop mobile application in order to monitor information related to container security and safety in real-time.

• Journal of Electrical Engineering and information Science
• /
• 제1권1호
• /
• pp.118-128
• /
• 1996

In safety critical hard real-time systems, a timing fault may yield catastrophic results. In order to eliminate the timing faults from the fast responsive real-time control systems, it is necessary to schedule a code based on high precision timing analysis. Further, the schedulability enhancement by having multiple processors is of wide spread interest. However, although an instruction level parallel processing is quite effective to improve the schedulability of such a system, none of the real-time applications employ instruction level parallel scheduling techniques because most of the real-time scheduling models have not been designed for fine-grain execution. In this paper, we present a timing constraint model specifying high precision timing constraints, and a practical approach for constructing static schedules for a VLIW execution model. The new model and analysis can guarantee timing accuracy to within a single machine clock cycle.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2005년도 학술대회
• /
• pp.117-120
• /
• 2005

A Digital Broadcasting Satellite (DBS) receiver converts digital A/V streams received from a satellite to analog NTSC A,/V signals in real-time. Multi-tasking is an efficient way to improve the utilization of the processor core in real-time applications. In this paper, we propose a hybrid approach with a balanced trade-off between hardware kernel and multi-tasking programming to increase a system throughput. First, the schedulability of the critical hard real-time tass in the DBS receiver is verified by using a simple feasibility test. Then. several soft real-time tasks are thoughtfully programmed to satisfy functional requirements of the system.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2001년도 추계학술대회논문집 I
• /
• pp.247-251
• /
• 2001

Nowadays, base isolation systems such as lead-rubber bearing, elastomer bearing and sliding bearing have been installed to the various structures to prevent the disaster from seismic. The performance of base isolation system have been well proved by model-scale experiments and numerical analysis. However. the seismic response data measured at real large base-isolated structures is still insufficient. This paper presents a seismic monitoring system, acquiring real-time acceleration signals up to 32 channels, displaying time history and spectrum of the signals, storing the acquired data at a PC hard disk, and replaying the saved data. Moreover, the system can be operated without any limitation for monitoring period by automatic management of stored data file. The developed system has been installed at a real base-isolated building using lead-rubber bearings and we expect its seismic response data with ground motion signal can be well licquired in case of earthquake occurrence.

• 한국통신학회논문지
• /
• 제21권11호
• /
• pp.2801-2809
• /
• 1996

실시간 시스템을 위한 다중프로세서 환경에서 스케줄링 문제는 대부분 NP hard 문제로서 최적의 해를 구하는 것은 매우 어려우나, 휴리스틱에 의한 여러 효율적인 방법이 계속 연구되고 있다. 이중 주기적인 타스크들을 여러 프로세서에 어떻게 배치하면서 실시간성을 보장하는 가에 대한 연구도 진행되고 있다. 그 동안 연구되었던 배치 방법인 RMNF, RMFF, FFDUF 및 NEXT-Fit-M과 유사한 그룹에 의한 배치로 보다 적은 프로세서를 요구하는 방식 및 알고리즘 네가지를 제안하고, 주기적인 타스크들을 임의로 발생시켜 시뮬레이션을 수행하였다. 이러한 분석결과 제안한 방법이 기존의 방식보다 프로세서 수를 더 줄일 수 있음을 보였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.443-445
• /
• 2002

In this paper, we present a novel efficient semaphore implementation scheme which diminishes completion time of high priority tasks and improves reliability of a system. The real-time system is constrained to complete their tasks in time. Especially, the task of a hard real-time system must meet its deadline under unfavorable conditions. In this paper, the number and sort of the locked semaphores, when an event occurred, decide whether the context switch should occur or not, so higher priority tasks diminish in their completion time. The experimental results show that the proposed method gives performance improvements in finish time of high priority tasks of about 11% over the Zuberi.

• Journal of Computing Science and Engineering
• /
• 제2권4호
• /
• pp.375-393
• /
• 2008

The dynamic cast operation allows flexibility in the design and use of data management facilities in object-oriented programs. Dynamic cast has an important role in the implementation of the Data Management Services (DMS) of the Mission Data System Project (MDS), the Jet Propulsion Laboratory's experimental work for providing a state-based and goal-oriented unified architecture for testing and development of mission software. DMS is responsible for the storage and transport of control and scientific data in a remote autonomous spacecraft. Like similar operators in other languages, the C++ dynamic cast operator does not provide the timing guarantees needed for hard real-time embedded systems. In a recent study, Gibbs and Stroustrup (G&S) devised a dynamic cast implementation strategy that guarantees fast constant-time performance. This paper presents the definition and application of a cosimulation framework to formally verify and evaluate the G&S fast dynamic casting scheme and its applicability in the Mission Data System DMS application. We describe the systematic process of model-based simulation and analysis that has led to performance improvement of the G&S algorithm's heuristics by about a factor of 2. In this work we introduce and apply a library for extracting semantic information from C++ source code that helps us deliver a practical and verifiable implementation of the fast dynamic casting algorithm.

• 산업공학
• /
• 제11권2호
• /
• pp.159-176
• /
• 1998

In the motor manufacturing system with the properties of short delivery and order based production, the process plan is performed individually for each order by the expert of process plan after the completion of the detail design process to satisfy the specification to be required by customer. Also it is hard to establish the standard process plan in reality because part routings and operation times are varied for each order. Hence, the production planner has the problem that is hard to establish the production schedule releasing the job to the factory because there occurs the big difference between the real time to be completed the process plan and the time to be required by the production planner. In this paper, we study the decision supporting system for the process plan based on knowledge base concept. First, we represent the knowledge of process planner as a database model through the modified POI-Feature graph. Then we design and implement the decision supporting system imbedded in the heuristic algorithm in the client/server environment using the ORACLE relational database management system.