• 제목/요약/키워드: two-level priority

검색결과 174건 처리시간 0.024초

ATM망에서 두 개의 임계값을 갖는 PBS 기법에 관한 연구 (A Study on PBS Mechanism with Two-Threshold in ATM Networks)

  • 정현숙;신효영;박호균;류황빈
    • 한국통신학회논문지
    • /
    • 제19권1호
    • /
    • pp.56-65
    • /
    • 1994
  • ATM 망에서는 과밀 현상을 제어하는 방식으로서 셀 헤더내의 CLP 비트를 사용하여 다양한 트래픽에 두단계의 우선 순위를 부여하는 우선 순위 제어 방식이 수해되고 있다. 본 논문에서는 ATM 셀 헤더의 CLP 비트와 Res. 비트를 합한 2비트를 이용하여 세단계의 우선 순위를 제공하기 위한 2개의 임계값을 갖는 PBS(partial buffer sharing) 기법을 제안한다. 제안된 기법을 성능 분석한 결과 두단계 우선 순위를 갖는 기존의 기법들에 비해 다양한 서비스 품질에 관한 요구사항을 충족시키는 데 보다 나은 유연성을 제공함을 확인하였다.

  • PDF

ATM 네트워크에서 사용자 레벨 우선 순위를 고려한 셀 마킹 및 우선 순위 제어 (Cell Marking Priority Control Considering User Level Priority in ATM Network)

  • 오창세;김태윤
    • 한국정보처리학회논문지
    • /
    • 제1권4호
    • /
    • pp.490-501
    • /
    • 1994
  • 본 연구에서는 ATM 네트워크 트래픽 제어에서 사용되는 셀 마킹 기법의 문제점을 제시하고 사용자 레벨의 우선순위를 고려한 확장된 셀 마킹 기법을 제안하였다. 기존 의 트래픽 모니터링 기법에서는 셀의 트래픽 규약 위반 사항만을 가지고 셀의 CLP 비트를 1로 마킹하였다. 이렇게 함으로써 낮은 순위의 셀이 늘어나고, 사용자 레벨의 우선 순위와는 상관없이 셀의 등급이 낮아지게 되었다. 본 연구에서는 FCI 비트와 CLP 비트를 결합하여 3 레벨의 우선 순위 방식을 제안한다. CLP=0인 셀의 레벨을 2 단 계로 구분하였다. 결과적으로 제안한 기법이 기존의 방법보다 높은 순위 셀을 더 많이 보존할 수 있었으며 높은 순위의 셀 손실도 줄일 수 있었다. 또한 제안한 3 레벨에 대 해 두개의 임계차를 갖는 부분 버퍼 공유 기법(PBS : partial buffer sharing)으로 성 능을 분석하였다. 분석 결과 두개의 임계치를 갖는 PBS가 우선 순위없는 기법이나 한 개의 임계치를 가진 PBS 보다 더 효율적인 제어가 가능하였다.

  • PDF

A Two-Step Job Scheduling Algorithm Based on Priority for Cloud Computing

  • Kim, Jeongwon
    • Journal of information and communication convergence engineering
    • /
    • 제11권4호
    • /
    • pp.235-240
    • /
    • 2013
  • Cloud systems are popular computing environment because they can provide easy access to computing resources for users as well as efficient use of resources for companies. The resources of cloud computing are heterogeneous and jobs have various characteristics. One such issue is effective job scheduling. Scheduling in the cloud system may be defined as a multiple criteria decision model. To address this issue, this paper proposes a priority-based two-step job scheduling algorithm. On the first level, jobs are classified based on preference. Resources are dedicated to a job if a deadline failure would cause severe results or critical business losses. In case of only minor discomfort or slight functional impairment, the job is scheduled using a best effort approach. On the second level, jobs are allocated to adequate resources through their priorities that are calculated by the analytic hierarchic process model. We then analyze the proposed algorithm and make a scheduling example to confirm its efficiency.

