主講人： Dr. Kenneth Shum (香港中文大學研究副教授)
時間：102年09月25日(星期三13:30-15:30)
地點：三峽校區文學院文1F11教室
Abstract:
Reliability in disk arrays is provisioned by storing the data with redundancy. For example, in RAID-6, we protect the data from being lost by introducing parity-check disks, so that any failure of two disks can be restored. In a large-scale distributed storage system, disk failures and repairs are common day-to-day event, and incur excessive amount of traffic for the recovery of failed disks. A class of codes, called regenerating codes, was introduced by Dimakis et al. for the purpose of reducing the required repair traffic. Like Reed-Solomon codes, most of the existing regenerating codes rely on the arithmetic of finite fields. The computational complexity of encoding and decoding may render the system impracticable if the size of the finite field is large. In this talk, we discuss a construction of regenerating codes called Binary Addition and Shift Implementable Convolutional (BASIC) codes, in which finite field additions and multiplications are replaced by bit-wise exclusive OR and bit-wise shifting. The advantage of regenerating code is thereby attained with lower computational cost. This is a joint work with Minghua Chen, Hanxu Hou and Hui Li.
Biography
Kenneth Shum received the B.Eng. degree in information engineering from the Chinese University of Hong Kong in 1993, and the M.S. and Ph.D. degrees in electrical engineering from the University of Southern California in 1995 and 2000, respectively. He is now a research associate professor with the Institute of Network Coding, the Chinese University of Hong Kong. His research interests include information theory and coding for distributed storage systems.
敬邀參加~
