• IEIE Transactions on Smart Processing and Computing
• /
• 제2권5호
• /
• pp.282-296
• /
• 2013

With the emergence of cloud computing, more and more sensitive user data are outsourced to remote storage servers. The privacy of users' access pattern to the data should be protected to prevent un-trusted storage servers from inferring users' private information or launching stealthy attacks. Meanwhile, the privacy protection schemes should be efficient as cloud users often use thin client devices to access the data. In this paper, we propose a lightweight scheme to protect the privacy of data access pattern. Comparing with existing state-of-the-art solutions, our scheme incurs less communication and computational overhead, requires significantly less storage space at the user side, while consuming similar storage space at the server. Rigorous proofs and extensive evaluations have been conducted to show that the proposed scheme can hide the data access pattern effectively in the long run after a reasonable number of accesses have been made.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제14권4호
• /
• pp.391-406
• /
• 2014

The performance of General-Purpose computation on Graphics Processing Units (GPGPU) is heavily dependent on the memory access behavior. This sensitivity is due to a combination of the underlying Massively Parallel Processing (MPP) execution model present on GPUs and the lack of architectural support to handle irregular memory access patterns. Application performance can be significantly improved by applying memory-access-pattern-aware optimizations that can exploit knowledge of the characteristics of each access pattern. In this paper, we present an algorithmic methodology to semi-automatically find the best mapping of memory accesses present in serial loop nest to underlying data-parallel architectures based on a comprehensive static memory access pattern analysis. To that end we present a simple, yet powerful, mathematical model that captures all memory access pattern information present in serial data-parallel loop nests. We then show how this model is used in practice to select the most appropriate memory space for data and to search for an appropriate thread mapping and work group size from a large design space. To evaluate the effectiveness of our methodology, we report on execution speedup using selected benchmark kernels that cover a wide range of memory access patterns commonly found in GPGPU workloads. Our experimental results are reported using the industry standard heterogeneous programming language, OpenCL, targeting the NVIDIA GT200 architecture.

• ETRI Journal
• /
• 제34권1호
• /
• pp.66-75
• /
• 2012

This paper proposes a privacy-preserving database encryption scheme that provides access pattern hiding against a service provider. The proposed scheme uses a session key to permute indices of database records each time they are accessed. The proposed scheme can achieve access pattern hiding in situations in which an adversary cannot access the inside of the database directly, by separating the entity with an index table and data table and permuting both the index and position where the data are stored. Moreover, it is very efficient since only O(1) server computation and communication cost are required in terms of the number of the data stored. It can be applied to cloud computing, where the intermediate entities such as cloud computing service provider can violate the privacy of users or patients.

• International Journal of Internet, Broadcasting and Communication
• /
• 제13권3호
• /
• pp.104-108
• /
• 2021

In order to improve performance in IoT, edge computing system, a memory is usually configured in a hierarchical structure. Based on the distance from CPU, the access speed slows down in the order of registers, cache memory, main memory, and storage. Similar to the change in performance, energy consumption also increases as the distance from the CPU increases. Therefore, it is important to develop a technique that places frequently used data to the upper memory as much as possible to improve performance and energy consumption. However, the technique should solve the problem of cache performance degradation caused by lack of spatial locality that occurs when the data access stride is large. This study proposes a technique to selectively place data with large data access stride to a software-controlled cache. By using the proposed technique, data spatial locality can be improved by reducing the data access interval, and consequently, the cache performance can be improved.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.423-425
• /
• 2007

In this paper, Medium Access Control(MAC) protocol designed for Wireless Body area Sensor Network(Bio-MAC) is proposed, Because in WBSN, the number of node is limited and each node has different characteristics. Also, reliability in transmitting vital data sensed at each node and periodic transmission should be considered so that general MAC protocol cannot satisfy such requirements of biomedical sensors in WBSN. Bio-MAC aims at optimal MAC protocol in WBSN. For this, Bio-MAC used Pattern -SuperFrame, which modified IEE E 802.15.4-based SuperFrame structurely. Bio-MAC based on TDMA uses Medium Access-priority and Pattern eXchange -Beacon method for dynamic slot allocation by considering critical sensing data or power consumption level of sensor no de etc. Also, because of the least delay time. Bio-MAC is suitable in the periodic transmission of vital signal data. The simulation results demonstrate that a efficient performance in WBSN can be achieved through the proposed Bio-MAC.

