• Title/Summary/Keyword: Resource management scheme

Search Result 313, Processing Time 0.035 seconds

Policy Adjuster-driven Grid Workflow Management for Collaborative Heart Disease Identification System

  • Deng, Shengzhong;Youn, Chan-Hyun;Liu, Qi;Kim, Hoe-Young;Yu, Taoran;Kim, Young-Hun
    • Journal of Information Processing Systems
    • /
    • v.4 no.3
    • /
    • pp.103-112
    • /
    • 2008
  • This paper proposes a policy adjuster-driven Grid workflow management system for collaborative healthcare platform, which supports collaborative heart disease diagnosis applications. To select policies according to service level agreement of users and dynamic resource status, we devised a policy adjuster to handle workflow management polices and resource management policies using policy decision scheme. We implemented this new architecture with workflow management functions based on policy quorum based resource management system for providing poincare geometrycharacterized ECG analysis and virtual heart simulation service. To evaluate our proposed system, we executed a heart disease identification application in our system and compared the performance to that of the general workflow system and PQRM system under different types of SLA.

Design and Implementation of Kernel Resource Management Scheme (커널 자원 관리 기법 설계 및 구현)

  • Kim, Byung-Jin;Baek, Seung-Jae;Kim, Keun-Eun;Choi, Jong-Moo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.3
    • /
    • pp.181-190
    • /
    • 2009
  • Module is an object file that can be loaded into operating system dynamically and has complete privileged access to all resources in kernel. Therefore trivial misuses in a module may cause critical system halts or deadlock situations. In this paper, we propose Kernel Resource Protector(KRP) scheme to reduce the various problems caused by module. KRP provides protections of a variety of kernel resources such as memory, major number and work queue resource. We implement the scheme onto linux kernel 2.6.18, and experimental results show that our scheme can protect kernel resources effectively.

A Broker for Cloud Resource Management and Its Experimental Performance Analysis

  • Ren, Ye;Kim, Seonghwan;Kang, Dongki;Youn, Chan-Hyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.239-240
    • /
    • 2012
  • When users access to use the computing resources in the cloud, they expect specific quality of service (QoS) which should be guaranteed by the service provider. Meanwhile, the service provider should adopt proper schemes to enhance the resource utilization. In this thesis, we propose the MapChem-Broker which aims to satisfy users' QoS requirements as well as enhance the resource utilization by controlling the provision of VM resources in the cloud. On the experimental cloud testbed, we compare the proposed scheme with an existing one for VM resource provisioning. Results show that the proposed scheme outperforms the existing one.

Radio Resource Management of CoMP System in HetNet under Power and Backhaul Constraints

  • Yu, Jia;Wu, Shaohua;Lin, Xiaodong;Zhang, Qinyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3876-3895
    • /
    • 2014
  • Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

The Comparative Research on the Fisheries Resource Management Policy of Korea, China and Japan (한ㆍ중ㆍ일간 어업관리정책의 비교와 자원공동관리에 대한 검토)

  • 옥영수;최성애
    • The Journal of Fisheries Business Administration
    • /
    • v.29 no.1
    • /
    • pp.65-88
    • /
    • 1998
  • The sustainable reduction of the fisheries resource is keenly raised an urgent problem of the fisheries policy in Korea, China and Japan. Then, 3 country, Korea, Japan, China, have established various system for fisheries resource management. Among these systems, qualitative fishing regulations have been commonly established. For example, its have been enforced to the prohibited fishing region, fishing period, fish size, net size, specified fishing methods. Also, different fisheries resource management policies have occasionally enforced by each country. For example, the prohibition of free sale and free possession has been established in Korea and Japan, but not China. And, In Korea, It has been enforced uniquely to entry system far fishing license number ana sea farming project for coastal fishing grounds by national government. The entry system for fishing license number has been enforced in Japan too, not national government, but local government. Nevertheless these three countries have put good system for fisheries resource management above mentioned, real enforcement has been not operated well. For efficient management on same fisheries, next problem will have been solved. First, it has to be guaranteed to transparency on the fisheries management, which is considered the priority problem on the fishing regulation. For reason, although efficient system is established in each country, if feasibility of the system was not trusted, mutual effort like that is very difficult to gain desired results. Then, each country has to establish transparency on the fisheries statistics and administration. Second, it has to be adjusting on the criteria or level of fisheries resource management. Now Korea, Japan and China have different criteria or level of fisheries resource management, for, example, prohibited fish size and prohibited fishing net sine. To solve above problems, three countries need to deeply discuss together. Then fisheries resource co-management scheme should be established in same fishing ground.

  • PDF

