• Title/Summary/Keyword: Task schedule

Search Result 149, Processing Time 0.027 seconds

New Database Table Design Program of Real Time Network for High Speed Train

  • Cho, Chang-Hee;Park, Min-Kook;Kwon, Soon-Man;Kim, Yong-Ju;Kim, Sung-Shin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.2164-2168
    • /
    • 2003
  • Real time control system such as in factory automation fields, defense field, aerospace, railway industries, financial trading and so forth, includes multiple computers on multiple nodes, and share data to process various actions and functions. This is similar to multitasking in a multiprocessor computer system. The task processing efficiency of such system is proportionally increased by process speed of each process computer. And also it is greatly influenced by communication latencies of each node. To provide proper operation of such real time system, a network that can guarantee deterministic exchange of certain amount of data within a limited time is required. Such network is called as a real time network. As for modern distributed control system, the timeliness of data exchange gives important factor for the dynamics of entire control system. In a real time network system, exchanged data are determined by off-line design process to provide the timeliness of data. In other word, designer of network makes up a network data table that describes the specification of data exchanged between control equipments. And by this off-line design result, the network data are exchanged by predetermined schedule. First, this paper explains international standard real time network TCN (Train Communication Network) applied to the KHST (Korean High Speed Train) project. And then it explains the computer program developed for design tool of network data table of TCN.

  • PDF

Forecasting Day-ahead Electricity Price Using a Hybrid Improved Approach

  • Hu, Jian-Ming;Wang, Jian-Zhou
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.6
    • /
    • pp.2166-2176
    • /
    • 2017
  • Electricity price prediction plays a crucial part in making the schedule and managing the risk to the competitive electricity market participants. However, it is a difficult and challenging task owing to the characteristics of the nonlinearity, non-stationarity and uncertainty of the price series. This study proposes a hybrid improved strategy which incorporates data preprocessor components and a forecasting engine component to enhance the forecasting accuracy of the electricity price. In the developed forecasting procedure, the Seasonal Adjustment (SA) method and the Ensemble Empirical Mode Decomposition (EEMD) technique are synthesized as the data preprocessing component; the Coupled Simulated Annealing (CSA) optimization method and the Least Square Support Vector Regression (LSSVR) algorithm construct the prediction engine. The proposed hybrid approach is verified with electricity price data sampled from the power market of New South Wales in Australia. The simulation outcome manifests that the proposed hybrid approach obtains the observable improvement in the forecasting accuracy compared with other approaches, which suggests that the proposed combinational approach occupies preferable predication ability and enough precision.

A study of multi protocol communication on single serial interface (Serial 전송라인에서 Multi-Protocol 통신의 구현 연구)

  • Lee, Jae-Cheol;Ko, Dae-Sik
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.5
    • /
    • pp.464-469
    • /
    • 2008
  • The RS-232C (Unbalanced serial) and RS-485 (balanced serial) are standard in serial communication. RS-485 uses a differential electrical signal, as opposed to unbalanced signals referenced to ground with the RS-232. Differential transmission, which uses two lines each for transmit and receive signal results in greater noise immunity and longer distances as compared to the RS-232C. The greater noise immunity and distance are big advantages in industrial environments. In general, one protocol on one serial interface is very normal application. In this study, we implemented multi protocols on one serial RS-485 interface and examine the performance and result with hanging multi equipments.

  • PDF

SS-DRM: Semi-Partitioned Scheduling Based on Delayed Rate Monotonic on Multiprocessor Platforms

  • Senobary, Saeed;Naghibzadeh, Mahmoud
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.1
    • /
    • pp.43-56
    • /
    • 2014
  • Semi-partitioned scheduling is a new approach for allocating tasks on multiprocessor platforms. By splitting some tasks between processors, semi-partitioned scheduling is used to improve processor utilization. In this paper, a new semi-partitioned scheduling algorithm called SS-DRM is proposed for multiprocessor platforms. The scheduling policy used in SS-DRM is based on the delayed rate monotonic algorithm, which is a modified version of the rate monotonic algorithm that can achieve higher processor utilization. This algorithm can safely schedule any system composed of two tasks with total utilization less than or equal to that on a single processor. First, it is formally proven that any task which is feasible under the rate monotonic algorithm will be feasible under the delayed rate monotonic algorithm as well. Then, the existing allocation method is extended to the delayed rate monotonic algorithm. After that, two improvements are proposed to achieve more processor utilization with the SS-DRM algorithm than with the rate monotonic algorithm. According to the simulation results, SS-DRM improves the scheduling performance compared with previous work in terms of processor utilization, the number of required processors, and the number of created subtasks.

