• 제목/요약/키워드: Workload imbalance

검색결과 13건 처리시간 0.023초

설비 작업부하가 불균형한 Job Shop에서 할당규칙의 순위 (Ranking Dispatching Rules in the Job Shop with Unbalanced Machine Workloads)

  • 배상윤
    • 산업경영시스템학회지
    • /
    • 제22권50호
    • /
    • pp.161-170
    • /
    • 1999
  • This paper evaluates forty different dispatching rules with respect to twenty different performance measures of job shop scheduling under seven levels of workload imbalance. Computer simulation is used as a tool to determine rankings of the dispatching rules for a given workload imbalance. The experiments results show rankings of dispatching rules are different in the job shop with unbalanced machine workloads. As variations of workload imbalance increase from 7% to 78%, the performance of dispatching rules is gradually deteriorated in measure related to completion time and due date. These results guide scheduling practitioners not only to choosing dispatching rules but also to developing the model of facility investment for workload balance, when there are different levels of workload imbalance.

  • PDF

Hierarchical Evaluation of Flexibility in Production Systems

  • Tsuboner, Hitoshi;Ichimura, Tomotaka;Horikawa, Mitsuyoshi;Sugawara, Mitsumasa
    • Industrial Engineering and Management Systems
    • /
    • 제3권1호
    • /
    • pp.52-58
    • /
    • 2004
  • This report examines the issue of designing an efficient production system by increasing several types of flexibility. Increasing manufacturing flexibility is a key strategy for efficiently improving market responsiveness in the face of uncertain market demand for final products. The manufacturing system comprises multiple plants, of which individual plants have multiple manufacturing lines that are designed to produce limited types of products in accordance with their size and materials. Imbalance in the workload occurs among plants as well as among manufacturing lines because of fluctuations in market demand for final products. Thereby, idleness of some manufacturing lines and longer lead times in some manufacturing lines occur as a result of the high workload. We clarify how these types of flexibility affect manufacturing performance by improving only one type of flexibility or by improving multiple types of flexibility simultaneously. The average lead time and the imbalance in workload are adopted as measures of manufacturing performance. Three types of manufacturing flexibility are interrelated: machine flexibility, routing flexibility, and process flexibility. Machine flexibility refers to the various types of operations that a machine can perform without requiring the prohibitive effort of switching from one order to another. Routing flexibility is the capability of processing a given set of part types using more than one line (alternative line) in the plant. Process flexibility results from being able to build different types of final products at the same plant.

A Load-Balancing Approach Using an Improved Simulated Annealing Algorithm

  • Hanine, Mohamed;Benlahmar, El-Habib
    • Journal of Information Processing Systems
    • /
    • 제16권1호
    • /
    • pp.132-144
    • /
    • 2020
  • Cloud computing is an emerging technology based on the concept of enabling data access from anywhere, at any time, from any platform. The exponential growth of cloud users has resulted in the emergence of multiple issues, such as the workload imbalance between the virtual machines (VMs) of data centers in a cloud environment greatly impacting its overall performance. Our axis of research is the load balancing of a data center's VMs. It aims at reducing the degree of a load's imbalance between those VMs so that a better resource utilization will be provided, thus ensuring a greater quality of service. Our article focuses on two phases to balance the workload between the VMs. The first step will be the determination of the threshold of each VM before it can be considered overloaded. The second step will be a task allocation to the VMs by relying on an improved and faster version of the meta-heuristic "simulated annealing (SA)". We mainly focused on the acceptance probability of the SA, as, by modifying the content of the acceptance probability, we could ensure that the SA was able to offer a smart task distribution between the VMs in fewer loops than a classical usage of the SA.

