• 제목/요약/키워드: Share Allocation

검색결과 145건 처리시간 0.029초

TCP/IP 성능개선을 위한 ABR 서비스 제어 알고리즘: 시뮬레이션 평가 (ABR Service Control Algorithms For Improving Performance of TCP/IP: Simulation Evaluation)

  • 박희대;박승섭
    • 한국정보처리학회논문지
    • /
    • 제6권11S호
    • /
    • pp.3390-3398
    • /
    • 1999
  • To achieve high-speed communication and to improve QoS characteristics, ATM is now being used as underlying transfer mechanism of Internet protocols, or TCP/IP. When TCP uses the ABR service in ATM networks, the ABR service control is important to improve the performance of TCP/IP traffic as long as there is no interaction between ABR rate control and TCP flow control. In such environment, the interoperability of EFCI and ER switches becomes unavoidable in order to more effectively control ABR traffic in ATM network. In this paper, we use the model of mixed EFCI-ER environment and discuss the performance issues, e.g., the fairness of bandwidth allocation, drop rate, throughput by using various ER switch algorithms. Among various ERSwitch algorithms, we present one algorithm that have a less network topology and allocate the fair share of VC bandwidth by simulation results.

  • PDF

짧은 지연 시간 태스크를 지원하는 타이머 기반 크레딧 스케줄러 (Timer-based Credit Scheduler for Supporting Low Latency Task)

  • 김병기;고영웅
    • 대한임베디드공학회논문지
    • /
    • 제7권4호
    • /
    • pp.193-199
    • /
    • 2012
  • Virtualization allows multiple commodity operating systems to share on a single physical machine. Resource allocation among virtual machines is a key to determine virtual machine performance. To satisfy time-sensitive task on a domain, hypervisor needs to observe the resource requirements and allocates proper amount of CPU resources in a timely manner. In this paper, we propose a realtime credit scheduler for latency sensitive application on virtual machines. The key idea is to register a time event in the Xen hypervisor. Experiment result shows that the proposed scheme is superior to Credit scheduler.

An Efficient Scheduling Method for Grid Systems Based on a Hierarchical Stochastic Petri Net

  • Shojafar, Mohammad;Pooranian, Zahra;Abawajy, Jemal H.;Meybodi, Mohammad Reza
    • Journal of Computing Science and Engineering
    • /
    • 제7권1호
    • /
    • pp.44-52
    • /
    • 2013
  • This paper addresses the problem of resource scheduling in a grid computing environment. One of the main goals of grid computing is to share system resources among geographically dispersed users, and schedule resource requests in an efficient manner. Grid computing resources are distributed, heterogeneous, dynamic, and autonomous, which makes resource scheduling a complex problem. This paper proposes a new approach to resource scheduling in grid computing environments, the hierarchical stochastic Petri net (HSPN). The HSPN optimizes grid resource sharing, by categorizing resource requests in three layers, where each layer has special functions for receiving subtasks from, and delivering data to, the layer above or below. We compare the HSPN performance with the Min-min and Max-min resource scheduling algorithms. Our results show that the HSPN performs better than Max-min, but slightly underperforms Min-min.

도로부문의 적정 투자규모 추정 (Optimal Demand for Road Investment)

  • 김의준
    • 지역연구
    • /
    • 제13권2호
    • /
    • pp.75-92
    • /
    • 1997
  • This paper is concerned with an estimation of optimal investment of road sector in 1996-2005. The main method is a Computable General Equilibrium (CGE) Model for Korea in which the optimal solution is derived in a recursively dynamic path. The model is composed of three main modules: the supply, the demand and the price. In this paper, the investment demand for the road is optimized with subject to national economic growth and price inflation. If the annual inflation level and the economic growth rate during 1996-2005 are set to 4.5%-5.0% and 6.0%-6.5% respectively, the optimal demand for the road investment is estimated as 155.1-180.1 trillion Won or 3.33%-3.89% of the GDP for ten years. It implies that the additional increase of the road investment by 0.61%-1.15% of the GDP is required for sustainable economic development, since the share of the road investment in the GDP of the latest 5 years has stayed around 2.27%. However, it is necessary to reduce construction investments on housing as well as to promote private financing of the road in order to maximize an efficiency of resource allocation.

  • PDF

