• Title/Summary/Keyword: scheduling method

Search Result 1,379, Processing Time 0.03 seconds

Parallel Processing of Airborne Laser Scanning Data Using a Hybrid Model Based on MPI and OpenMP (MPI와 OpenMP기반 하이브리드 모델을 이용한 항공 레이저 스캐닝 자료의 병렬 처리)

  • Han, Soo-Hee;Park, Il-Suk;Heo, Joon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.30 no.2
    • /
    • pp.135-142
    • /
    • 2012
  • In the present study, a parallel processing method running on a multi-core PC-Cluster is introduced to produce digital surface model (DSM) and digital terrain model (DTM) from huge airborne laser scanning data. A hybrid model using both message passing interface (MPI) and OpenMP was devised by revising a conventional MPI model which utilizes only MPI, and tested on a multi-core PC-Cluster for performance validation. In the results, the hybrid model has not shown better performances in the interpolation process to produce DSM, but the overall performance has turned out to be better by the help of reduced MPI calls. Additionally, scheduling function of OpenMP has revealed its ability to enhance the performance by controlling inequal overloads charged on cores induced by irregular distribution of airborne laser scanning data.

Determination of Dairy Cow Food Intake using Simulated Annealing (시뮬레이티드 어닐링을 이용한 젖소의 급이량 산정)

  • 허은영;김동원;한병성;김용준;이수영
    • Journal of Biosystems Engineering
    • /
    • v.27 no.5
    • /
    • pp.433-450
    • /
    • 2002
  • The daily food intake for dairy cows has to be effectively controlled to breed a sound group of cows as well as to enhance the productivity of the cows. But, feed stuffs are fed in the common bulk for a group of cows in most cases despite that the individual food intake has to be varied. To obtain the feed for each cow, both the nutrient requirements and the nutrient composition of fred have to be provided in advance, which are based on the status of cows such as weigh marginal weight amount of milk, fat concentration in milk, growth and milking stages, and rough feed ratio, etc. Then, the mixed ration fur diet would be computed by the nutrient requirements constraints. However, when TMR (Total Mixed Ration) is conventionally supplied for a group of cows, it is almost impossible to get an optimal feed mixed ration meeting the nutrient requirements of each individual cow since the constraints are usually conflicting and over-constrained although they are linear. Hence, addressed in this paper is a simulated annealing (SA) technique to find the food intake for dairy cows, considering the characteristics of individual or grouped cows. Appropriate parameters fur the successful working of SA are determined through preliminary experiments. The parameters include initial temperature, epoch length. cooling scheduling, and stopping criteria. In addition, a neighborhood solution generation method for the effective improvement of solutions is presented. Experimental results show that the final solution for the mixture of feed fits the rough feed ratio and some other nutrient requirements such as rough fiber, acid detergent fiber, and neutral detergent fiber, with 100 percent, while fulfilling net energy for lactating, metabolic energy, total digestible nutrients, crude protein, and undegraded intake protein within average five percent.

Burst Assembly Scheme based on SCM for Avoidance of Burst Collision in Optical Burst-Switched Networks (OBS 망에서 버스트 충돌 회피를 위한 SCM 기반의 버스트 생성 기법)

  • 이해정;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.6B
    • /
    • pp.538-547
    • /
    • 2004
  • Optical Burst Switched (OBS) networks usually employ one-way reservation by sending a burst control packet (BCP) with a specific offset time, before transmitting each data burst frame (BDF). Therefore, The quality of service may be degraded because contentions may lead to loss of BDFs. Especially, this phenomenon becomes more serious when burst size is longer. This necessitates an effective method of prevention to avoid burst collision in nodes. OBS networks can employ several methods to avoid such burst losses. One is that burst size is cut short to reduce burst loss probability during scheduling time. In this paper, we evaluate the burst generation and transmission using Sub-Carrier Multiplexting (SCM) in OBS networks. We propose an appropriate burst assembly architecture and transmission scheme based on SCM in OBS networks. The performance of SCM in OBS networks is examined in terms of number of Sub-Carriers per wavelength, burst loss probability, throughput, and total bandwidth of an optical fiber.