코딩 유닛 깊이 정보를 이용한 HEVC 디블록킹 필터의 병렬화 기법 (Parallel Method for HEVC Deblocking Filter based on Coding Unit Depth Information)

  • 조현호;유은경;남정학;심동규;김두현;송준호
    • 방송공학회논문지
    • /
    • 제17권5호
    • /
    • pp.742-755
    • /
    • 2012
  • 본 논문에서는 high efficiency video coding (HEVC) 복호화기의 디블록킹 필터를 병렬화할 때 발생하는 작업량 불균형 문제를 해결하는 병렬화 방법을 제안한다. HEVC의 디블록킹 필터는 인-루프 필터로써 먼저 수직 에지에서 필터링을 수행한 후, 수평 에지에서 필터링을 수행한다. 수직 및 수평 에지에 대해 필터링을 수행하는 경우 주변 에지와 의존성이 없기 때문에 데이터 레벨의 병렬화를 통하여 복호화를 고속화 할 수 있다. 그러나 데이터 레벨 병렬화 방법을 통해 데이터가 균등하게 분할된 경우에도 영역 간의 작업량은 불균등 할 수 있으며, 이는 복호화기의 병렬화 성능을 저하시킨다. 본 논문에서는 coding tree block (CTB)에서 coding unit (CU)의 깊이 정보를 사용하여, 현재 프레임에 대한 디블록킹 필터링 과정의 연산량을 예측하고, 이를 통해 각 코어에 동등한 작업량이 분배되게 함으로써 작업량 불균형 문제를 해결하였다. 실험 결과, 제안하는 작업량 예측 기반의 데이터 레벨 병렬화 방법은 단일 코어를 사용하여 디블록킹 필터를 수행하는 것에 비하여 64.3%의 평균 시간 감소 (average time saving; ATS)를 얻었고, 기존의 균등 분할 데이터 레벨 병렬화 방법보다 평균 6.7%, 최대 13.5% 감소를 얻었다.

대체가공경로와 가공순서를 고려한 부품-기계 군집 알고리듬 (A Part-Machine Grouping Algorithm Considering Alternative Part Routings and Operation Sequences)

  • 백준걸;백종관;김창욱
    • 대한산업공학회지
    • /
    • 제29권3호
    • /
    • pp.213-221
    • /
    • 2003
  • In this paper, we consider a multi-objective part-machine grouping problem, in which part types have several alternative part routings and each part routing has a machining sequence. This problem is characterized as optimally determining part type sets and its corresponding machine cells such that the sum of inter-cell part movements and the sum of machine workload imbalances are simultaneously minimized. Due to the complexity of the problem, a two-stage heuristic algorithm is proposed, and experiments are shown to verify the effectiveness of the algorithm.

신규간호사 '태움(Taeoom)'에 대한 개념 분석 (A Concept Analysis of 'Taeoom' to Newly Employed Nurses)

  • 김지원;배성윤
    • 한국병원경영학회지
    • /
    • 제25권3호
    • /
    • pp.1-13
    • /
    • 2020
  • Purpose: This study was conducted to identify the conceptual definition and attributes of 'Taeoom' (or workplace bullying) inflicted to newly employed nurses in Korea. Method: Walker & Avant(2011)'s eight-stage process was used to perform a conceptual analysis of 'Taeoom'. Literature review of 40 studies published between Jan. 2009 and March 2018 published in Korea was followed by the in-depth interview with nine newly employed hospital nurses and the ex-post review of results by nursing experts. Findings: 'Taeoom' was associated with five attributes: (1) bullying for no reason, (2) peer rejection for no reason, (3) decreased physical function and psychological withdrawal, and (4) verbal abuse, defamation and nagging, (5) impotent feeling due to power imbalance. Four antecedents found in this study include offensive action, distrust, power imbalance, and undue workload exceeding capacity. As consequences of Taeoom, negative physical and psychological symptoms and turnover intention were increased while nursing performance was decreased. Conclusion: This study suggests the need for more qualitative researches with more comprehensive approach on Taeoom and the development of effective program to improve the organizational culture in nursing field. This study is significant in that it provides a qualitative but comparative review on the attributes, antecedents and consequences of Taeoom through literature review accompanied by focus group interview and expert review.

대단위 부품-기계 군집 문제를 위한 Look-ahead 휴리스틱 알고리듬 (A Look-ahead Heuristic Algorithm for Large-scale Part-Machine Grouping Problems)

  • 백종관;백준걸;김창욱
    • 한국경영과학회지
    • /
    • 제30권3호
    • /
    • pp.41-54
    • /
    • 2005
  • In this paper, we consider a multi-objective machine cell formation problem. This problem Is characterized as determining part route families and machine cells such that total sum of inter-ceil part movements and maximum machine workload imbalance are simultaneously minimized. Together with the objective function, alternative part routes and the machine sequences of part routes are considered In grouping Part route families. Due to the complexity of the problem, a two-phase heuristic algorithm is proposed. And we developed an n-stage look-ahead heuristic algorithm that generalizes the roll-out algorithm. Computational experiments were conducted to verify the performance of the algorithm.

