• Title/Summary/Keyword: observation scheduling

Search Result 20, Processing Time 0.028 seconds

DETERMINATION OF USER DISTRIBUTION IMAGE SIZE AND POSITION OF EACH OBSERVATION AREA OF METEOROLOGICAL IMAGER IN COMS

  • Seo, Jeong-Soo;Seo, Seok-Bae;Kim, Eun-Kyou;Jung, Sung-Chul
    • Proceedings of the KSRS Conference
    • /
    • v.1
    • /
    • pp.228-231
    • /
    • 2006
  • In this paper, requirements of Meteorological Administration about Meteorological Imager (MI) of Communications, Ocean and Meteorological Satellite (COMS) is analyzed for the design of COMS ground station and according to the analysis results, the distribution image size of each observation area suitable for satellite Field Of View (FOV) stated at the requirements of meteorological administration is determined and the precise satellite FOV and the size of distribution image is calculated on the basis of the image size of the determined observation area. The results in this paper were applied to the detailed design for COMS ground station and also are expected to be used for the future observation scheduling and the scheduling of distribution of user data.

  • PDF

DETERMINATION OF USER DISTRIBUTION IMAGE SIZE AND POSITION OF EACH OBSERVATION AREA OF METEOROLOGICAL IMAGER IN COMS (COMS 기상탑재체의 관측영역별 사용자 배포 영상의 크기 및 위치결정)

  • Seo, Jeong-Soo;Seo, Seok-Bae;Kim, Eun-Kyou
    • Journal of Astronomy and Space Sciences
    • /
    • v.23 no.4
    • /
    • pp.415-424
    • /
    • 2006
  • In this paper, requirements of Meteorological Administration about Meteorological Image. (MI) of Communications, Ocean and Meteorological Satellite (COMS) is analyzed for the design of COMS ground station and according to the analysis results, the distribution image size of each observation area suitable for satellite Field Of View (FOV) stated at the requirements of meteorological administration is determined and the precise satellite FOV and the size of distribution image is calculated on the basis of the image size of the determined observation area. The results in this paper were applied to the detailed design for COMS ground station and also are expected to be used for the future observation scheduling and the scheduling of distribution of user data.

Coordinating Production Order and Scheduling Policy under Capacity Imbalance

  • Rhee, Seung-Kyu
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.21 no.2
    • /
    • pp.171-186
    • /
    • 1996
  • This paper comes from an observation that overemphasis on capacity utilization meausre, which is usual under capacity shortage, can seriously hurt the firm's profit and potential process improvement. We suggest a model that can be used in designing a coordination scheme for decentralized marketing and manufacturing activities. Using a price and time-sensitive demand and capacitated lotsizing model, we derive an effective communication medium betwen marketing and manufacturing. This Balance Indicator of process capacity and flexibility also implies that the increase in capacity availability and setup time reduction should be balanced by its market requirements. This is particularly important when a firm tries to improve its process capability by kaizen. Further, the model can be used to show the comparative performances of scheduling policies under capacity imbalnce. We show the shortening the scheduling cycle can improve the firm profit without changing the simple scheduling rule.

  • PDF

Performance Enhancement of On-Line Scheduling Algorithm for IRIS Real-Time Tasks using Partial Solution (부분 해를 이용한 IRIS 실시간 태스크용 온-라인 스케줄링 알고리즘의 성능향상)

  • 심재홍;최경희;정기현
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.1
    • /
    • pp.12-21
    • /
    • 2003
  • In this paper, we propose an on-line scheduling algorithm with the goal of maximizing the total reward of IRIS (Increasing Reward with Increasing Service) real-time tasks that have reward functions and arrive dynamically into the system. We focus on enhancing the performance of scheduling algorithm, which W.: based on the following two main ideas. First, we show that the problem to maximize the total reward of dynamic tasks can also be solved by the problem to find minimum of maximum derivatives of reward functions. Secondly, we observed that only a few of scheduled tasks are serviced until a new task arrives, and the rest tasks are rescheduled with the new task. Based on our observation, the Proposed algorithm doesn't schedules all tasks in the system at every scheduling print, but a part of tasks. The performance of the proposed algorithm is verified through the simulations for various cases. The simulation result showed that the computational complexity of proposed algorithm is$O(N_2)$ in the worst case which is equal to those of the previous algorithms, but close to O(N) on the average.

Dispatching Rule based Job-Shop Scheduling Algorithm with Delay Schedule for Minimizing Total Tardiness (지연 스케쥴을 허용하는 납기최소화 잡샵 스케쥴링 알고리즘)

  • Kim, Jae-Gon;Bang, June-Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.1
    • /
    • pp.33-40
    • /
    • 2019
  • This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

The FB mechanism for TCP traffic over UBR connections in the subnet ATM model (서브네트 ATM 모델에서의 UBR 연결 TCP 트래픽 전송을 위한 FB 기법)

  • 김우준;이병기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.6
    • /
    • pp.1610-1618
    • /
    • 1998
  • In this paper, we present the FB(Fair Buffering) mechanism for the efficient support of TCP traffic over UBR connections in the subnet ATM model. We show that both throughput and fairness may be improved with the FB mechanism. The FB mechanism is founded on the observation that the performance of TCP over UBR connections is optimal when the buffer space is allocated in proportion to the connection's bandwidth-delay product. We compare through simulation the performance of the existing drop-tail, EB(Equal Buffering) and the proposed FB buffer management schemes, with and without RR(Roung-Robin) scheduling, and demonstrate that the proposed FB mechanism is most effective when used in conjunction with the RR scheduling scheme.

  • PDF

