• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권5호
• /
• pp.570-576
• /
• 2015

Existing flash storage devices such as universal flash storage and solid state disk support command queuing to improve storage I/O bandwidth. Command queuing allows multiple read/write requests to be pending in a device queue. Because multi-channel and multi-way architecture of flash storage devices can handle multiple requests simultaneously, command queuing is an indispensable technique for utilizing parallel architecture. However, command queuing can be harmful to the latency of fsync system call, which is critical to application responsiveness. We propose a dynamic queue depth adaptation technique, which reduces the queue depth if user application is expected to send fsync calls. Experiments show that the proposed technique reduces the fsync latency by 79% on average compared to the original scheme.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2006년도 하계종합학술대회
• /
• pp.5-6
• /
• 2006

iSCSI is a block-oriented storage access protocol that enables a user to recognize a remote storage as their own local block device through general TCP/IP networks. This paper presents an alternative approach to overcome the limited storage space of mobile devices based on the iSCSI initiator driver in IPv6 environment, which was originally designed for wired networks.

• 한국주거학회:학술대회논문집
• /
• 한국주거학회 2001년도 학술발표대회논문집
• /
• pp.89-97
• /
• 2001

The purpose of this study is to provide basic information far planning Dinning-Kitchen storage space. The self-administered questionnaire method were used for this study. The result were analyzed SPSS package program. The major findings were summarized as follows: The size of apartment was related to satisfaction of Dinning-Kitchen storage furiture and was related to storage usage.

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2003년도 somma/kms meeting
• /
• pp.56-56
• /
• 2003

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2007년도 The 1st International Symposium on Advanced Magnetic Materials
• /
• pp.287.2-287.2
• /
• 2007

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2007년도 The 1st International Symposium on Advanced Magnetic Materials
• /
• pp.319.1-319.1
• /
• 2007

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2007년도 The 1st International Symposium on Advanced Magnetic Materials
• /
• pp.261.1-261.1
• /
• 2007

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2007년도 The 1st International Symposium on Advanced Magnetic Materials
• /
• pp.158.2-158.2
• /
• 2007

• 한국자기학회:학술대회 개요집
• /
• 한국자기학회 2007년도 The 1st International Symposium on Advanced Magnetic Materials
• /
• pp.127.1-127.1
• /
• 2007

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3319-3338
• /
• 2016

Cloud storage is becoming more and more popular because of its elasticity and pay-as-you-go storage service manner. In some cloud storage scenarios, the data that are stored in the cloud may be shared by a group of users. To verify the integrity of cloud data in this kind of applications, many auditing schemes for shared cloud data have been proposed. However, all of these schemes do not consider the access authorization problem for users, which makes the revoked users still able to access the shared cloud data belonging to the group. In order to deal with this problem, we propose a novel public auditing scheme for shared cloud data in this paper. Different from previous work, in our scheme, the user in a group cannot any longer access the shared cloud data belonging to this group once this user is revoked. In addition, we propose a new random masking technique to make our scheme preserve both data privacy and identity privacy. Furthermore, our scheme supports to enroll a new user in a group and revoke an old user from a group. We analyze the security of the proposed scheme and justify its performance by concrete implementations.