• Title/Summary/Keyword: resource block

Search Result 223, Processing Time 0.028 seconds

A Memory Configuration Method for Virtual Machine Based on User Preference in Distributed Cloud

  • Liu, Shukun;Jia, Weijia;Pan, Xianmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.11
    • /
    • pp.5234-5251
    • /
    • 2018
  • It is well-known that virtualization technology can bring many benefits not only to users but also to service providers. From the view of system security and resource utility, higher resource sharing degree and higher system reliability can be obtained by the introduction of virtualization technology in distributed cloud. The small size time-sharing multiplexing technology which is based on virtual machine in distributed cloud platform can enhance the resource utilization effectively by server consolidation. In this paper, the concept of memory block and user satisfaction is redefined combined with user requirements. According to the unbalanced memory resource states and user preference requirements in multi-virtual machine environments, a model of proper memory resource allocation is proposed combined with memory block and user satisfaction, and at the same time a memory optimization allocation algorithm is proposed which is based on virtual memory block, makespan and user satisfaction under the premise of an orderly physical nodes states also. In the algorithm, a memory optimal problem can be transformed into a resource workload balance problem. All the virtual machine tasks are simulated in Cloudsim platform. And the experimental results show that the problem of virtual machine memory resource allocation can be solved flexibly and efficiently.

Improvement and Performance Evaluation of the Traffic Channel Management of the Radio Network Controller in IMT-2000 Network (IMT-2000 망에서 제어국의 트래픽 채널 관리 방식의 개선 및 성능 평가)

  • Ryu, Byung-Han;Ahn, Jee-Hwan;Baek, Jang-Hyun
    • IE interfaces
    • /
    • v.16 no.3
    • /
    • pp.311-321
    • /
    • 2003
  • We propose the improved channel assignment and management methods for an efficient use of traffic channel resource for supporting 12.2 Kbps, 64 Kbps, and 384 Kbps traffic with the different quality of service(QoS) in the radio network controller(RNC) in asynchronous IMT-2000 system. We consider two types of traffic channel block assignments for utilizing the traffic channel efficiently; the Completely Shared(CS) channel assignment and the Partially Dedicated and Partially Shared(PDPS) channel assignment. The former is that all traffic channel blocks are completely shared with all traffic types. The latter is that some traffic channel block is independently assigned to each traffic type and the other blocks are completely shared with some traffic type. We also propose the traffic channel management method which consists of the block and task management step, for efficiently assigning, releasing, and managing the channel resource. Finally, we evaluate the performance through various numerical examples when applying our proposed channel block assignment and resource management methods.

Thread Block Scheduling for GPGPU based on Fine-Grained Resource Utilization (상세 자원 이용률에 기반한 병렬 가속기용 스레드 블록 스케줄링)

  • Bahn, Hyokyung;Cho, Kyungwoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.49-54
    • /
    • 2022
  • With the recent widespread adoption of general-purpose GPUs (GPGPUs) in cloud systems, maximizing the resource utilization through multitasking in GPGPU has become an important issue. In this article, we show that resource allocation based on the workload classification of computing-bound and memory-bound is not sufficient with respect to resource utilization, and present a new thread block scheduling policy for GPGPU that makes use of fine-grained resource utilizations of each workload. Unlike previous approaches, the proposed policy reduces scheduling overhead by separating profiling and scheduling, and maximizes resource utilizations by co-locating workloads with different bottleneck resources. Through simulations under various virtual machine scenarios, we show that the proposed policy improves the GPGPU throughput by 130.6% on average and up to 161.4%.

Service Block Based Resource Allocation Scheme for Macrocell-Femtocell Networks

  • Lee, Jong-Chan;Lee, Moon-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.6
    • /
    • pp.29-35
    • /
    • 2015
  • The heterogeneous LTE (Long Term Evolution)-Advanced networks comprising a macrocell and femtocells can provide an efficient solution not only to extend macrocell coverage but also to deal with packet traffics increasing explosively within macrocells. An efficient resource management scheme is necessary to maintain the QoS (Quality of Service) of mobile multimedia services because the LTE-Advanced system should support not only voice but also mobile applications such as data, image and video. This paper proposes a resource management scheme to guarantee QoS continuity of multimedia services and to maximize the resource utilization in OFDMA (Orthogonal Frequency Division Multiple Access) based LTE-Advanced systems. This scheme divides the resources into several service blocks and allocates those resources based on the competition between macrocell and femtocell. Simulation results show that it provides better performances than the conventional one in respect of handover failure rate and blocking rate.

DABC: A dynamic ARX-based lightweight block cipher with high diffusion

  • Wen, Chen;Lang, Li;Ying, Guo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.1
    • /
    • pp.165-184
    • /
    • 2023
  • The ARX-based lightweight block cipher is widely used in resource-constrained IoT devices due to fast and simple operation of software and hardware platforms. However, there are three weaknesses to ARX-based lightweight block ciphers. Firstly, only half of the data can be changed in one round. Secondly, traditional ARX-based lightweight block ciphers are static structures, which provide limited security. Thirdly, it has poor diffusion when the initial plaintext and key are all 0 or all 1. This paper proposes a new dynamic ARX-based lightweight block cipher to overcome these weaknesses, called DABC. DABC can change all data in one round, which overcomes the first weakness. This paper combines the key and the generalized two-dimensional cat map to construct a dynamic permutation layer P1, which improves the uncertainty between different rounds of DABC. The non-linear component of the round function alternately uses NAND gate and AND gate to increase the complexity of the attack, which overcomes the third weakness. Meanwhile, this paper proposes the round-based architecture of DABC and conducted ASIC and FPGA implementation. The hardware results show that DABC has less hardware resource and high throughput. Finally, the safety evaluation results show that DABC has a good avalanche effect and security.

