• Title/Summary/Keyword: queueing system

Search Result 438, Processing Time 0.023 seconds

The Design and Implementation of GSA(Grid System Account) for an Effective Analyzation of Enterprise Grid Computing system (Enterprise Grid Computing 시스템의 효율적 분석을 위한 GSA 시스템의 설계와 구현)

  • Chung, Moon-Ki
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2007.05a
    • /
    • pp.540-543
    • /
    • 2007
  • 최근의 그리드 컴퓨팅 시스템 환경은 단일 환경에서 작게는 2~4CPU, 많게는 수백 CPU 이상의 시스템으로 구축되고 있고, 더욱이 지역적으로도 멀리 떨어져 있다. 따라서 이를 운용하는 기업에서는 시스템의 사용 현황을 신속하게 분석할 필요가 있다. 그러나 이렇게 혼재된 이 기종 및 컴퓨팅 환경하에서의 각 지역별 시스템 사용현황을 효과적으로 분석 한다는 것은 매우 어려운 일이다. 기존에 사용되어 온 그리드 컴퓨팅 시스템 환경에서의 사용율 관리 방법들은 Queueing 시스템이 가지고 있는 Accounting 분석 명령어로 text 형태의 Accounting raw data 의 결과를 추출하여 가공 처리하므로 데이터 증가 시 반응 속도가 현격하게 느려지는 상황이 발생한다. 또한 원격지 그리드 컴퓨팅 시스템 군의 사용율 분석은 데이터 분석 시 매번 원격지접근 절차를 사용하여 그리드 컴퓨팅 시스템 군에 접근한 후 해당 로컬 시스템 분석을 해야 하고 각 원격지시스템군별로 추출 된 데이터를 통합 관리해야 하는 문제점을 가지고 있다. 따라서 이러한 문제점을 해결하고자 하는 것이 본 논문에서 제안하는 3-tier 구조의 GSA(Grid System Account)이다. 제안한 GSA 는 각 원격지 별 데이터를 객체화하여 Database 에 저장 함으로써 데이터 분석 시 효과적으로 처리할 수 있으며, 다수의 원격지 그리드 컴퓨팅 시스템 군에 대한 복합적인 분석이 필요할 때 효율적으로 대처할 수 있다. 본 논문에서는 GSA 의 설계방법을 제안하고 구현하여 실 성능을 시험함으로써 보다 효율적인 그리드 컴퓨팅 시스템의 사용율 분석 관리가 가능함을 보였다.포는 감수성을 보이지 않았다. 따라서 위의 결과로부터 SLT-I에 감수성을 보이지 않은 Raw264.7세포를 대상으로 Gb3 발현 정도와 SLT-I의 세포독성의 관계를 규명하고자 Gb3의 발현을 증가시킨 후 SLT-I의 세포독성을 재차 평가하였다. 이 결과 $TNF-{\alpha}$의 처리에 의하여 6 hrs에 Gb3의 발현이 정점(43.5%)에 이르렀으며 36 hrs에 정상 수준(25.0%)으로 환원되었다. 그러나, Gb3의 발현이 증가함에도 불구하고 SLT-I의 세포독성에는 변화가 관찰되지 않았다. 따라서, SLT-I에 의한 세포독성은 세포의 종류에 따라서 다르며 또한, Gb3의 발현정도에만 의존적이지는 않을 것으로 생각된다. 이와 같은 결과는 E. coli 0157의 감염증 병인 연구에 있어 SLT-I과 Gb3의 발현의 상관관계에 대한 보다 심도 있는 연구가 필요함을 시사한다.만 분할률, 배반포 형성률 및 배반포의 세포수를 증가시키는 것으로 사료된다.수의 유출입 지점에 온도센서를 부착하여 냉각수의 온도를 측정하고 냉각수의 공급량과 대기의 온도 등을 측정하여 대사열의 발생을 추정할 수 있었다. 동시에 이를 이용하여 유가배양시 기질을 공급하는 공정변수로 사용하였다 [8]. 생물학적인 폐수처리장치인 활성 슬러지법에서 미생물의 활성을 측정하는 방법은 아직 그다지 개발되어있지 않다. 본 연구에서는 슬러지의 주 구성원이 미생물인 점에 착안하여 침전시 슬러지층과 상등액의 온도차를 측정하여 대사열량의 발생량을 측정하고 슬러지의 활성을 측정할 수 있는 방법을 개발하였다.enin과 Rhaponticin의 작용(作用)에 의(依)한 것이며, 이

  • PDF