A Study on the Optimum Navigation Route Safety Assessment System using Real Time Weather Forecasting (실시간 기상 정보를 이용한 최적 항로 안전 평가 시스템의 연구)

  • Choi, Kyong-Soon;Park, Myung-Kyu;Lee, Jin-Ho;Park, Gun-Il
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.13 no.2 s.29
    • /
    • pp.133-140
    • /
    • 2007
  • Since early times, captain have been sailing to select the optimum route considering the weather, ship loading status condition and operational scheduling empirically. However, it is rare to find digitalized onboard route support system whereas weather facsimile or wave and swell chart are utilized for the officer, based on captain's experience. In this paper, optimal route safety assessment system which is composed of voyage efficiency and safety component is introduced. Optimum route minimizea ETA(estimated time of arrival) and fuel consumption that shipping company and captain are requiring to evaluate for efficient voyage considering speed loss and power increase based on wave added resistance of ship. In the view point of safety, seakeeping prediction is performed based on 3 dimensional panel method. Finally, It is assistance measure for ship's optimum navigation route safety planning & assessment.

  • PDF

Function Approximation for accelerating learning speed in Reinforcement Learning (강화학습의 학습 가속을 위한 함수 근사 방법)

  • Lee, Young-Ah;Chung, Tae-Choong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.635-642
    • /
    • 2003
  • Reinforcement learning got successful results in a lot of applications such as control and scheduling. Various function approximation methods have been studied in order to improve the learning speed and to solve the shortage of storage in the standard reinforcement learning algorithm of Q-Learning. Most function approximation methods remove some special quality of reinforcement learning and need prior knowledge and preprocessing. Fuzzy Q-Learning needs preprocessing to define fuzzy variables and Local Weighted Regression uses training examples. In this paper, we propose a function approximation method, Fuzzy Q-Map that is based on on-line fuzzy clustering. Fuzzy Q-Map classifies a query state and predicts a suitable action according to the membership degree. We applied the Fuzzy Q-Map, CMAC and LWR to the mountain car problem. Fuzzy Q-Map reached the optimal prediction rate faster than CMAC and the lower prediction rate was seen than LWR that uses training example.

Automated Stacking Crane Dispatching Strategy in a Container Terminal using Genetic Algorithm (유전 알고리즘을 이용한 자동화 컨테이너 터미널에서의 장치장 크레인의 작업 할당 전략)

  • Wu, Jiemin;Yang, Young-Jee;Choe, Ri;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.36 no.5
    • /
    • pp.387-394
    • /
    • 2012
  • In an automated container terminal, automated stacking cranes(ASCs) take charge of handling of containers in a block of the stacking yard. This paper proposes a multi-criteria strategy to solve the problem of job dispatching of twin ASCs which are identical to each another in size and specification. To consider terminal situation from different angles, the proposed method evaluates candidate jobs through various factors and it dispatches the best score job to a crane by doing a weighted sum of the evaluated values. In this paper, we derive the criteria for job dispatching strategy, and we propose a genetic algorithm to optimize weights for aggregating evaluated results. Experimental results are shown that it is suitable for real time terminal with lower computational cost and the strategy using various criteria improves the efficiency of the container terminal.

A study on the staffing of an Airline Call Center using Integer Programming (항공사 Call Center 근무형태 결정을 위한 정수계획법 활용)

  • Han, Jae-Seon;Kim, Joon-Suk
    • Journal of Global Scholars of Marketing Science
    • /
    • v.11
    • /
    • pp.183-207
    • /
    • 2003
  • The human resource management is a very important thing to an airline call center. It may lead the call center to success or fail. The call center managers have to make appropriate decisions how many persons are inputted into the operation for each unit time and all day. In this study, a method is suggested to get an optimal staffing for each unit time using Integer Programming. The Integer Programming model can be used to solve the efficiency problem of the call center's staffing and scheduling. And call certer manager can adopt this model into the operations of the call center without any difficulties or modifications.

  • PDF

