• Title/Summary/Keyword: data block allocation

Search Result 46, Processing Time 0.021 seconds

Joint Space-time Coding and Power Domain Non-orthogonal Multiple Access for Future Wireless System

  • Xu, Jin;Ding, Hanqing;Yu, Zeqi;Zhang, Zhe;Liu, Weihua;Chen, Xueyan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.1
    • /
    • pp.93-113
    • /
    • 2020
  • According to information theory, non-orthogonal transmission can achieve the multiple-user channel capacity with an onion-peeling like successive interference cancellation (SIC) based detection followed by a capacity approaching channel code. However, in multiple antenna system, due to the unideal characteristic of the SIC detector, the residual interference propagated to the next detection stage will significantly degrade the detection performance of spatial data layers. To overcome this problem, we proposed a modified power-domain non-orthogonal multiple access (P-NOMA) scheme joint designed with space-time coding for multiple input multiple output (MIMO) NOMA system. First, with proper power allocation for each user, inter-user signals can be separated from each other for NOMA detection. Second, a well-designed quasi-orthogonal space-time block code (QO-STBC) was employed to facilitate the SIC-based MIMO detection of spatial data layers within each user. Last, we proposed an optimization algorithm to assign channel coding rates to balance the bit error rate (BER) performance of those spatial data layers for each user. Link-level performance simulation results demonstrate that the proposed time-space-power domain joint transmission scheme performs better than the traditional P-NOMA scheme. Furthermore, the proposed algorithm is of low complexity and easy to implement.

An Efficient Wear-Leveling Algorithm for NAND Flash SSD with Multi-Channel and Multi-Way Architecture (멀티채널과 멀티웨이 구조의 NAND 플래시 SSD를 위한 효율적인 웨어레벨링 알고리듬)

  • Kim, Dong-Ho;Hwang, Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39B no.7
    • /
    • pp.425-432
    • /
    • 2014
  • This paper proposes a wear-leveling algorithm that exploits the properties of SSD memories with multi-channel and multi-way architecture. When a write request arrives, the proposed algorithm classifies the stored data in DRAM buffer into hot or cold according to logical address access frequency, and performs data allocation to reduce deviation of block erase counts. It lowers the chance of increasing erase count by allocating cold data to blocks which have high erase count. Effectiveness of the proposed algorithm is verified by executing various applications on a multi-channel, multi-way SSD simulator. Experimental results show that differences in erase count among blocks is reduced by an average of 9.3%, and total erase count decreases by 4.6%, when compared to previous wear-leveling algorithm.

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.

Access Frequency Based Selective Buffer Cache Management Strategy For Multimedia News Data (접근 요청 빈도에 기반한 멀티미디어 뉴스 데이터의 선별적 버퍼 캐쉬 관리 전략)

  • Park, Yong-Un;Seo, Won-Il;Jeong, Gi-Dong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.9
    • /
    • pp.2524-2532
    • /
    • 1999
  • In this paper, we present a new buffer pool management scheme designed for video type news objects to build a cost-effective News On Demand storage server for serving users requests beyond the limitation of disk bandwidth. In a News On Demand Server where many of users request for video type news objects have to be serviced keeping their playback deadline, the maximum numbers of concurrent users are limited by the maximum disk bandwidth the server provides. With our proposed buffer cache management scheme, a requested data is checked to see whether or not it is worthy of caching by checking its average arrival interval and current disk traffic density. Subsequently, only granted news objects are permitted to get into the buffer pool, where buffer allocation is made not on the block basis but on the object basis. We evaluated the performance of our proposed caching algorithm through simulation. As a result of the simulation, we show that by using this caching scheme to support users requests for real time news data, compared with serving those requests only by disks, 30% of extra requests are served without additional cost increase.

  • PDF

Design and Implementation of a Metadata Structure for Large-Scale Shared-Disk File System (대용량 공유디스크 파일 시스템에 적합한 메타 데이타 구조의 설계 및 구현)

  • 이용주;김경배;신범주
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.1
    • /
    • pp.33-49
    • /
    • 2003
  • Recently, there have been large storage demands for manipulating multimedia data. To solve the tremendous storage demands, one of the major researches is the SAN(Storage Area Network) that provides the local file requests directly from shared-disk storage and also eliminates the server bottlenecks to performance and availability. SAN also improve the network latency and bandwidth through new channel interface like FC(Fibre Channel). But to manipulate the efficient storage network like SAN, traditional local file system and distributed file system are not adaptable and also are lack of researches in terms of a metadata structure for large-scale inode object such as file and directory. In this paper, we describe the architecture and design issues of our shared-disk file system and provide the efficient bitmap for providing the well-formed block allocation in each host, extent-based semi flat structure for storing large-scale file data, and two-phase directory structure of using Extendible Hashing. Also we describe a detailed algorithm for implementing the file system's device driver in Linux Kernel and compare our file system with the general file system like EXT2 and shard disk file system like GFS in terms of file creation, directory creation and I/O rate.

Effects of different space allowances on growth performance, blood profile and pork quality in a grow-to-finish production system

  • Jang, J.C.;Jin, X.H.;Hong, J.S.;Kim, Y.Y.
    • Asian-Australasian Journal of Animal Sciences
    • /
    • v.30 no.12
    • /
    • pp.1796-1802
    • /
    • 2017
  • Objective: This experiment was conducted to evaluate the optimal space allowance on growth performance, blood profile and pork quality of growing-finishing pigs. Methods: A total of ninety crossbred pigs [$(Yorkshire{\times}Landrace){\times}Duroc$, $30.25{\pm}1.13kg$] were allocated into three treatments (0.96: four pigs/pen, $0.96m^2/pig$; 0.80: five pigs/pen, $0.80m^2/pig$; 0.69: six pigs/pen, $0.69m^2/pig$) in a randomized complete block design. Pigs were housed in balanced sex and had free access to feed in all phases for 14 weeks (growing phase I, growing phase II, finishing phase I, and finishing phase II). Results: There was no statistical difference in growing phase, but a linear decrease was observed on average daily gain (ADG, p<0.01), average daily feed intake (ADFI, p<0.01), and body weight (BW, p<0.01) with decreasing space allowance in late finishing phase. On the other hand, a quadratic effect was observed on gain to feed ratio in early finishing phase (p<0.03). Consequently, overall ADG, ADFI, and final BW linearly declined in response to decreased space allowance (p<0.01). The pH of pork had no significant difference in 1 hour after slaughter, whereas there was a linear decrease in 24 h after slaughter with decreasing space allowance. Floor area allowance did not affect pork colors, but shear force linearly increased as floor space decreased (p<0.01). There was a linear increase in serum cortisol concentration on 14 week (p<0.05) with decreased space allocation. Serum IgG was linearly ameliorated as space allowance increased on 10 week (p<0.05) and 14 week (p<0.01). Conclusion: Data from current study indicated that stress derived from reduced space allowance deteriorates the immune system as well as growth performance of pigs, resulting in poor pork quality. Recommended adequate space allowance in a grow-to-finish production system is more than $0.80m^2/pig$ for maximizing growth performance and production efficiency.