• Journal of Broadcast Engineering
• /
• v.11 no.3 s.32
• /
• pp.311-319
• /
• 2006

Platform operators adopted ATSC standard send only their own channel program schedule information, so in order for the viewer to see other channel information, they have to tune the channel to the other. This issue arises from the operators' lack of bandwidth and the business interest conflicts between the platform operators. This paper guides how ATSC standard could be used within Xlet based application to display other channel information through the ISG (Integrated Scheduling Guide) technology via interactive return channel services. Its own channel information can be displayed by using on-air PSIP (Program and System Information Protocol) data.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.04a
• /
• pp.83-92
• /
• 1993

의사결정지원시스템의 성패여부는 사용자가 사용하기에 편리하고 효과적인 모형으로 구축되었는가에 달려있다. 아무리 훌륭한 시스템 분석기법을 활용하였다 하더라도 사용자가 불편하여 사용하지 않으면 그 의사결정 지원 시스템은 사장되고 말 것이며 많은 시간과 정성을 들여 개발한 연구결과가 빛을 보지 못할 것이다. 본 연구에서는 일반적인 중소기업의 제조업 환경에서 생산 일정 계획 수립을 위한 의사결정 지원 시스템의 구축을 중심으로, 사용자 편의를 고려한 시스템이 갖추어야할 사양 및 이에 대한 설계, 객체지향 프로그래밍 기법의 활용, 시스템 구현상의 문제점 등에 대하여 구체적으로 설명하고 해결방안에 대하여 고찰한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.100-102
• /
• 2000

본 논문에서는 디스크의 이용률을 향상시키기 위하여 효율적인 디스크 스케줄링 알고리즘을 제안한다. 디스크 요구는 제공되는 서비스의 레벨을 따라 주기적인 요구, 비 주기적인 요구, 대화형 요구로 나눈다. 기존의 멀티미디어 서비스를 위한 디스크 스케줄링은 공정성 및 디스크 대역폭 보장만을 고려하였는데 본 논문에서는 대화형 요구를 고려하여 디스크 스케줄링의 공정성 및 주기적인 요구의 대역폭을 보장하고 디스크 이용률을 향상시켜 처리 가능한 요구 수를 증가시킬 수 있는 디스크 스케줄링을 제안한다.

• Korean Journal of Construction Engineering and Management
• /
• v.20 no.2
• /
• pp.95-104
• /
• 2019

EPC plant projects are large and complex, requiring systematic working methodologies, accumulated data, and thorough planning through communications between the entities. In this study, the method of extracting the process planning information using asset data of the plant project and using it to present the initial process plan is presented through the concept of IAP(Interactive Planning). In order to carry out the effective IAP at the early stage of the project, this study extracted the schedule element information from the asset data, created the process plan for each work package, and applied it to the sample project case. Through the proposed IAP methodology, it is possible to promote the utilization of asset data, to identify schedule risks, and to develop countermeasures, which can form the basis for establishing the process management strategy to successfully complete the project.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1994.10a
• /
• pp.32-32
• /
• 1994

In this example, a message passing based multicomputer system with general interdonnedtion network is considered. After multicomputer systems are developed with morm-hole routing network, topologies of interconecting network are not major considertion for process management and resource sharing. Tehre is an independeent operating system kernel oneach node. It communicates with other kernels using message passingmechanism. Based on this architecture, the problem is how mech does performance degradation will occur in the case of processor sharing on multicomputer systems. Processor sharing between application programs is veryimprotant decision on system performance. In almost cases, application programs running on massively parallel computer systems are not so much user-interactive. Thus, the main performance index is system throughput. Each application program has various communication patterns. and the sharing of processors causes serious performance degradation in hte worst case such that one processor is shared by two processes and another processes are waiting the messages from those processes. As a result, considering this problem is improtant since it gives the reason whether the system allows processor sharingor not. Input data has many parameters in this simulation . It contains the number of threads per task , communication patterns between threads, data generation and also defects in random inupt data. Many parallel aplication programs has its specific communication patterns, and there are computation and communication phases. Therefore, this phase informatin cannot be obtained random input data. If we get trace data from some real applications. we can simulate the problem more realistic . On the other hand, simualtion results will be waseteful unless sufficient trace data with varisous communication patterns is gathered. In this project , random input data are used for simulation . Only controllable data are the number of threads of each task and mapping strategy. First, each task runs independently. After that , each task shres one and more processors with other tasks. As more processors are shared , there will be performance degradation . Form this degradation rate , we can know the overhead of processor sharing . Process scheduling policy can affects the results of simulation . For process scheduling, priority queue and FIFO queue are implemented to support round-robin scheduling and priority scheduling.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.511-520
• /
• 2007