A Model for Assessing Maximum Overtime Rate in Labor Subcontracting Practices

  • Nassar, Khaled;Hosny, Ossama
    • Journal of Construction Engineering and Project Management
    • /
    • v.2 no.2
    • /
    • pp.18-27
    • /
    • 2012
  • Despite the rapid development in the construction industry due to the changing new technologies, many projects still fail to meet target deadlines. Shortage in manpower and skilled laborers is one of the main reasons for such delays. Markets with high economic growth and economic expansion (such as Gulf Countries in the Middle East) may have pronounced labor the shortages. Labor subcontracting practices are used sometimes to increase production rates and meet project deadlines. This paper explains and analyses labor subcontracting practices currently being used in many places around the world (and especially in the Gulf Countries) and in particular defines a maximum overtime rate for laborers in the laborer-subcontracting method ensuring that the contractor gains both the time saved during overtime and also reduces the cost per unit produced. The mathematical model used formalizes a closed-form equation for overtime pay in similar situations and as such can be applicable worldwide. Data was collected from representative projects that employed such practices from various trades. Validation of the model and formula has been tested successfully by analyzing historic data. The results prove that contractors often do not reach the optimum use of their practices resulting in a higher cost per unit. The presented model and the analysis should be of interest to many contractors currently involved in the practice or considering its use and to those who wish to find new methods that would help in eliminating as much wastes as possible by allocating their resources in the most efficient way.

Searching for an Intra-block Remarshalling Plan for Multiple Transfer Cranes (복수 트랜스퍼 크레인을 활용하는 블록 내 재정돈 계획 탐색)

  • Oh Myung-Seob;Kang Jae-Ho;Ryu Kwang-Ryel;Kim Kap-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.7
    • /
    • pp.624-635
    • /
    • 2006
  • This paper applies simulated annealing algorithm to the problem of generating a plan for intra-block remarshalling with multiple transfer cranes. Intra-block remarshalling refers to the task of rearranging containers scattered around within a block into certain designated target areas of the block so that they can be efficiently loaded onto a ship. In generating a remarshalling plan, the predetermined container loading sequence should be considered carefully to avoid re-handlings that may delay the loading operations. In addition, the required time for the remarshalling operation itself should be minimized. A candidate solution in our search space specifies target locations of the containers to be rearranged. A candidate solution is evaluated by deriving a container moving plan and estimating the time needed to execute the plan using two cranes with minimum interference. Simulation experiments have shown that our method can generate efficient remarshalling plans in various situations.

GPGPU Task Management Technique to Mitigate Performance Degradation of Virtual Machines due to GPU Operation in Cloud Environments (클라우드 환경에서 GPU 연산으로 인한 가상머신의 성능 저하를 완화하는 GPGPU 작업 관리 기법)

  • Kang, Jihun;Gil, Joon-Min
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.9
    • /
    • pp.189-196
    • /
    • 2020
  • Recently, GPU cloud computing technology applying GPU(Graphics Processing Unit) devices to virtual machines is widely used in the cloud environment. In a cloud environment, GPU devices assigned to virtual machines can perform operations faster than CPUs through massively parallel processing, which can provide many benefits when operating high-performance computing services in a variety of fields in a cloud environment. In a cloud environment, a GPU device can help improve the performance of a virtual machine, but the virtual machine scheduler, which is based on the CPU usage time of a virtual machine, does not take into account GPU device usage time, affecting the performance of other virtual machines. In this paper, we test and analyze the performance degradation of other virtual machines due to the virtual machine that performs GPGPU(General-Purpose computing on Graphics Processing Units) task in the direct path based GPU virtualization environment, which is often used when assigning GPUs to virtual machines in cloud environments. Then to solve this problem, we propose a GPGPU task management method for a virtual machine.