• Title/Summary/Keyword: Scheduling System

Search Result 2,159, Processing Time 0.029 seconds

A Study on the Operation and Special Quality of the Records Disposition Schedule (기록물분류기준표 특성 및 운영에 관한 연구)

  • Park, Yoo-Jin
    • Journal of Information Management
    • /
    • v.35 no.1
    • /
    • pp.71-91
    • /
    • 2004
  • This study focuses on establishing a base for approaching record disposition schedules, which may be felt unfamiliar, through the overview of record disposition schedules. For this purpose, this study examined the meaning of record disposition schedules, the significance and principle of their elements, and their operation. In addition, it presented tasks to perform for record disposition schedules to play a central role of record management in the future. This study showed that record disposition schedules authorize people to control and process records, and are closely related to the development and the stability of record disposition system in Korea. What is more, it proved that record disposition schedules enable the assessment of the historical values of records, so it is possible to maintain records from the perspective of historical records. Besides, record disposition schedules are important in that they contain information on organizations and their functions, based on which we can preserve and manage extrinsic information about records.

Satellite On-board ATM Switch Based on Knockout Switch (Knockout 스위치를 기반으로 한 위성 On-board ATM 스위치 구조 연구)

  • 김진상;박영근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11C
    • /
    • pp.113-122
    • /
    • 2001
  • Several guidelines can be developed for a satellite-based ATM switch. One of the most important of these is that the switch must provide a requirement for CLRs on the order of 10-10 to meet the QoS of high- performance traffic and avoid costly retransmissions. In this paper, the proposed approach shows not only the better traffic performance but also requires the little switching elements and buffers compared with original Knockout switch and other scheduling algorithm. As a result, the complexity becomes reduced. Simulation results indicate that proposed approach shows excellent cell loss ratio compared with existing switch architecture. Also, iii performance can be approached to the cell loss ratio, which is requirement for the satellite system, as window size increases. An(1 it shows thats low complexity is induced. Therefore, the proposed approach is appropriate for satellite on-board ATM switch architecture.

  • PDF

Performance Analysis of Multiplexed VBR MPEG Video Traffic With Arbitrary Starting Times in ATM Networks (ATM망에서의 임의의 시작 시간 배열을 갖는 다중화된 가변 비트율 MPEG 비디오 트래픽의 성능 해석)

  • 노병희;김재균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.23 no.6
    • /
    • pp.1514-1525
    • /
    • 1998
  • Two main characteristics of VBR MPEG video traffic are different statistics according to different picture types and the periodic traffic pattern due to GOP structure. Especially, the I-pictures at the beginning of each GOP generate $$\mu$h more traffic than other pictures. When several VBR Mpeg video sources are superposed, the I-picture starting times of these sources may significantly affect the cell loss characteristics of ATM $$\mu$tiplexers. In this paper, we propse a performance model for ATM $$\mu$tiplexers with VBR MPEG video sources whose starting times are arbitrary given. For analysis, both single and superposed source traffic are modeled as NDPPs (non-deterministic periodic processes), and the ATM $$\mu$tiplexer is modeled as a U-state NDPPD/D/1/B queueing system. It is hown that the numerical results are very close to the si$$\mu$ation results. From the relationships between the starting tiem distributions and the corresponding $$\mu$tiplexer performances, some considerations for designing a scheduling policy in order to obtain the maxi$$\mu$ $$\mu$tiplexing gain are presented.

  • PDF

Optimal Charging and Discharging for Multiple PHEVs with Demand Side Management in Vehicle-to-Building

  • Nguyen, Hung Khanh;Song, Ju Bin
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.662-671
    • /
    • 2012
  • Plug-in hybrid electric vehicles (PHEVs) will be widely used in future transportation systems to reduce oil fuel consumption. Therefore, the electrical energy demand will be increased due to the charging of a large number of vehicles. Without intelligent control strategies, the charging process can easily overload the electricity grid at peak hours. In this paper, we consider a smart charging and discharging process for multiple PHEVs in a building's garage to optimize the energy consumption profile of the building. We formulate a centralized optimization problem in which the building controller or planner aims to minimize the square Euclidean distance between the instantaneous energy demand and the average demand of the building by controlling the charging and discharging schedules of PHEVs (or 'users'). The PHEVs' batteries will be charged during low-demand periods and discharged during high-demand periods in order to reduce the peak load of the building. In a decentralized system, we design an energy cost-sharing model and apply a non-cooperative approach to formulate an energy charging and discharging scheduling game, in which the players are the users, their strategies are the battery charging and discharging schedules, and the utility function of each user is defined as the negative total energy payment to the building. Based on the game theory setup, we also propose a distributed algorithm in which each PHEV independently selects its best strategy to maximize the utility function. The PHEVs update the building planner with their energy charging and discharging schedules. We also show that the PHEV owners will have an incentive to participate in the energy charging and discharging game. Simulation results verify that the proposed distributed algorithm will minimize the peak load and the total energy cost simultaneously.

Optimal Supply Chain formation using Agent Negotiation in SET Model based Make-To-Order (최적 공급사슬 구성을 위한 에이전트 협상방법론 개발)

  • Kim Hyun-Soo;Cho Jae-Hyung;Choi Hyung-Rim;Hong Soon-Goo
    • Journal of Intelligence and Information Systems
    • /
    • v.12 no.2
    • /
    • pp.99-123
    • /
    • 2006
  • In an effect to composite an optimal supply chain, this study has introduced an agent-based negotiation as a method to assign a lot of orders to a large number of participants. As a resources allocation mechanism to form a strategic cooperation based on information sharing between supply chain members(buyers, manufacturers, suppliers), this agent negotiation provides coordination functions allowing all participants to make a profit and accomplishing Pareto optimum solution from the viewpoint of a whole supply chain. A SET model-based scheduling takes into consideration both earliness production cost and tardiness production cost, along with a competitive relationship between multiple participants. This study has tried to prove that the result of an agent-based negotiation is a Pareto optimal solution under the dynamic supply chain environment, establishing the mathematical formulation for a performance test, and making a comparison with the heuristic Branch & Bound method.

  • PDF

A Cryptoprocessor for AES-128/192/256 Rijndael Block Cipher Algorithm (AES-128/192/256 Rijndael 블록암호 알고리듬용 암호 프로세서)

  • 안하기;박광호;신경욱
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2002.05a
    • /
    • pp.257-260
    • /
    • 2002
  • This paper describes a design of cryptographic processor that implements the AES (Advanced Encryption Standard) block cipher algorithm“Rijndael”. To achieve high throughput rate, a sub-pipeline stage is inserted into the round transformation block, resulting that the second half of current round function and the first half of next round function are being simultaneously operated. For area-efficient and low-power implementation the round transformation block is designed to share the hardware resources in encryption and decryption. An efficient scheme for on-the-fly key scheduling, which supports the three master-key lengths of 128-b/192-b/256-b, is devised to generate round keys in the first sub-pipeline stage of each round processing. The cryptoprocessor designed in Verilog-HDL was verified using Xilinx FPGA board and test system. The core synthesized using 0.35-${\mu}{\textrm}{m}$ CMOS cell library consists of about 25,000 gates. Simulation results show that it has a throughput of about 520-Mbits/sec with 220-MHz clock frequency at 2.5-V supply.

  • PDF

A Pseudo-Random Beamforming Technique for Time-Synchronized Mobile Base Stations with GPS Signal

  • Son, Woong;Jung, Bang Chul
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.7 no.2
    • /
    • pp.53-59
    • /
    • 2018
  • This paper proposes a pseudo-random beamforming technique for time-synchronized mobile base stations (BSs) for multi-cell downlink networks which have mobility. The base stations equipped with multi-antennas and mobile stations (MSs) are time-synchronized based on global positioning system (GPS) signals and generate a number of transmit beamforming matrix candidates according to the predetermined pseudo-random pattern. In addition, MSs generate receive beamforming vectors that correspond to the beam index number based on the minimum mean square error (MMSE) using transmit beamforming vectors that make up a number of transmit beamforming matrices and wireless channel matrices from BSs estimated via the reference signals (RS). Afterward, values of received signal-to-interference-plus-noise ratio (SINR) with regard to all transmit beamforming vectors are calculated, and the resulting values are then feedbacked to the BS of the same cells along with the beam index number. Each of the BSs calculates each of the sum-rates of the transmit beamforming matrix candidates based on the feedback information and then transmits the calculated results to the BS coordinator. After this, optimum transmit beamforming matrices, which can maximize a sum-rate of the entire cells, are selected at the BS coordinator and informed to the BSs. Finally, data signals are transmitted using them. The simulation results verified that a sum-rate of the entire cells was improved as the number of transmit beamforming matrix candidates increased. It was also found that if the received SINR values and beam index numbers are feedbacked opportunistically from each of the MSs to the BSs, not only nearly the same performance in sum-rate with that of applying existing feedback techniques could be achieved but also an amount of feedback was significantly reduced.

A Study on the Development of a Mid-term Scheduling System for Shipbuilding Using ILOG (ILOG를 이용한 조선 중일정계획 시스템 개발에 관한 연구)

  • 우상복;김상훈;한형상;김기동;김훈주
    • Proceedings of the Korea Society for Simulation Conference
    • /
    • 2001.05a
    • /
    • pp.143-143
    • /
    • 2001
  • 조선 산업에서의 이익 극대화를 위해서는, 공기 단축을 통한 매출 증대, 주어진 생산 자원(인력, 설비 등)의 효율적인 이용을 통한 생산비 절감이 필수적인 사안이다. 다시 말하면, 효율적인 자원의 이용으로 선박의 건조 공기를 줄임으로써 조선 산업에서의 이익 극대화를 도모할 수 있고 이는 효과적인 생산 계획과 관리를 통해 얻을 수 있다. 조선 산업에서의 생산 계획과 관리는 내업, 선행, 선내 등 선박 건조의 전 과정에서 이루어지고 있는데, 조선 산업은 타 산업에 비해 환경변화에 따른 단기간의 불확실성은 비교적 적은 반면에, 가공, 절단, 조립, 의장, 도장, 선행탑재, 탑재, 안벽 작업 등 다단계 제조 프로세스가 장기간에 걸쳐 상당히 복잡하게 구성되어 있다. 또한, 유연하게 적용할 수 있는 인적자원과 공정순서, 그리고 각종 시간적 공간적 자원 제약 등으로 인하여 효과적이고 일관된 생산 계획을 신속하게 수립하기가 어려울 뿐만 아니라, 주문 생산 방식이기 때문에 정확한 일정계획 데이터의 생성도 어려운 실정이다. 본 연구는, 조선의 혁신적인 생산관리 능력 향상을 지원하기 위한 "조선 통합 생산계획 시스템 개발" 에 관련된 연구이다. 본 연구에서는 조선 생산계획에 적합한 일정계획 방법론 및 엔진 소프트웨어를 활용하고 총체적인 생산계획 및 일정계획 업무의 개념 재정립을 통하여, 통합 최적화를 실시간에 지원하는 조선 최적 일정계획 시스템 구축에 궁극적인 목적을 두고 있다. 이를 위해 본 연구에서는 조선 프로세스와 일정계획 업무규칙을 분석하고 이를 바탕으로 "조선 최적 일정계획 시스템"을 개발하였다. 조선 최적 일정계획 시스템은 블록, PE, 탑재, 선내 단계의 일정계획 최적화와 What-if Simulation을 지원하기 위하여 ILOG Solver/scheduler로 구현하였으며, 구현된 시스템에 대해 실제 계획에서 사용하는 데이터를 대상으로 다양한 최적화 기능에 대한 실험을 실시하였다. 실제 데이터를 이용한 실험결과, 풀이시간과 최적해 측면 모두에서 비교적 만족할 만한 결과를 보여주었다.교적 만족할 만한 결과를 보여주었다.

  • PDF

Cross-Layer Optimized Resource Allocation Scheme for OFDMA based Micro Base Stations (OFDMA 기반 마이크로 기지국을 위한 계층간 최적화된 자원할당 기법)

  • Cho, Sung-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.6
    • /
    • pp.49-56
    • /
    • 2010
  • In this paper, a joint PHY-MAC layer optimized resource allocation scheme for OFDMA based micro base stations is investigated. We propose cross-layer optimized two-stage resource allocation scheme including cross-layer functional description and control information flow between PHY-MAC layers. The proposed two-stage resource allocation scheme consists of a user grouping stage and a resource allocation stage. In the user grouping stage, users are divided into a macro base station user group and a micro base station user group based on the PHY-MAC layer characteristics of each user. In the resource allocation stage, a scheduling scheme and an allotment of resources are determined. In the proposed scheme, diversity and adaptive modulation and coding (AMC) schemes are exploited as schedulers. Simulation results demonstrate that the proposed scheme increases the average cell throughput about 40~80 % compared to the conventional system without micro base stations.

The Design of New Optical Switching Networks for Efficient Data Transmission in BcN (BcN 망에서 효율적인 데이터 전송을 위한 새로운 개념의 광 교환망 설계)

  • Lee SeoungYoung;Park Hong-Shik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.12
    • /
    • pp.31-36
    • /
    • 2005
  • In this paper, we propose a new optical switching system as a infrastructure of the BcN, in which the high traffic volume will be expected due to the multimedia service, like P2P services. Because the JET protocol, the most popular protocol in OBS (Optical Burst Switching) research area, has high blocking probability for burst, it prevents commercialization in real network for its low throughput in TCP layer. To improve high blocking rate in OBS network, we segment large network into small network and perform burst scheduling to avoid burst loss. By using proposed scheme, Internet provider can reduce network deployment cost in Metro network as well as large mesh core networks