TLSA: A Two Level Scheduling Algorithm for Multiple packets Arrival in TSCH Networks

  • Asuti, Manjunath G.;Basarkod, Prabhugoud I.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권8호
    • /
    • pp.3201-3223
    • /
    • 2020
  • Wireless communication has become the promising technology in the recent times because of its applications in Internet of Things( IoT) devices. The IEEE 802.15.4e has become the key technology for IoT devices which utilizes the Time-Slotted Channel Hopping (TSCH) networks for the communication between the devices. In this paper, we develop a Two Level Scheduling Algorithm (TLSA) for scheduling multiple packets with different arrival rate at the source nodes in a TSCH networks based on the link activated by a centralized scheduler. TLSA is developed by considering three types of links in a network such as link i with packets arrival type 1, link j with packets arrival type 2, link k with packets arrival type 3. For the data packets arrival, two stages in a network is considered.At the first stage, the packets are considered to be of higher priority.At the second stage, the packets are considered to be of lower priority.We introduce level 1 schedule for the packets at stage 1 and level 2 schedule for the packets at stage 2 respectively. Finally, the TLSA is validated with the two different energy functions i.e., y = eax - 1 and y = 0.5x2 using MATLAB 2017a software for the computation of average and worst ratios of the two levels.

서울 대기 중 미세 먼지 노출로 인한 위해도에 근거한 우선 관리 지역 선정 -이론적 사망 위해도 및 손실비용을 근거로- (Selection of Priority Areas Based on Human and Economic Risk from Exposure to Fine Particles in Seoul)

  • 김예신;이용진;신동천
    • Environmental Analysis Health and Toxicology
    • /
    • 제19권1호
    • /
    • pp.49-58
    • /
    • 2004
  • It is important to select a risk based priority area for environmental policy formation and decision-making. We estimated the health risks and associated damage costs from exposure to fine particles and assigned priority areas for twenty -five districts in Seoul. In order to estimate the theoretical mortality incidence of the health risk, baseline risks were estimated from mortality rates in two low level areas of fine particles, Seocho Gu and Cheju city To estimate the damage cost from the risk estimates, we investigated and estimated the willingness to pay (WTP) for specific risk reduction. We assumed two different locations as the reference area, Cheju city as Scenario I and Seocho gu as Scenario II. From the results, the five districts, Kwangjin, Chungnang, Kangbuk, Nowon, and Kangnam, ranked high in the categories of both health risk and economic risk. Damage costs were over twenty billion won in each of these districts. As there are uncertainties in these results, the parameter values such as PM$_{2.5}$ level, dose -response slope factor, baseline risk, exposure population and WTP should be continuously validated and refined.d.

파운데이션 필드버스에서 두 개의 우선순위 데이터를 갖는 노드의 데이터 전송지연시간에 관한 연구 (Study on the Transmission Delay of Two Priority Classes in One Node in the Foundation Fieldbus)

  • 이용희;홍승호
    • 전기학회논문지
    • /
    • 제58권2호
    • /
    • pp.407-414
    • /
    • 2009
  • The foundation fieldbus(FF) is one of the fieldbuses most widely used for process control and automation, In order for system designer to optimize medium management, it is imperative to predict transmission delay time of data. In a former research, mathematical modeling to analyze transmission delay of FF token-passing system has been developed based on the assumption that a device node has only one priority data(1Q model), From 1Q model, all of the device nodes, which are connected on the FF system, are defined priority level in advance, and as system operates, data are generated based on given priority level. However, in practice, some non-periodic data can have different priority levels from one device. Therefore, new mathematical model is necessary for the case where different priority levels of data are created under one device node(2Q model). In this research, the mathematical model for 2Q model is developed using the equivalent queue model. Furthermore, the characteristics of transmission delay of 2Q model which is presented in this paper were compared with 1Q model. The validity of the analytical model was verified by using a simulation experiment.