• Journal of Communications and Networks
• /
• 제13권4호
• /
• pp.400-407
• /
• 2011

Various air indexing and data scheduling schemes for wireless broadcast of spatial data have been developed for energy efficient query processing. The existing schemes are not effective when the clients' data access patterns are skewed to some items. It is because the schemes are based on flat broadcast that does not take the popularity of the data items into consideration. In this paper, thus, we propose a data scheduling scheme letting the popular items appear more frequently on the channel, and grid-based distributed index for non-flat broadcast (GDIN) for window query processing. The proposed GDIN allows quick and energy efficient processing of window query, matching the clients' linear channel access pattern and letting the clients access only the queried data items. The simulation results show that the proposed GDIN significantly outperforms the existing schemes in terms of access time, tuning time, and energy efficiency.

• 정보처리학회논문지D
• /
• 제11D권1호
• /
• pp.143-152
• /
• 2004

최근에 객체지향 소프트웨어를 설계하거나 구현방법으로 EJB 기반의 소프트웨어 개발이 많이 이용되고 있다. 일반적으로 EJB 기반 어플리케이션에서는 데이터베이스를 이용한 영속적인 데이터를 사용하는 경우가 대부분이다. 본 논문에서는 서버 측 작성 프로그램 중 엔티티빈 클래스에서 담당하는 데이터베이스 엑세스에 관련된 부분을 J2EE의 DAO 패턴을 이용하여 클래스를 각각 분리하였다. 이는 기존의 패턴 방법과는 큰 차이는 없으나, 동일 패턴내의 공통의 클래스들을 합성이 가능하도록 설계하였다. 그리고 생성된 각각의 DBMS 클래스들은 다른 엔티티빈 클래스에서도 사용이 가능하게 할 뿐만 아니라 여러 DBMS 환경에서도 Data Source를 추가적인 프로그램의 변경이나 작성 없이 연동이 가능하도록 하고 있다.

• 디지털산업정보학회논문지
• /
• 제9권2호
• /
• pp.23-32
• /
• 2013

The purpose of this study is to make effective mobile grid considered general environment, which can be summarized as irregular mobility, service exploration, data sharing, variety of machines, limit to the battery duration, etc. The data was extracted from the Dartmouth College. We analysed mobile use pattern of a specific group and applied pattern using hybrid method. As a result, we could adjust infra usage effectively and appropriately and cost cutting and increase satisfaction of user. In this study, by applying weighting method based on access time interval, we analysed use pattern added time variation with association rule during users in mobile grid environment. We proposed more stable way to manage patterns in a mobile grid environment that is being used as a hybrid form to process the data value received from the server in real time. Further studies are needed to get appropriate use pattern by group using use patterns of various groups.

• 전자공학회논문지A
• /
• 제29A권10호
• /
• pp.1-7
• /
• 1992

This paper proposes reservation-based multiple access with variable frame length (RMAV) which is a new multiple access scheme for indoor and outdoor wireless data communications. RMAV is based on the slot reservation scheme and adopts a frame structure with variable frame length. The frame length increases as the number of active terminals and/or the system load increases. As a result, RMAV is adapted to the changes in the traffic pattern, and it offers short delay in light load conditions and high throughput in heavy load conditions. The performance of RMAV is evaluated by simulations. In addition, it is compared with the performance of PRMA(packet reservation multiple access).

• 한국정보과학회논문지:데이타베이스
• /
• 제34권5호
• /
• pp.465-472
• /
• 2007

XML과 같은 준구조적 데이타가 많이 사용됨에 따라 이를 효과적으로 저장하고 관리하는 것이 중요해지고 있다. XML 데이타는 트리 형태로 모델링이 가능하며, 기본적으로 질의 처리는 트리를 탐색하는 방식으로 이루어진다. 본 논문에서는 XML 데이타를 디스크 블록에 저장하는 알고리즘을 제안한다. 제안하는 알고리즘은 트리의 각 노드마다 아래쪽에서 위쪽으로 숫자를 할당하며 그 숫자를 이용하여 디스크 블록에 노드들을 매핑한다. 제안하는 알고리즘은 접근 패턴 정보를 필요로 하지 않으며 어떠한 접근 패턴에 대해서도 좋은 성능을 보인다. 제안하는 방법의 몇가지 특성을 증명하고, 실험을 통해서 성능을 평가한다.