Performance Analysis of Handoff Channel Assignment Scheme in CDMA Cellular System (CDMA 셀룰러시스템에서의 핸드오프 채널할당기법 성능분석)

  • Lee, Dong-Myung;Lee, Chul-Hee
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.6
    • /
    • pp.17-29
    • /
    • 1999
  • In this paper, the prioritized queueing handoff scheme in CDMA (Code Division Multiple Access) cellular system is proposed. Also, the analytical survey for the proposed scheme is carried out, and the performance of this scheme is compared with that of non prioritized scheme and FIFO (First In First Out) queue scheme by computer simulation. The handoff region is defined as the time between the handoff treshold and the receiver threshold, and it is used for the maximum queue waiting time in the proposed scheme. The handoff and the receiver thresholds are defined as rewpectively: 1) the time that the Pilot Strength Measurement Message in the neighbor in the neighbor cell is received to the BS (Base Station) under the T_ADD threshold; and 2) the time that the T_DROP timer is expired and the Pilot Strength Measurement Message in the current cell is received to the BS under the T_DROP threshold. The performance metrics for analyzing the proposed scheme are : 1) probability of forced termination; 2) probability of call blocking; 3) ratio of carried traffic to total offered load; 4) average queue size; 5) average handoff delay time in queue. The simulation results show that the proposed scheme maintains high performance for handoff requests at a small penalty in total system capacity.

  • PDF

An Analysis on the Optimal Level of the Maintenance Float Using Absorbing Markov Chain (흡수 마코프 체인을 활용한 적정 M/F 재고 수준에 관한 연구)

  • Kim, Yong;Yoon, Bong-Kyoo
    • Journal of the military operations research society of Korea
    • /
    • v.34 no.2
    • /
    • pp.163-174
    • /
    • 2008
  • The military is an organization where reliability and availability take much more importance than in any other organization. And, in line with a recent trend of putting emphasis on 'system readiness', not only functions but also availability of a weapon system has become one of achievement targets. In this regard, the military keeps spares for important facility and equipment, which is called as Maintenance Float (M/F), in order to enhance reliability and availability in case of an unforeseen event. The military has calculated yearly M/F requirements based on the number of equipment and utilization rate. However, this method of calculation has failed to meet the intended targets of reliability and availability due to lack of consideration on the characteristics of equipment malfunctions and maintenance unit's capability. In this research, we present an analysis model that can be used to determine an optimal M/F inventory level based on queuing and absorbed Markov chain theories. And, we applied the new analysis model to come out with an optimal volume of K-1 tank M/F for the OO division, which serves as counterattack military unit. In our view, this research is valuable because, while using more tractable methodology compared to previous research, we present a new analysis model that can describe decision making process on M/F level more satisfactorily.

A Study on Reactive Congestion Control with Loss Priorities in ATM Network (ATM 네트워크에서 우선권을 갖는 반응 혼잡 제어에 관한 연구)

  • Park, Dong-Jun;Kim, Hyeong-Ji
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.4
    • /
    • pp.697-708
    • /
    • 1996
  • In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.

  • PDF

Software Architecture of IEEE1394 Based Home Network for Guaranteeing Real-Time Characteristics of Isochronous Service and Event (IEEE1394 기반의 홈 네트웍에서 이벤트와 등시성 서비스의 실시간성 보장을 위한 소프트웨어 구조)

  • Park, Dong-Hwan;O, Bong-Jin;Gang, Sun-Ju
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.181-190
    • /
    • 2002
  • IEEE1394 is a de facto standard for the home network interfaces of digital multimedia home devices including digital A/V systems, digital camcorders, and PCs. Recently, it has been used in applications to guarantee the real-time characteristics such as home automation system and IICP (Instrument and Industrial Control Protocol). In order to guarantee real-time requirements in these IEEE1394-based real-time applications, this thesis proposes the software architecture of an IEEE1394 based home network that supports the guarantee for service's react-time characteristics. The proposed architecture has a real-time IEEE1394 device driver and event service architecture for guarantee real-time characteristics. The real-time device driver supports priority-based queueing of packets and mechanism to reduce the interrupt latency time in ISR. The event service architecture supports a real-time events delivery based on home network service using real-time event channel. This architecture can accommodate the real-time requirements of various applications and services such as digital multimedia services with QoS guarantees. home automation system required real-tine characteristics.