A Novel Resource Allocation Scheme for QoS guarantee of Assured Service in Differentiated Services (DiffServ 방식의 Assured Service에서 QoS 보장을 위한 효율적인 자원 할당 방안)

  • Hur, Kyeong;Cho, Seong-Dae;Eom, Doo-Seop;Tchah, Kyun-Hyon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.8C
    • /
    • pp.758-770
    • /
    • 2002
  • In this paper, we propose a novel resource allocation scheme which can maximize capacity for QoS guarantee of Assured Service in Differentiated Services. Performance of the proposed resource allocation scheme is analyzed with each buffer management scheme such as RIO and Adaptive RIO. To prevent an early random drop of the admitted In-profile packet, Adaptive RIO scheme updates parameters of RIO scheme every time interval according to the estimated numbers of maximum packet arrivals of In-profile traffic and Out-of-profile traffic during the next time interval. The numbers of maximum packet arrivals during the next time interval are estimated based on the buffer size determined by the network topology and the ratio of bandwidth allocated to each subclass. We can find from simulation results that proposed resource allocation scheme with Adaptive RIO can guarantee QoS and can maximize capacity for Assured Service.

APPLYING ELITIST GENETIC ALGORITHM TO RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM

  • Jin-Lee Kim;Ok-Kyue Kim
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.739-748
    • /
    • 2007
  • The objective of this research study is to develop the permutation-based genetic algorithm for solving the resource-constrained project scheduling problem in construction engineering by incorporating elitism into genetic algorithm. A key aspect of the algorithm was the development of the elitist roulette selection operator to preserve the best individual solution for the next generation so the improved solution can be obtained. Another notable characteristic is the application of the parallel schedule generation scheme to generate a feasible solution to the problem. Case studies with a standard test problem were presented to demonstrate the performance and accuracy of the algorithm. The computational results indicate that the proposed algorithm produces reasonably good solutions for the resource-constrained project scheduling problem.

  • PDF

Uplink Resource Management Scheme for Multiple QoS Traffics in cdma2000 type Networks: Modified Weighted G-Fair Scheduler with RoT Filling (cdma2000-type 네트워크의 역방향 링크에서의 다중 QoS 서비스 보장을 위한 자원 관리 기술: Modified Weighted G-Fair 스케줄러)

  • 기영민;김은선;김동구
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.786-793
    • /
    • 2004
  • Autonomous data rate control scheme of current IxEV-DO uplink networks can not supper the various QoS requirements of heterogeneous traffics nor hold rise-over-thermal OtoT) constraints. In this paper, an uplink resource management scheme called the modified weighted g-fair (MWGF) scheduler with RoT filling is proposed and evaluated for heterogeneous traffics in cdma2000 type uplink networks. The proposed scheme belongs to a family of centralized resource management schemes and offers QoS guarantee by using priority metrics as well as lower system loading by holding RoT constraints using RoT filling method. With some case-study simulations, the proposed algorithms shows lower average delays of real time users compared to that of autonomous rate control by 29 - 40 %. It also shows the 1.0 - 1.3 dB lower received RoT level than autonomous rate control schemes, leading to lower network loading.

Resource Management for Maximizing Simultaneous Transfer of Information and Power (정보와 전력의 동시 전송을 최대화하기 위한 자원 관리 기법)

  • Lee, Kisong;Kim, Minhoe;Cho, Dong-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.8
    • /
    • pp.1560-1566
    • /
    • 2015
  • To enable the efficient use of energy, the environment where unscheduled receivers can harvest energy from the transmitted signal is considered in next-generation wireless communication systems. In this paper, we propose a scheme for allocating subchannel and power to maximize the system throughput and harvested energy simultaneously using optimization techniques. Through simulations, we verify that the proposed scheme can increase the system throughput and harvested energy harmoniously. In particular, the proposed scheme improves the harvested energy remarkably with a negligible degradation of system throughput, compared with conventional scheme, as a result, energy can be used efficiently in the system.

Dynamic Resource Allocation Scheme for Interference Mitigation in Multi-Hop Relay Networks (멀티 홉 릴레이 네트워크에서 간섭을 완화하는 동적 자원 할당 기법)

  • An, Kwanghoon;Kim, Taejoon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.5 no.5
    • /
    • pp.103-108
    • /
    • 2016
  • In this paper, we propose a resource allocation scheme that guarantees transmission rate for each mobile stations by mitigating interference between a base station-to-mobile station link and a relay station-to-mobile station link. Specifically, we dynamically adjust the boundary between access zone and relay zone using signal to interference plus noise ratio. Moreover, we cluster the mobile stations under sever interference and manage the channel quality of these mobile stations by allocating additional radio resource. Our simulation results show that the proposed scheme can improve the efficiency of radio resources and ensure fairness among mobile stations.