A new warp scheduling technique for improving the performance of GPUs by utilizing MSHR information (GPU 성능 향상을 위한 MSHR 정보 기반 워프 스케줄링 기법)

  • Kim, Gwang Bok;Kim, Jong Myon;Kim, Cheol Hong
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.13 no.3
    • /
    • pp.72-83
    • /
    • 2017
  • GPUs can provide high throughput with latency hiding by executing many warps in parallel. MSHR(Miss Status Holding Registers) for L1 data cache tracks cache miss requests until required data is serviced from lower level memory. In recent GPUs, excessive requests for cache resources cause underutilization problem of GPU resources due to cache resource reservation fails. In this paper, we propose a new warp scheduling technique to reduce stall cycles under MSHR resource shortage. Cache miss rates for each warp is predicted based on the observation that each warp shows similar cache miss rates for long period. The warps showing low miss rates or computation-intensive warps are given high priority to be issued when MSHR is full status. Our proposal improves GPU performance by utilizing cache resource more efficiently based on cache miss rate prediction and monitoring the MSHR entries. According to our experimental results, reservation fail cycles can be reduced by 25.7% and IPC is increased by 6.2% with the proposed scheduling technique compared to loose round robin scheduler.

Secure Performance Analysis Based on Maximum Capacity

  • Zheng, Xiuping;Li, Meiling;Yang, Xiaoxia
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1261-1270
    • /
    • 2020
  • The physical security layer of industrial wireless sensor networks in the event of an eavesdropping attack has been investigated in this paper. An optimal sensor selection scheme based on the maximum channel capacity is proposed for transmission environments that experience Nakagami fading. Comparing the intercept probabilities of the traditional round robin (TRR) and optimal sensor selection schemes, the system secure performance is analyzed. Simulation results show that the change in the number of sensors and the eavesdropping ratio affect the convergence rate of the intercept probability. Additionally, the proposed optimal selection scheme has a faster convergence rate compared to the TRR scheduling scheme for the same eavesdropping ratio and number of sensors. This observation is also valid when the Nakagami channel is simplified to a Rayleigh channel.

Performance Evaluation of the Full-Scale Active Mass Dampers based on a Numerical Model and Test (실물크기 능동형 제어장치의 수치모델 및 실험에 기초한 성능 평가)

  • Jeon, Min-Jun;Lee, Sang-Hyun;Woo, Sung-Sik;Mun, Dae-Ho
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.28 no.6
    • /
    • pp.635-643
    • /
    • 2015
  • In this study, the experimental test results are given to confirm the control efficiency of the linear control algorithm used for designing the active mass dampers(AMD) which are supposed to be installed at Incheon international airport control tower. The comparison between the results from test and numerical analysis is conducted and it was observed that the AMD showed the control performance expected by the numerical model. The effects of the gain scheduling and constant-velocity signal added to the control signal calculated by the algorithm is identified through the observation that the AMD always show behavior within the given stroke limit without any loss of the desired control performance. The phase difference between the accelerations of the structure and the AMD were almost close to 90 degree, which implies that the AMD absorbed the structural energy effectively.

DEEP-South: Automated Scheduler and Data Pipeline

  • Yim, Hong-Suh;Kim, Myung-Jin;Roh, Dong-Goo;Park, Jintae;Moon, Hong-Kyu;Choi, Young-Jun;Bae, Young-Ho;Lee, Hee-Jae;Oh, Young-Seok
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.41 no.1
    • /
    • pp.54.3-55
    • /
    • 2016
  • DEEP-South Scheduling and Data reduction System (DS SDS) consists of two separate software subsystems: Headquarters (HQ) at Korea Astronomy and Space Science Institute (KASI), and SDS Data Reduction (DR) at Korea Institute of Science and Technology Information (KISTI). HQ runs the DS Scheduling System (DSS), DS database (DB), and Control and Monitoring (C&M) designed to monitor and manage overall SDS actions. DR hosts the Moving Object Detection Program (MODP), Asteroid Spin Analysis Package (ASAP) and Data Reduction Control & Monitor (DRCM). MODP and ASAP conduct data analysis while DRCM checks if they are working properly. The functions of SDS is three-fold: (1) DSS plans schedules for three KMTNet stations, (2) DR performs data analysis, and (3) C&M checks whether DSS and DR function properly. DSS prepares a list of targets, aids users in deciding observation priority, calculates exposure time, schedules nightly runs, and archives data using Database Management System (DBMS). MODP is designed to discover moving objects on CCD images, while ASAP performs photometry and reconstructs their lightcurves. Based on ASAP lightcurve analysis and/or MODP astrometry, DSS schedules follow-up runs to be conducted with a part of, or three KMTNet telescopes.

  • PDF