SimTBS: Simulator For GPGPU Thread Block Scheduling (SimTBS: GPGPU 스레드블록 스케줄링 시뮬레이터)

  • Cho, Kyung-Woon;Bahn, Hyokyung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.4
    • /
    • pp.87-92
    • /
    • 2020
  • Although GPGPU (General-Purpose GPU) can maximize performance by parallelizing a task with tens of thousands of threads, those threads are internally grouped into a thread block, which is a base unit for processing and resource allocation. A thread block scheduler is a specialized hardware gadget whose role is to allocate thread blocks to GPGPU processing hardware in a round-robin manner. However, round-robin is a sequential allocation policy and is not optimized for GPGPU resource utilization. In this paper, we propose a thread block scheduler model which can analyze and quantify performances for various thread block scheduling policies. Experiment results from the implemented simulator of our model show that the legacy hardware thread block scheduling does not behave well when workload becomes heavy.

Statistically Controlled Opportunistic Resource Block Sharing for Femto Cell Networks

  • Shin, Dae Kyu;Choi, Wan;Yu, Takki
    • Journal of Communications and Networks
    • /
    • v.15 no.5
    • /
    • pp.469-475
    • /
    • 2013
  • In this paper, we propose an efficient interference management technique which controls the number of resource blocks (or subcarriers) shared with other cells based on statistical interference levels among cells. The proposed technique tries to maximize average throughput of a femto cell user under a constraint on non-real time control of a femto cell network while guaranteeing a target throughput value of a macro cell user. In our proposed scheme, femto cells opportunistically use resource blocks allocated to other cells if the required average user throughput is not attained with the primarily allocated resource blocks. The proposed method is similar to the underlay approach in cognitive radio systems, but resource block sharing among cells is statistically controlled. For the statistical control, a femto cell sever constructs a table storing average mutual interference among cells and periodically updates the table. This statistical approach fully satisfies the constraint of non-real time control for femto cell networks. Our simulation results show that the proposed scheme achieves higher average femto user throughput than conventional frequency reuse schemes for time varying number of users.

Resource Allocation in Two Hop Relay Network based on PB/MC-CDMA System (PB/MC-CDMA 기반 two-hop 중계 망에서의 자원 할당 방식)

  • Sun, Yan;Lee, Kye-San
    • Journal of Satellite, Information and Communications
    • /
    • v.5 no.1
    • /
    • pp.94-99
    • /
    • 2010
  • In this paper, we discuss a proposed two hop relay network with PB/MC-CDMA(partial block MC-CDMA) technique. The main advantages of PB/MC-CDMA system are the increased cell capacity and the high quality of performances. In the system, we employ relay scheme to focus on the coverage reduction and hotspot problem, hotspot is a location where a cluster of users are blocked or dropped for the reason of insufficient frequency resources. Frequency resource allocation scheme is put forward in a three cells system according to each problem. The simulation result shows the performance of the two hop transmission is better than the direct transmission and the proposed network can support much more users to relief hotspot effect compared to the conventional one.

An Analysis of the Price Elasticity of Electricity Demand and Price Reform in the Korean Residential Sector Under Block Rate Pricing (구간별 가격체계를 고려한 우리나라 주택용 전력수요의 가격탄력성과 전력누진요금제 조정방안)

  • Jo, Ha-Hyun;Jang, Min-Woo
    • Environmental and Resource Economics Review
    • /
    • v.24 no.2
    • /
    • pp.365-410
    • /
    • 2015
  • Block-rate structures are widely used in utility-pricing, including the Korean residential electricity sector. In the case of the current pricing structure, Korean citizens are highly concerned about incurring excessive electricity costs. For these reasons, there have been many discussions concerning mitigation of the strict pricing structure. Existing studies on the residential electricity demand function under block-rate structure have the following three issues - the consumer's budget constraint is non-linear, perceived price under block-rate structure is uncertain, block-rate structure has endogeneity in the price variable. In this context, this paper estimates the residential electricity demand function using micro-level household expenditure data and simulates the impact of alternative block-pricing schedules.

Traffic Channel Management of the Radio Network Controller in IMT-2000 W-CDMA System (IMT-2000 비동기 방식 시스템에서 제어국의 트래픽 채널 관리 방식)

  • 유병한;장성철;백장현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.3B
    • /
    • pp.226-236
    • /
    • 2002
  • In this paper, we present the channel assignment and management methods for an efficient use of traffic channel resource for supporting 12.2 Kbps, 64 Kbps, and 384 Kbps traffic with the different quality of service (QoS) in the radio network controller (RNC) in asynchronous IMT-2000 system. We first describe two types of traffic channel block assignments for utilizing the traffic channel efficiently; the partially dedicated and partially shared channel (PDPSC) assignment and the completely shared channel (CSC) assignment. The former is that some traffic channel block is completely assigned to each traffic type and the other blocks are shared with some traffic type. The latter is that all traffic channel blocks are completely shared with all traffic types. Further, for efficiently assigning, releasing, and managing the channel resource, we present the traffic channel management method which consists of the block and task management step. Through numerical examples, we evaluate the blocking probability and the mean number of required search for fading the available channel when applying our proposed channel block assignment and resource management methods.