• Title/Summary/Keyword: output scheduling

Search Result 137, Processing Time 0.032 seconds

Improvement in Multiple Input-Output Inspecting Method through Classified Scheduling (다중 입출력 검사 방식의 세분화된 스케줄링을 통한 개선)

  • Park, Wonchan;Ryu, Hwankyu;Kim, Jungho;Ahn, Kihong
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.64-67
    • /
    • 2012
  • 복잡한 구조를 가진 케이블의 빠르고 정확한 검사를 위해 다중 입출력 검사 장치가 사용된다. 기존의 검사 장치의 제어 방법은 한번에 여러 가지 회선 특성을 가진 케이블의 검사가 불가능하며, 장치 안정성 및 검사 성능에 있어서 개선의 여지가 있으므로 이를 해결하기 위해서 본 논문에서는 입출력 장치의 검사 시퀀스 및 하드웨어 개량을 통한 개선 방법을 제안한다. 제안된 방법은 검사 명령 및 검사 결과를 저장하는 데이터 패킷에서 검사 명령을 좀더 세분화하여 패킷을 최적화하고 중복 명령을 제거하였으며, 입출력 신호 충돌 가능성을 차단하였다. 또한, I2C 버스 양방향 회로를 사용하여 전압 레벨 차이를 극복하고 활용성을 높일 수 있었다.

Codebook Design and Centralized Scheduling for Joint Transmission SDMA with Limited Feedback (제한된 피드백을 사용하는 결합 전송 공간 분할 다중 접속 기술을 위한 코드북 설계와 집중 스케줄링)

  • Mun, Cheol
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.23 no.10
    • /
    • pp.1180-1187
    • /
    • 2012
  • In this paper, joint transmission space division multiple access(JT-SDMA) scheme is proposed to mitigate inter-cell interference(ICI) in cooperative wireless communications system with limited feedback. We propose a systematic design method for a codebook consisting of a finite number of unitary matrices suitable for network multiple-input multiple-output( MIMO) channel characteristics. A centralized cluster scheduling scheme is proposed to both mitigate ICI and maximizes multiuser diversity gain with limited feedback. It is shown that the proposed JT-SDMA scheme outperforms a existing coordinated SDMA scheme even in wireless network environments where sufficient multiuser diversity order can not be provided through efficient ICI mitigation.

A Shipyard Layout Design System by Simulation (시뮬레이션 기반 조선소 레이아웃 설계 시스템 개발)

  • Song, Young-Joo;Lee, Dong-Kun;Woo, Jong-Hun;Shin, Jong-Gye
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.45 no.4
    • /
    • pp.441-454
    • /
    • 2008
  • Shipyard design and equipments layout problem, which are directly linked with the productivity of ship production, is an important issue serving as reference data of production plan for later massive production of ships. So far in many cases, design of a shipyard has been relying on the experienced engineers in shipbuilding, resulting in sporadic and poorly organized processes. And thus, economic losses as well as trials and errors in that accord have been pointed out as inevitable problems. This paper extracts a checklist of major elements to fine tune the shipbuilding yard designing process and the input/output data based on the simulation based shipbuilding yard layout designing framework and methodology proposed in existing researches, and executed initial architecture to develop software that integrates all the relevant processes and designing tools. In this course, both user request and design data by the steps are arranged and organized in the proposed layout design template form. In addition, simulation is done based on the parent shipbuilding process planning and scheduling data of the ship product, shipbuilding process and work stage facilities that constitute shipbuilding yard, and design items are verified and optimized with the layout and equipment list showing optimal process planning and scheduling effects. All the contents of this paper are based on simulation based shipbuilding yard layout designing methodology, and initial architecture processes are based on object oriented development methodology and system engineering methods.

Analysis of Electricity Cost Saving Effect by the Optimal load shifting Operation with 1MWh Redox Flow Battery (1MWh급 레독스흐름전지의 부하이전용 최적운전에 따른 전기요금 절감효과 분석)

  • Baek, Ja-Hyun;Ko, Eun-Young;Kang, Tae-Hyuk;Lee, Han-Sang;Cho, Soo-Hwan
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.7
    • /
    • pp.1151-1160
    • /
    • 2016
  • In recent years, the energy storage systems such as LiB, NaS, RFB(Redox-Flow Battery), Super- capacitor, pumped hydro storage, flywheel, CAES(Compressed Air Energy Storage) and so on have received great attention as practical solutions for the power supply problems. They can be used for various purpose of peak shaving, load leveling and frequency regulation, according to the characteristics of each ESS(energy storage system). This paper will focus at 1 MWh RFB system, which is being developed through the original technology project of energy material. The output of ESS is mainly characterized by C-rate, which means that the total rated capacity of battery will be delivered in 1 hour. And it is a very important factor in the ESS operation scheduling. There can be several options according to the operation intervals 15, 30 and 60minutes. The operation scheduling is based on the optimization to minimize the daily electricity cost. This paper analyzes the cost-saving effects by the each operating time-interval in case that the RFB ESS is optimally scheduled for peak shaving and load leveling.

