• Title/Summary/Keyword: schedule network

Search Result 275, Processing Time 0.033 seconds

Client-Server System for Manufacturing Devices (생산장비의 Client-Server화 연구)

  • Kim, Sun-Ho;Kim, Dong-Hoon;Lim, Ju-Taik
    • IE interfaces
    • /
    • v.12 no.2
    • /
    • pp.329-336
    • /
    • 1999
  • Job efficiency and productivity of a manufacturing system with frequent job schedule changes are affected by performance of information system between job order planners anti manufacturing device operators. This paper describes implementation of concurrent information system which can active identify machine status and dispatch job orders to operators in a machine shop. Client and server environment for various machinery is implemented using OSI based network between shop floor control system and manufacturing devices. Portability and scalability are among many characteristics of the implemented system. The developed client and server system is expected to realize high productivity for manufacturing device.

  • PDF

Semantics Aware Packet Scheduling for Optimal Quality Scalable Video Streaming (다계층 멀티미디어 스트리밍을 위한 의미기반 패킷 스케줄링)

  • Won, Yo-Jip;Jeon, Yeong-Gyun;Park, Dong-Ju;Jeong, Je-Chang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.10
    • /
    • pp.722-733
    • /
    • 2006
  • In scalable streaming application, there are two important knobs to tune to effectively exploit the underlying network resource and to maximize the user perceivable quality of service(QoS): layer selection and packet scheduling. In this work, we propose Semantics Aware Packet Scheduling (SAPS) algorithm to address these issues. Using packet dependency graph, SAPS algorithm selects a layer to maximize QoS. We aim at minimizing distortion in selecting layers. In inter-frame coded video streaming, minimizing packet loss does not imply maximizing QoS. In determining the packet transmission schedule, we exploit the fact that significance of each packet loss is different dependent upon its frame type and the position within group of picture(GOP). In SAPS algorithm, each packet is assigned a weight called QoS Impact Factor Transmission schedule is derived based upon weighted smoothing. In simulation experiment, we observed that QOS actually improves when packet loss becomes worse. The simulation results show that the SAPS not only maximizes user perceivable QoS but also minimizes resource requirements.

Adaptive Power Saving Protocol Based on Traffic Estimation for Wi-Fi Direct Networks (Wi-Fi Direct 망을 위한 부하량 예측 기반의 전력 절감 기법)

  • Yoo, Hongseok;Park, Yang-Woo;Lee, Chae-Soo;Yun, Tae-Jin
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.10 no.4
    • /
    • pp.207-212
    • /
    • 2015
  • Wi-Fi Direct allows battery powered mobile devices to form a wireless ad hoc network. Since one member of the network called Group Owner (GO) takes the role of managing the network, the network lifetime is mainly affected by the energy efficiency of GO. Hence, Wi-Fi Direct defines power saving schemes that allow GO to save the energy by turning off its radio interface during the periods called absence periods. However, the Wi-Fi Direct specification does not specify how to set parameters (denoted by PS parameters) determining the schedule of the absence periods. In this paper, we therefore propose a novel traffic-aware power saving scheme for Wi-Fi Direct networks. In particular, the proposed scheme estimates the application-level traffic load and adaptively tunes the PS parameters according to the estimated value.

Thread Distribution Method of GP-GPU for Accelerating Parallel Algorithms (병렬 알고리즘의 가속화를 위한 GP-GPU의 Thread할당 기법)

  • Lee, Kwan-Ho;Kim, Chi-Yong
    • Journal of IKEEE
    • /
    • v.21 no.1
    • /
    • pp.92-95
    • /
    • 2017
  • In this paper, we proposed a way to improve function of small scale GP-GPU. Instead of using superscalar which increase scheduling-complexity, we suggested the application of simple core to maximize GP-GPU performance. Our studies also demonstrated that simplified Stream Processor is one of the way to achieve functional improvement in GP-GPU. In addition, we found that developing of optimal thread-assigning method in Warp Scheduler for specific application improves functional performance of GP-GPU. For examination of GP-GPU functional performance, we suggested the thread-assigning way which coordinated with Deep-Learning system; a part of Neural Network. As a result, we found that functional index in algorithm of Neural Network was increased to 90%, 98% compared with Intel CPU and ARM cortex-A15 4 core respectively.

Study of Integrated Production-Distribution Planning Using Simulation and Genetic Algorithm in Supply Chain Network (공급사슬네트워크에서 시뮬레이션과 유전알고리즘을 이용한 통합생산분배계획에 대한 연구)

  • Lim, Seok-Jin
    • Journal of the Korea Safety Management & Science
    • /
    • v.22 no.4
    • /
    • pp.65-74
    • /
    • 2020
  • Many of companies have made significant improvements for globalization and competitive business environment The supply chain management has received many attentions in the area of that business environment. The purpose of this study is to generate realistic production and distribution planning in the supply chain network. The planning model determines the best schedule using operation sequences and routing to deliver. To solve the problem a hybrid approach involving a genetic algorithm (GA) and computer simulation is proposed. This proposed approach is for: (1) selecting the best machine for each operation, (2) deciding the sequence of operation to product and route to deliver, and (3) minimizing the completion time for each order. This study developed mathematical model for production, distribution, production-distribution and proposed GA-Simulation solution procedure. The results of computational experiments for a simple example of the supply chain network are given and discussed to validate the proposed approach. It has been shown that the hybrid approach is powerful for complex production and distribution planning in the manufacturing supply chain network. The proposed approach can be used to generate realistic production and distribution planning considering stochastic natures in the actual supply chain and support decision making for companies.