종단 호스트에서 QoS 보장을 위한 비례 분배 실시간 자원할당 기법 (Fair Real-Time Resource Allocation for End System's QoS Support)

  • 박정근;유민수;홍성수;박선희
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (A)
    • /
    • pp.148-150
    • /
    • 2003
  • 본 논문에서는 인터넷 종단 호스트에서 공유 자원의 대역폭 제약조건과 종료시한 제악조건 모두를 만족시킬 수 있는 자원 할당 구조를 제안한다. 제안된 구조는 두 단계로 구성된다. 상위 단계에서는 비례 분배 스케줄러(proportional share scheduler)인 EFT-C/D (Earliest Finish Time Credit/Debit) 스케줄러가 수행된다. 이 스케줄러는 CPU와 같은 시분할 공유 자원을 하위 단계 스케줄러들에게 지정된 비율로 분배하는 역할을 한다. 그리고 하위 단계에서는 서로 다른 시간 제약조건이 부여된 태스크들을 스케줄링 하기위해 다양한 실시간 스케줄러가 수행된다. 본 연구의 주요 성과는 두 가지로 요약된다. 첫째, 이상적인 GPS (Generalized Processor Sharing) 서버와 거의 동등한 수준으로 자원을 공평하게 분배하는 EFT-C/D 알고리즘을 개발하였다. 둘째, 하위 단계에서 수행되는 EDF 스케줄러에 대해 이용율(utilization)에 기반한 스케룰링 가능성 분석 방법을 개발하였다. 이 방법은 주어진 태스크 집합에 대해 단순히 이용율만을 계산하여 스케줄링 가능성을 판별할 수 있다. 따라서 새로운 태스크가 생성될 때 수락 여부를 시스템 수행 중에 제어할 수 있는 장점이 있다.

  • PDF

이종네트워크에서 펨토셀의 스펙트럼 공유할당 비용 최적화 알고리즘 (Spectrum Share Allocation Revenue Optimization Algorithm of Femtocell in the Heterogeneous Network)

  • 박상혁;맹세영;라지브;쿠마;원종호;바트;김경호;이연우
    • 한국정보처리학회:학술대회논문집
    • /
    • 한국정보처리학회 2013년도 추계학술발표대회
    • /
    • pp.268-270
    • /
    • 2013
  • 본 논문에서는 최근 주파수 자원에 대한 수요가 급증하면서 효율적으로 주파수를 이용하기 위해 주파수 공유를 하면서 생길 수 있는 비용문제의 최고의 이득을 발생시킬 수 있도록 하기 위하여 이종네크워크(Heterogeneous Network)에서 매크로셀과 펨토셀 환경에서 스펙트럼 공유에 있어서 매크로셀이 사용하지 않는 스펙트럼을 펨토셀에 공유해줌으로써 이득을 취할 수 있는데 이러한 이득에 있어서 최고의 이득을 발생시킬 수 있도록 하기 위하여 펨토셀의 스펙트럼 공유당 비용 최적화 알고리즘을 제안 하였다.

Q-Learning based Collision Avoidance for 802.11 Stations with Maximum Requirements

  • Chang Kyu Lee;Dong Hyun Lee;Junseok Kim;Xiaoying Lei;Seung Hyong Rhee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권3호
    • /
    • pp.1035-1048
    • /
    • 2023
  • The IEEE 802.11 WLAN adopts a random backoff algorithm for its collision avoidance mechanism, and it is well known that the contention-based algorithm may suffer from performance degradation especially in congested networks. In this paper, we design an efficient backoff algorithm that utilizes a reinforcement learning method to determine optimal values of backoffs. The mobile nodes share a common contention window (CW) in our scheme, and using a Q-learning algorithm, they can avoid collisions by finding and implicitly reserving their optimal time slot(s). In addition, we introduce Frame Size Control (FSC) algorithm to minimize the possible degradation of aggregate throughput when the number of nodes exceeds the CW size. Our simulation shows that the proposed backoff algorithm with FSC method outperforms the 802.11 protocol regardless of the traffic conditions, and an analytical modeling proves that our mechanism has a unique operating point that is fair and stable.

MECHANICAL DESIGN APPROACH FOR THE VIRTUAL MOCK-UP STUDY OF BUILDING ENVELOPE DESIGN AND FABRICATION

  • Minjung M.;Yongcheol L.
    • 국제학술발표논문집
    • /
    • The 5th International Conference on Construction Engineering and Project Management
    • /
    • pp.158-162
    • /
    • 2013
  • Building envelope systems with growing complexity in geometry and performance criteria demand adapted workflow processes toward the efficient integration of their design and fabrication. To facilitate integration of the workflow process, this study analyzes relationships among teams who share digital models and exchange information that help project participants identify areas of improvement in task allocation and exchanges among various actors, systems, and activities. In addition, major gaps identified in knowledge transfer, project tracking, and design integration during the performance evaluation stages, emphasize the need for a more comprehensive approach to integrating the design, the fabrication, and the construction parameters of building envelope systems. To evaluate the effectiveness of streamlining interactions of design parameters with fabrication constraints and constructability assessments, this paper examines a mechanical design approach as it applies to various project scenarios to develop a mechanical solution for streamlining building envelope design and construction workflow.

  • PDF

수술실의 원가배부기준 설정연구 (A Study on the cost allocation method of the operating room in the hospital)

  • 김희정;정기선;최성우
    • 한국병원경영학회지
    • /
    • 제8권1호
    • /
    • pp.135-164
    • /
    • 2003
  • The operating room is the major facility that costs the highest investment per unit area in a hospital. It requires commitment of hospital resources such as manpower, equipments and material. The quantity of these resources committed actually differs from one type of operation to another. Because of this, it is not an easy task to allocate the operating cost to individual clinical departments that share the operating room. A practical way to do so may be to collect and add the operating costs incurred by each clinical department and charge the net cost to the account of the corresponding clinical department. It has been customary to allocate the cost of the operating room to the account of each individual department on the basis of the ratio of the number of operations of the department or the total revenue by each operating room. In an attempt to set up more rational cost allocation method than the customary method, this study proposes a new cost allocation method that calls for itemizing the operation cost into its constituent expenses in detail and adding them up for the operating cost incurred by each individual department. For comparison of the new method with the conventional method, the operating room in the main building of hospital A near Seoul is chosen as a study object. It is selected because it is the biggest operating room in hospital A and most of operations in this hospital are conducted in this room. For this study the one-month operation record performed in January 2001 in this operating room is analyzed to allocate the per-month operation cost to six clinical departments that used this operating room; the departments of general surgery, orthopedic surgery, neuro-surgery, dental surgery, urology, and obstetrics & gynecology. In the new method(or method 1), each operation cost is categorized into three major expenses; personnel expense, material expense, and overhead expense and is allocated into the account of the clinical department that used the operating room. The method 1 shows that, among the total one-month operating cost of 814,054 thousand wons in this hospital, 163,714 thousand won is allocated to GS, 335,084 thousand won to as, 202,772 thousand won to NS, 42,265 thousand won to uno, 33,423 thousand won to OB/GY, and 36.796 thousand won to DS. The allocation of the operating cost to six departments by the new method is quite different from that by the conventional method. According to one conventional allocation method based on the ratio of the number of operations of a department to the total number of operations in the operating room(method 2 hereafter), 329,692 thousand won are allocated to GS, 262,125 thousand won to as, 87,104 thousand won to NS, 59,426 thousand won to URO, 51.285 thousand won to OB/GY, and 24,422 thousand won to DS. According to the other conventional allocation method based on the ratio of the revenue of a department(method 3 hereafter), 148,158 thousand won are allocated to GS, 272,708 thousand won to as, 268.638 thousand won to NS, 45,587 thousand won to uno, 51.285 thousand won to OB/GY, and 27.678 thousand won to DS. As can be noted from these results, the cost allocation to six departments by method 1 is strikingly different from those by method 2 and method 3. The operating cost allocated to GS by method 2 is about twice by method 1. Method 3 makes allocations of the operating cost to individual departments very similarly as method 1. However, there are still discrepancies between the two methods. In particular the cost allocations to OB/GY by the two methods have roughly 53.4% discrepancy. The conventional methods 2 and 3 fail to take into account properly the fact that the average time spent for the operation is different and dependent on the clinical department, whether or not to use expensive clinical material dictate the operating cost, and there is difference between the official operating cost and the actual operating cost. This is why the conventional methods turn out to be inappropriate as the operating cost allocation methods. In conclusion, the new method here may be laborious and cause a complexity in bookkeeping because it requires detailed bookkeeping of the operation cost by its constituent expenses and also by individual clinical department, treating each department as an independent accounting unit. But the method is worth adopting because it will allow the concerned hospital to estimate the operating cost as accurately as practicable. The cost data used in this study such as personnel expense, material cost, overhead cost may not be correct ones. Therefore, the operating cost estimated in the main text may not be the same as the actual cost. Also, the study is focused on the case of only hospital A, which is hardly claimed to represent the hospitals across the nation. In spite of these deficiencies, this study is noteworthy from the standpoint that it proposes a practical allocation method of the operating cost to each individual clinical department.

  • PDF

다중 셀 네트워크에서 다중 D2D 통신 자원할당 기법 (Resource Allocation Scheme for Multiple Device-to-Device Communications in a Multicell Network)

  • 김현민;강길모;신오순
    • 전자공학회논문지
    • /
    • 제53권9호
    • /
    • pp.18-25
    • /
    • 2016
  • 셀룰러 네트워크 환경에서 단말 간 직접통신(D2D : Device-to-Device)을 위해서는 기존의 셀룰러 링크의 성능을 보장함과 동시에 D2D 통신 링크의 성능을 극대화하는 것이 중요하다. 따라서 D2D 통신에 사용할 자원을 할당함에 있어 D2D 송신 단말이 셀룰러 시스템에 미치는 간섭과 셀룰러 시스템이 D2D 수신 단말에 주는 간섭을 동시에 고려해야 한다. 본 논문에서는 D2D 송신기와 수신기로 이루어진 D2D 링크가 셀룰러 시스템의 상향링크 자원을 공유하는 상황에서 복수의 D2D 링크에 효과적으로 자원을 할당하는 기법을 제안한다. 기지국은 인접 셀의 기지국과 정보 교환을 통해 셀 내의 단말들의 위치 정보를 공유한다는 가정 하에 단말들의 단말 위치 정보를 이용하여 D2D 링크와 셀룰러 링크 사이의 간섭을 최소화하는 자원을 할당한다. 아울러 경로손실 모델을 이용하여 계산한 셀룰러 링크 보호 상수 및 D2D 링크 보호 상수를 이용하여 셀룰러 링크와 D2D 링크 상호간의 간섭 및 D2D 링크 간의 간섭을 제한한다. 모의실험을 통해 제안한 자원할당 기법의 성능을 검증한다.