Fuzzy LP Based Power Network Peak Shaving Algorithm (퍼지 LP 기반 전력망 Peak Shaving 알고리즘)

  • Ohn, Sungmin;Kim, Jung-Su;Song, Hwachang;Chang, Byunghoon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.6
    • /
    • pp.754-760
    • /
    • 2012
  • This paper describes peak shaving algorithms as long-term cycle scheduling in the power management system (PMS) for MW-scale battery energy storage systems (BESS). The purpose of PMS is basically to manage the input and output power from battery modules placed in the systems. Assuming that an one-day ahead load curve is provided, off-line peak shaving algorithms can be employed, but applying the results of the off-line algorithm may result in the difference in the real-time performance because there is uncertainty in the provided load curve. This paper adopts fuzzy based LP (linear programming) algorithms for describing the peak shaving algorithm in PMS and discusses a solution technique and real-time operation strategies using the solution.

A Cell Selection Technique Considering MIMO Precoding (MIMO 프리코딩을 고려한 셀 탐색 기법)

  • Kim, Han Seong;Hong, Tae Howan;Cho, Yong Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37A no.12
    • /
    • pp.1076-1084
    • /
    • 2012
  • In the CS/CB(Coordinated Scheduling/Beamforming) scheme, the cell edge user throughput is increased by selecting MIMO (Multiple Input Multiple Output) precoders which can minimize the interferences from adjacent base stations (BSs). However, in current LTE(Long Term Evolution) systems, the serving cell is selected in the initialization stage by using the synchronization signals and cell specific reference signals transmitted by adjacent BSs with a single antenna. The selected BS in the initialization stage may not be the best one since the MIMO precoding gain has not been considered in the cell selection stage. In this paper, a new cell selection technique is proposed for LTE systems with MIMO precoder by taking into account the effect of the precoder in the initialization stage. The proposed technique enables a user equipment (UE) in the cell boundary to select the serving BS by using the information (channel rank, effective channel capacity, and effective SINR(Signal to Interference plus Noise Ratio)) acquired from cell specific reference signals of candidate BSs. It is verified by computer simulation that the proposed technique can increase the channel capacity significantly in the multi-cell environments, compared with the conventional CS/CB scheme.

A Development of SCM Model in Chemical Industry Including Batch Mode Operations (회분식 공정이 포함된 화학산업에서의 공급사슬 관리 모델 개발)

  • Park, Jeung Min;Ha, Jin-Kuk;Lee, Euy Soo
    • Korean Chemical Engineering Research
    • /
    • v.46 no.2
    • /
    • pp.316-329
    • /
    • 2008
  • Recently the increased attention pays on the processing of multiple, relatively low quantity, high value-added products resulted in adoption of batch process in the chemical process industry such as pharmaceuticals, polymers, bio-chemicals and foods. As there are more possibilities of the improvement of operations in batch process than continuous processes, a lot of effort has been made to enhance the productivity and operability of batch processes. But the chemical process industry faces a range of uncertainties factors such as demands for products, prices of product, lead time for the supply of raw materials and in the production, and the distribution of product. And global competition has made it imperative for the process industries to manage their supply chains optimally. Supply chain management aims to integrate plants with their supplier and customers so that they can be managed as a single entity and coordinate all input/output flows (of materials, information) so that products are produced and distributed in the right quantities, to the right locations, and at the right time.The objective of this study is to solve the purchase, distribution, production planning and scheduling problem, which minimizes the total costs of production, inventory, and transportation under uncertainty. And development of SCM model in chemical industry including batch mode operations. Through that, the enterprise can respond to uncertainty. Also integrated process optimal planning and scheduling model for manufacturing supply chain. The result shows that, the advantage of supply chain integration are quality matters seen by customers and suppliers, order schedules, flexibility, cost reduction, and increase in sales and profits. Also, an integration of supply chain (production and distribution system) generates significant savings by trading off the costs associated with the whole, rather than minimizing supply chain costs separately.