Assessment of Bicycle Left-turn Traffic Control Strategies at Signalized Intersections (신호교차로의 자전거 좌회전 운영방안 평가에 관한 연구)

  • Lee, Chung Min;Lee, Sang Soo;Cho, Hanseon;Nam, Doohee
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.6
    • /
    • pp.579-588
    • /
    • 2014
  • In this study, three signal control strategies such as Bike box, Hook-turn, and 6-phase were assessed for various traffic conditions at signalized intersections incorporating bicycle left-turn traffic. Results showed that the size of a waiting zone mainly affected the performance of signal control in both Bike box and Hook-turn. Both Bike box and Hook-turn yielded an identical vehicle delay, but Bike box produced less bicycle delay than Hook-turn by 2.5~29.9 sec/veh for undersaturated traffic conditions. For saturated traffic condition, Bike box produced less vehicle delay than Hook-turn and 6-phase strategies, but bicycle delay was found to increase at the 700 vph of bicycle traffic compared to 6-phase. Bicycle delay was greatly increased under Hook-turn and Bike box strategies when bicycle traffic was greater than 300 vph and 500 vph, respectively. It was also shown that bicycle delay could be significantly reduced by providing appropriate size of queueing space. In addition, Bike box was likely to yield less vehicle and bicycle delay than Hook-turn for traffic volume patterns investigated in this study.

Scheduling Algorithms and Queueing Response Time Analysis of the UNIX Operating System (UNIX 운영체제에서의 스케줄링 법칙과 큐잉응답 시간 분석)

  • Im, Jong-Seol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.1 no.3
    • /
    • pp.367-379
    • /
    • 1994
  • This paper describes scheduling algorithms of the UNIX operating system and shows an analytical approach to approximate the average conditional response time for a process in the UNIX operating system. The average conditional response time is the average time between the submittal of a process requiring a certain amount of the CPU time and the completion of the process. The process scheduling algorithms in thr UNIX system are based on the priority service disciplines. That is, the behavior of a process is governed by the UNIX process schuduling algorithms that (ⅰ) the time-shared computer usage is obtained by allotting each request a quantum until it completes its required CPU time, (ⅱ) the nonpreemptive switching in system mode and the preemptive switching in user mode are applied to determine the quantum, (ⅲ) the first-come-first-serve discipline is applied within the same priority level, and (ⅳ) after completing an allotted quantum the process is placed at the end of either the runnable queue corresponding to its priority or the disk queue where it sleeps. These process scheduling algorithms create the round-robin effect in user mode. Using the round-robin effect and the preemptive switching, we approximate a process delay in user mode. Using the nonpreemptive switching, we approximate a process delay in system mode. We also consider a process delay due to the disk input and output operations. The average conditional response time is then obtained by approximating the total process delay. The results show an excellent response time for the processes requiring system time at the expense of the processes requiring user time.

  • PDF

A study on decision number of maintenance equipment with calibration for weapon system with Queueing Theory (검교정이 필요한 무기체계 정비장비의 구매 대수 결정을 위한 대기행렬이론 연구)

  • PARK, JUNGHO;LEE, IKDO;PARK, YEONKYOUNG;Kim, Du-Jeong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.10
    • /
    • pp.153-162
    • /
    • 2017
  • Weapon systems have been developed with high technology electronic equipment due to technology growth. In addition, the capital, operational and maintenance costs of weapon systems have all increased. However, cost of operation and maintenance for weapon systems has been decreased relatively compared to the increased capital cost of weapon systems. Therefore, the defense industry needs to research the life cycle cost of weapon systems that have high operational and maintenance costs. This paper focuses on maintenance equipment for the operation and maintenance of weapon systems. Recently, it seems that the weapon systems that have periodic calibration with maintenance equipment are valid. The equipment requires periodic calibration by the manufacturer to check its own validation. Basically, customers demand high reliability devices from foreign companies that have qualified in the global market. Therefore, the tools need to be calibrated overseas. In other words, weapon systems are not available when the equipment has to be calibrated overseas because the systems require validation with valid maintenance equipment. A purpose of this paper is to compare the loss costs that arise from the calibration of the equipment overseas and the purchasing cost of the tools. Finally, the research shows the number of equipment that customers need to minimize the cost. This research will help to improve the efficiency of operation of weapon systems and solve the problems associated with the need for maintenance overseas.