IEEE 802.15.4e TSCH-mode Scheduling in Wireless Communication Networks

  • Ines Hosni;Ourida Ben boubaker
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.4
    • /
    • pp.156-165
    • /
    • 2023
  • IEEE 802.15.4e-TSCH is recognized as a wireless industrial sensor network standard used in IoT systems. To ensure both power savings and reliable communications, the TSCH standard uses techniques including channel hopping and bandwidth reserve. In TSCH mode, scheduling is crucial because it allows sensor nodes to select when data should be delivered or received. Because a wide range of applications may necessitate energy economy and transmission dependability, we present a distributed approach that uses a cluster tree topology to forecast scheduling requirements for the following slotframe, concentrating on the Poisson model. The proposed Optimized Minimal Scheduling Function (OMSF) is interested in the details of the scheduling time intervals, something that was not supported by the Minimal Scheduling Function (MSF) proposed by the 6TSCH group. Our contribution helps to deduce the number of cells needed in the following slotframe by reducing the number of negotiation operations between the pairs of nodes in each cluster to settle on a schedule. As a result, the cluster tree network's error rate, traffic load, latency, and queue size have all decreased.

Solving Cluster Based Multicast Routing Problems Using A Simulated Annealing Algorithm (시뮬레이티디 어닐링 알고리즘을 이용한 클러스터 기반의 멀티캐스트 라우팅 문제 해법)

  • Kang Myung-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.9 no.3
    • /
    • pp.189-194
    • /
    • 2004
  • This paper proposes a Simulated Annealing(SA) algorithm for cluster-based Multicast Routing problems. Multicasting, the transmission of data to a group, can be solved from constructing multicast tree, that is. the whole network is partitioned to some clusters and the clusters are constructed by multicast tree. Multicast tree can be constructed by minimum-cost Steiner tree. In this paper, an SA algorithm is used in the minimum-cost Steiner tree. Especially, in SA, the cooling schedule is an important factor for the algorithm. Hence, in this paper, a cooling schedule is proposed for SA for multicast routing problems and analyzed the simulation results.

  • PDF

Development and Analysis of Real-time Distributed Air Defense System Simulator Using a Software Framework (소프트웨어 프레임워크를 이용한 대공유도무기 실시간 분산 시뮬레이터 개발 및 분석)

  • Cho, Byung-Gyu;Youn, Cheong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.8 no.4 s.23
    • /
    • pp.58-67
    • /
    • 2005
  • To overcome limitations of test scope, schedule and cost, M&S(Modeling & Simulation) technique has been applied for T&E(Test and Evaluation) of the state-of-art weapon systems. This paper proposes an air defense simulation software framework to reduce both redundancy an[1 programming errors in system simulator. The proposed framework consists of a 'model' and a 'middleware' The 'middleware' is a reliable communication service layer that supports not only HLA(High Level Architecture) which is an international standard in M&S but also TCP/IP, UDP and etc. The main role of 'model' is to schedule and to run the real-time distributed simulation. The proposed framework has been applied to M-SAM(Middle range Surface to Air Missile) system simulator. The proposed framework's scheduling and communication performance results are satisfactory and were measured by hardwired NTP(Network Timer Protocol) time-stamp with GPS(Global Positioning System) timer for better precision.

A Scheduling and Control System for a Ship Accommodation Design Process (선박 거주구 설계 일정관리 시스템)

  • Kim, J.J.;Kwon, O.H.
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.33 no.4
    • /
    • pp.124-132
    • /
    • 1996
  • This paper discusses a scheduling system effective for producing optimum load distribution in ship design process with particular reference to an accommodation design. Through various analysis of the factors influencing the effectiveness of design process control, it was possible to formulate an algorithm of producing an optimum design schedule. Basic manhours far the ship to be planned by multiplying a difficulty level coefficient for the standard manhours for each design activity is preset, and is converted into manhours for the ship to be planned by multiplying a difficulty level coefficient for the ship. A relation matrix of the design activities is employed in representing the network of the activities. The computerized system showed very effective in producing a design schedule of leveled work load on which particular characteristics of a ship to be planned are properly reflected.

  • PDF

Optimal Energy Consumption Scheduling in Smart-Grid Considering Storage Appliance : A Game-Theoretic Approach (스마트 그리드에 있어서 저장 장치를 고려한 최적 에너지 소비 스케줄링 : 게임 이론적 접근)

  • Yeo, Sangmin;Lee, Deok-Joo;Kim, Taegu;Oh, Hyung-Sik
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.41 no.5
    • /
    • pp.414-424
    • /
    • 2015
  • In this research, we consider a smart grid network of electricity with multiple consumers connected to a monopolistic provider. Each consumer can be informed the real time price changes through the smart meter and updates his consumption schedule to minimize the energy consumption expenditures by which the required power demand should be satisfied under the given real time pricing scheme. This real-time decision making problem has been recently studied through game-theoretic approach. The present paper contributes to the existing literature by incorporating storage appliance into the set of available household appliances which has somewhat distinctive functions compared to other types of appliances and would be regarded to play a significant role in energy consumption scheduling for the future smart grid. We propose a game-theoretic algorithm which could draw the optimal energy consumption scheduling for each household appliances including storage. Results on simulation data showed that the storage contributed to increase the efficiency of energy consumption pattern in the viewpoint of not only individual consumer but also whole system.