Service Curve Allocation Schemes for High Network Utilization with a Constant Deadline Computation Cost (상수의 데드라인 계산 비용으로 높은 네트웍 유용도를 얻는 서비스 곡선 할당 방식)

  • 편기현;송준화;이흥규
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.4
    • /
    • pp.535-544
    • /
    • 2003
  • Integrated services networks should guarantee end-to-end delay bounds for real-time applications to provide high quality services. A real-time scheduler is installed on all the output ports to provide such guaranteed service. However, scheduling algorithms studied so far have problems with either network utilization or scalability. Here, network utilization indicates how many real-time sessions can be admitted. In this paper, we propose service curve allocation schemes that result in both high network utilization and scalability in a service curve algorithm. In service curve algorithm, an adopted service curve allocation scheme determines both network utilization and scalability. Contrary to the common belief, we have proved that only a part of a service curve is used to compute deadlines, not the entire curve. From this fact, we propose service curve allocation schemes that result in a constant time for computing deadlines. We through a simulation study that our proposed schemes can achieve better network utilizations than Generalized processor Sharing (GPS) algorithms including the multirate algorithm. To our knowledge, the service curve algorithm adopting our schemes can achieve the widest network utilization among existing scheduling algorithms that have the same scalability.

Efficient User Selection Algorithms for Multiuser MIMO Systems with Zero-Forcing Dirty Paper Coding

  • Wang, Youxiang;Hur, Soo-Jung;Park, Yong-Wan;Choi, Jeong-Hee
    • Journal of Communications and Networks
    • /
    • v.13 no.3
    • /
    • pp.232-239
    • /
    • 2011
  • This paper investigates the user selection problem of successive zero-forcing precoded multiuser multiple-input multiple-output (MU-MIMO) downlink systems, in which the base station and mobile receivers are equipped with multiple antennas. Assuming full knowledge of the channel state information at the transmitter, dirty paper coding (DPC) is an optimal precoding strategy, but practical implementation is difficult because of its excessive complexity. As a suboptimal DPC solution, successive zero-forcing DPC (SZF-DPC) was recently proposed; it employs partial interference cancellation at the transmitter with dirty paper encoding. Because of a dimensionality constraint, the base station may select a subset of users to serve in order to maximize the total throughput. The exhaustive search algorithm is optimal; however, its computational complexity is prohibitive. In this paper, we develop two low-complexity user scheduling algorithms to maximize the sum rate capacity of MU-MIMO systems with SZF-DPC. Both algorithms add one user at a time. The first algorithm selects the user with the maximum product of the maximum column norm and maximum eigenvalue. The second algorithm selects the user with the maximum product of the minimum column norm and minimum eigenvalue. Simulation results demonstrate that the second algorithm achieves a performance similar to that of a previously proposed capacity-based selection algorithm at a high signal-to-noise (SNR), and the first algorithm achieves performance very similar to that of a capacity-based algorithm at a low SNR, but both do so with much lower complexity.

Partly Random Multiple Weighting Matrices Selection for Orthogonal Random Beamforming

  • Tan, Li;Li, Zhongcai;Xu, Chao;Wang, Desheng
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.892-901
    • /
    • 2016
  • In the multi-user multiple-input multiple-output (MIMO) system, orthogonal random beamforming (ORBF) scheme is proposed to serve multiple users simultaneously in order to achieve the multi-user diversity gain. The opportunistic space-division multiple access system (OSDMA-S) scheme performs multiple weighting matrices during the training phase and chooses the best weighting matrix to be used to broadcast data during the transmitting phase. The OSDMA-S scheme works better than the original ORBF by decreasing the inter-user interference during the transmitting phase. To save more time in the training phase, a partly random multiple weighting matrices selection scheme is proposed in this paper. In our proposed scheme, the Base Station does not need to use several unitary matrices to broadcast pilot symbol. Actually, only one broadcasting operation is needed. Each subscriber generates several virtual equivalent channels with a set of pre-saved unitary matrices and the channel status information gained from the broadcasting operation. The signal-to-interference and noise ratio (SINR) of each beam in each virtual equivalent channel is calculated and fed back to the base station for the weighting matrix selection and multi-user scheduling. According to the theoretical analysis, the proposed scheme relatively expands the transmitting phase and reduces the interactive complexity between the Base Station and subscribers. The asymptotic analysis and the simulation results show that the proposed scheme improves the throughput performance of the multi-user MIMO system.