진화알고리즘을 이용한 선취적 다목표 양면조립라인 밸런싱 (Two-Sided Assembly Line Balancing with Preemptive Multiple Goals Using an Evolutionary Algorithm)

  • 송원섭;김여근
    • 한국경영과학회지
    • /
    • 제34권2호
    • /
    • pp.101-111
    • /
    • 2009
  • This paper considers two-sided assembly line balancing with preemptive multiple goals. In the problem, three goals are taken into account in the following priority order : minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. An evolutionary algorithm is used to solve the multiple goal problems. A new structure is presented in the algorithm, which is helpful to searching the solution satisfying the goals in the order of the priority. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational results show that the proposed algorithm is premising in the solution quality.

신속제조환경에서의 새로운 생산입력통제방식에 관한 연구 (A Study of New Production Input Control in an Agile Manufacturing Environment)

  • 김현수
    • 대한산업공학회지
    • /
    • 제23권4호
    • /
    • pp.699-708
    • /
    • 1997
  • Production control is usually composed of due-dote assignment, production input control, and priority dispatching rule. A production input control(PIC) is mainly to control the WIP level on the shop floor. On the other hand, a priority dispatching rule(PDR) is mainly to control the tardiness/earliness of on order and number of tardy jobs. Therefore, if we select a particular PIC which can control only a particular performance measure(i.e., tardiness), it may cause worsening other performance measure(i.e., WIP level, shopfloor time, etc.) This newly developed production input control, DRD(Dual Release-Dates), is mainly designed to control the WIP level on the shop floor by employing two different release-dates of an order(earliest release. date and latest release-date and the release condition (relationship between the current WIP level and the pre-defined maximum WIP level) while trying to meet the due-date of the order.

  • PDF

목표계획법을 위한 진화알고리즘: 양면조립라인 밸런싱 문제에 적용 (An Evolutionary Algorithm for Goal Programming: Application to two-sided Assembly Line Balancing Problems)

  • 송원섭;김여근
    • 한국경영과학회:학술대회논문집
    • /
    • 한국경영과학회 2008년도 추계학술대회 및 정기총회
    • /
    • pp.191-196
    • /
    • 2008
  • This paper presents an evolutionary algorithm for goal programming with preemptive priority. To do this, an evolutionary strategy is suggested which search for the solution satisfying the goals in the order of the priority. Two-sided assembly line balancing problems with multiple goals are used to validate the applicability of the algorithm. In the problems, three goals are considered in the following priority order: minimizing the number of mated-stations, achieving the goal level of workload smoothness, and maximizing the work relatedness. The proper evolutionary components such as encoding and decoding method, evaluation scheme, and genetic operators, which are specific to the problem being solved, are designed in order to improve the algorithm's performance. The computational result is reported.

  • PDF

ATM 스위치 네트워크에서의 2-레벨 임계치를 갖는 셀우선순위 제어방식 (Cell Priority Control with 2-Level Thresholds in ATM Switch Network)

  • 박원기;한치문;최형진
    • 한국통신학회논문지
    • /
    • 제19권3호
    • /
    • pp.479-491
    • /
    • 1994
  • 본 논문에서는 유한 크기의 출력 버퍼를 가진 ATM 스위치에서 셀 지연 요구와 셀 손실 요구를 고려한 2-레벨 임계치를 갖는 우선순위 제어 방식을 제안하였다. 본 논문에서 제안한 우선 순위 제어 방식은 유한크기를 가진 하나의 버퍼에서 두개의 임계치를 두어 손실에 민감한 셀에 대해서는 셀손실률을 개선하고, 지연에 민감한 셀에 대해서는 셀 지연 시간을 개선하는 방법이다. 본 방식에서는 우선순위 제어 방식을 이론적으로 구하고 수치해석을 통해 셀손실률과 평균셀지연을 구하였다. 셀의 서비스 품질 특성에 따라 두개의 임계치를 적절히 조절함으로써 셀손실률 또는 평균셀지연의 개설효과를 얻을 수 있음을 확실히 알 수 있다.

  • PDF