Decay usage scheduling algorithm gives preference to processes that have consumed little CPU in the recent past. It has been widely-used in time-sharing systems such as UNIX, where CPU-intensive processes and interactive processes are mixed. However, there has been no sound understanding about the mixed effects of decay usage parameters on the service performance. This paper empirically analyzes their effects in terms of the resulting service bandwidth and delay Based on such empirical analysis, we derive the clear meaning of each parameter. Such analysis and understanding provides a basis of controlling decay usage parameters for desirable service provision as required by applications.

• Proceedings of the Korean Institute Of Construction Engineering and Management
• /
• autumn
• /
• pp.565-568
• /
• 2003

Roadway construction planning processes involve a large amount of information on design, construction methods, quantities, unit costs, and production rates. GIS (Geographic Information System) is a strong tool for integration and managing various types of information such as spatial and non-spatial data required for roadway construction planning. This paper proposes a GIS-based system for improving roadway construction planning with its 'Spatial Analysis' and 'Visualization' functions. The proposed system cail help construction planner make a proper decision in a unique way by integrating design information and construction information within the system and creating design element modules for space scheduling purposes in real-time with its 'Interactive Planning' function.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.10a
• /
• pp.12-16
• /
• 1998

The purpose of this paper is to develop a knowledge-based real-time decision support system to support decision makers for efficient berth operation of Inchon Port. In these days, the efficient berth operation has been many studied. The berth operation rules differ from port to port and the problem is highly dependent on natural, geographical and operational environment of port. In Inchon Port, the ship's entrance into port and departure from port is extremely affected by the status of dock and berth because of capacity restriction. First, we analyzed the specific characteristics of Inchon Port such as dock based on the data of 1997. And then, we construct the database of experts knowledge for berth utilization. Finally, we build the real-time decision support system for the efficient berth operation of Inchon Port to make the better berth allocation in case of not only regular scheduling but also dynamic scheduling such as delay in berth operation and exchange of ship between berths. The DSS is developed with graphic user interface(GUI) concept to help the user determining user interactive updating of the port status. Then this DSS will be provide decision maker with an efficient and fast way to berth allocation, and reduce wastes of time, space, and manpower in Inchon Port operation.

• Proceedings of the KIEE Conference
• /
• 1996.07b
• /
• pp.823-825
• /
• 1996

This paper proposes a preventive maintenance scheduling system which is a user-friendly decision-making support system. The objective of the development of the package is to supply KEPCO's working experts with a useful tool for gaining a practical maintenance schedule. This program based on the MS Windows is made up of two main modules. The first is an interactive decision-making support module(IDSM). The main objective of this module is to provide various useful text and graphic information to users, and enable practicing engineers with sensitivity analysis of a targeting maintenance schedule. The second is a mathematical optimization module(MOM). In this module, the objective function of levelizing net reserve ratio with daily time-increment is optimized using the relaxation method.

• Journal of KIISE:Software and Applications
• /
• v.29 no.12
• /
• pp.957-965
• /
• 2002

Garbage collection in the CLDC typically employs a stop-the-world GC algorithm which is performing a complete garbage collection when needed. This technique is unsuitable for the interactive Java embedded system because this can lead to long and unpredictable delays. In this paper, We present a garbage collection algorithm which reduces the average delay time and supports the interactive environment. Our garbage collector is composed of the allocator and the collector. The allocator determines the allocation position of free-list according to object size, and the collector uses an incremental mark-sweep algorithm. The garbage collector is called periodically by the thread scheduling policy and the allocator allocates the objects of marked state during collection cycle. Also, we introduce a color toggle mechanism that changes the meaning of the bit patterns at the end of the collection cycle. We compared the performance of our implementation with stop-the-world mark-sweep GC. The experimental results show that our algorithm reduces the average delay time and that it provides uniformly low response times.