Honey Bee Based Load Balancing in Cloud Computing

  • Hashem, Walaa;Nashaat, Heba;Rizk, Rawya
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권12호
    • /
    • pp.5694-5711
    • /
    • 2017
  • The technology of cloud computing is growing very quickly, thus it is required to manage the process of resource allocation. In this paper, load balancing algorithm based on honey bee behavior (LBA_HB) is proposed. Its main goal is distribute workload of multiple network links in the way that avoid underutilization and over utilization of the resources. This can be achieved by allocating the incoming task to a virtual machine (VM) which meets two conditions; number of tasks currently processing by this VM is less than number of tasks currently processing by other VMs and the deviation of this VM processing time from average processing time of all VMs is less than a threshold value. The proposed algorithm is compared with different scheduling algorithms; honey bee, ant colony, modified throttled and round robin algorithms. The results of experiments show the efficiency of the proposed algorithm in terms of execution time, response time, makespan, standard deviation of load, and degree of imbalance.

복잡도 기반 적응적 샘플 오프셋 병렬화 (Complexity-based Sample Adaptive Offset Parallelism)

  • 유은경;조현호;서정한;심동규;김두현;송준호
    • 방송공학회논문지
    • /
    • 제17권3호
    • /
    • pp.503-518
    • /
    • 2012
  • 본 논문은 High Efficiency Video Coding (HEVC)의 인-루프 필터 기술인 Sample Adaptive Offset (SAO)에 대하여 복잡도 분석기반의 병렬화 방법을 제안한다. HEVC의 SAO는 쿼드트리 기반으로 영상을 다수의 SAO영역으로 분할하고, 각 영역 단위로 에러 보정을 위한 오프셋 값을 전송함으로써 복호화된 화소의 에러를 보정한다. HEVC의 SAO는 데이터 레벨의 병렬화를 통하여 고속화할 수 있는데, SAO영역 단위의 데이터 레벨 병렬화는 영역의 크기가 일정하지 않아 멀티 코어를 사용한 병렬화시 작업량 불균형(Workload imbalance)이 발생한다. 또한, SAO는 영역 단위로 필터링 적용 여부가 결정되므로 균둥하게 SAO영역을 각 코어에 할당하더라도, 작업량 불균형이 발생할 수 있다. 본 논문에서는 SAO영역의 최소 단위인 Largest Coding Unit (LCU)를 SAO 수행의 기본단위로 하여, 각 단위에서의 SAO 파라미터 정보를 이용하여 복잡도를 미리 예측 하였다. 예측된 복잡도를 기반으로 각 코어에 균일하게 작업량이 할당될 수 있도록 영역을 코어에 적응적으로 할당하여 병렬화를 수행한 결과 순차 수행 기반 SAO에 비하여 2.38배, 영역 균등 SAO 병렬화 대비 21% 속도 향상되었다.

그리드 데이터베이스에서 질의 처리를 위한 캐쉬 관리 기반의 부하분산 기법 (Load Balancing Method for Query Processing Based on Cache Management in the Grid Database)

  • 신숭선;백성하;어상훈;이동욱;김경배;정원일;배해영
    • 한국멀티미디어학회논문지
    • /
    • 제11권7호
    • /
    • pp.914-927
    • /
    • 2008
  • 그리드 컴퓨팅 환경에서 대용량 데이터의 처리와 가용성 향상, 데이터 통합을 위해 그리드 데이터베이스 관리 시스템이 사용된다. 그리드 데이터베이스 관리 시스템은 효율저인 질의처리를 위해 여러 노드로 질의를 분산하여 처리한다. 하지만 질의 처리가 임의의 노드에 집중되어 처리 성능이 감소되고, 작업 부하의 불균형이 발생한다. 본 논문에서는 그리드 데이터베이스에서 질의 처리를 위한 캐쉬 관리 기반의 부하분산 기법을 제안한다. 제안 기법에서는 여러 노드에 있는 캐쉬들을 관리하기 위해 캐쉬 관리자를 사용하며, 캐쉬 관리자는 노드를 지역별 그룹으로 연결하고 자신의 그룹 안에 있는 노드의 캐싱된 메타 정보를 관리한다. 노드는 캐쉬 관리자를 통해 질의를 전달 할 최적의 메타 정보를 캐싱한다. 노드에서 캐싱된 메타 정보를 통해 질의를 전달하여 노드의 부하를 분산한다. 제안 기법은 캐쉬 기반으로 부하가 적은 노드에서 질의를 처리하여 노드들의 부하를 분산하여 질의 처리시에 향상된 성능을 보인다.

  • PDF