Workload Evaluation of Squatting Work Postures (쪼그려 앉은 작업자세에서의 작업부하 평가)

  • Lee, In-Seok;Chung, Min-Keun
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.2
    • /
    • pp.167-173
    • /
    • 1998
  • Many workers like welders work in squatting postures with the object on the ground during an entire work shift. It is suspected that such prolonged squatting without any supporting stool would gradually cause musculoskeletal injuries to workers. This study is to examine the physical stress caused by the prolonged squatting and to recommend a safe work/rest schedule for a welding task with squatting posture based on the lab experiments. In this study, 8 healthy student subjects participated in the experiment. They maintained a squatting work posture for 16 minutes with 4 different stool height conditions: no stool; 10cm height; 15cm height; and 20cm height. Every 2 minutes, the discomfort was subjectively assessed with the magnitude estimation method for the whole body, lower back, upper leg and lower leg. Based on discomfort ratings, we found that a 10cm height stool relieved the workload most. Discomfort rating results also indicated that a 20cm height stool showed the highest workload, and the there were no difference in workload between a 15cm height stool and no stool. We recommend to use low height stools and to maintain such working postures no longer than 6 minutes for prolonged squatting tasks.

  • PDF

Development of a Model for the Optimal Test Scheduling Considering Multiple Products (다제품 생산을 위한 최적 테스트 스케줄링 모델 개발)

  • Son, Hong-Rok;Ryu, Jun-Hyung;Lee, In-Beum
    • Korean Chemical Engineering Research
    • /
    • v.47 no.6
    • /
    • pp.695-699
    • /
    • 2009
  • As a rule, when develop new product in company, multiple products that have similar function are developed simultaneously. These products are subjected to a group of tests covering quality, safety and durability. If the schedule of tests is changed, the expected net presented value(NPV) of new products is changed. The tests should be scheduled with the goal of maximizing the expected NPV of the new products. A model incorporated resource constraints with the sequencing of testing tasks of multiple products is proposed in this paper. Examples show that the proposed model can handle stochastic task duration data represented by scenarios with probabilities.

Implementation of Hybrid Deliberative/Reactive Control Architecture for Autonomous Navigation of a Mobile Robot in Dynamic Environments (동적 환경에서 이동로봇의 자율주행을 위한 혼합 심의/반응 제어구조의 구현)

  • Nam Hwa-Sung;Song Jae-Bok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.2
    • /
    • pp.154-160
    • /
    • 2006
  • Instantaneous reaction and intelligence are required for autonomous mobile robots to achieve multiple goals in the unpredictable and dynamic environments. Design of the appropriate control architecture and clear definitions of systems are needed to construct and control these robots. This research proposes the hybrid deliberative/reactive control architecture which consists of three layers and uses the method of software structure design. The highest layer, Deliberative Layer makes the overall run-time schedule for navigation and/or manipulation, and the middle layer, Task Execution Layer carries out various missions. The lowest layer, Reactive Layer enables a robot to react rapidly in the dynamic environment and controls the mechanical devices concurrently. This paper proposes independent system supervisors called Manager to reuse the modules so that the Manager supports common use of the system and multi-processing tasks. It is shown that the mobile robot based on the proposed control scheme can perform the basic navigation and cope with the dynamic obstacles reasonably well.

An Efficient Duplication Based Scheduling Algorithm for Parallel Processing Systmes (병렬 처리 시스템을 위한 효율적인 복제 중심 스케쥴링 알고리즘)

  • Park, Gyeong-Rin;Chu, Hyeon-Seung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.8
    • /
    • pp.2050-2059
    • /
    • 1999
  • Multiprocessor scheduling problem has been an important research area for the past decades. The problem is defined as finding an optimal schedule which minimizes the parallel execution time of an application on a target multiprocessor system. Duplication Based Scheduling (DBS) is a relatively new approach for solving multiprocessor scheduling problems. This paper classifies DBS algorithms into two categories according to the task duplication method used. The paper then presents a new DBS algorithm that extracts the strong features of the two categories of DBS algorithms. The simulation study shows that the proposed algorithm achieves considerable performance improvement over existing DBS algorithms with similar time complexity.

  • PDF

Calculation of Sample Size for Guided Missile Considering Test Method and Reliability Growth (유도무기 시험평가 방법과 신뢰성 성장을 고려한 시험 수량 산출)

  • Lee, Youn-ho;Kim, Jae-hwang;Lee, Kye-shin;Lee, Jong-sin;Lee, Myoung-jin;Kim, Doo-hyun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.6
    • /
    • pp.844-852
    • /
    • 2017
  • Since guided weapon is high-cost and one-shot device which is non-reusable, it requires a lot of resources to prove required accuracy as a part of reliability demonstration. Once a test for proving accuracy rate of guided missile fails, it causes an additional cost and delay of schedule. This study introduces an equation for proper sample size and plan for guided-missile accuracy rate test in order to minimize the risk of test failure. Proper sample size for the test is derived by considering the reliability growth. Furthermore, each task for accuracy rate test is defined according to the development step. Therefore, this study can contribute to reduce sample size for accuracy rate test in order to meet the reliability requirement and assure transparency in the test process.

Scheduling of Sporadic and Periodic Tasks and Messages with End-to-End Constraints (양극단 제약을 갖는 비주기, 주기 태스크와 메시지 스케줄링)

  • Oh Hoon;Park Hong Seong;Kim Hyoung Yuk
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.2
    • /
    • pp.175-185
    • /
    • 2005
  • The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.