• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1245-1251
• /
• 2017

In this study we present a novel directory architecture that can dynamically allocate a directory entry for a cache block on demand at runtime only when the block is shared by more than one core. Thus, we do not maintain coherence for private blocks, substantially reducing the number of directory entries. Even for shared blocks, we allocate directory entry dynamically only when the block is actively shared, further reducing the number of directory entries at runtime. For this, we propose a new directory architecture called dynamic directory table (DDT), which is implemented as a cache of active directory entries. Through our detailed simulation on PARSEC benchmarks, we show that DDT can outperform the expensive full-map directory by a slight margin with only 17.84% of directory area across a variety of different workloads. This is achieved by its faster access and high hit rates in the small directory. In addition, we demonstrate that even smaller DDTs can give comparable or higher performance compared to recent directory optimization schemes such as SPACE and DGD with considerably less area.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.4
• /
• pp.1098-1105
• /
• 1999

The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.

• Journal of Information Management
• /
• v.36 no.4
• /
• pp.91-115
• /
• 2005

While the amount of information exchanged through internet has dramatically increased recently, certain inefficiencies still exist with regard to the storage, distribution, and retrieval of information. As a means of improving efficiency in accessing information, many search portals provide directory services to present organized guidance to information, based on the classification schemes. This study examines the classification activities practiced by the major search portals in Korea and makes some suggestions to improve the quality of directory services.

• Journal of Information Management
• /
• v.37 no.1
• /
• pp.83-103
• /
• 2006

This study analyzes the classification schemes and classified information resources of the directory services provided by major web portals to complement keyword-based retrieval. Specifically, this study intends to quantitatively analyze the topic categories, the information resources by subject, and the information resources classified by the topic categories of three directories, Yahoo, Naver, and Empas. The result of this analysis reveals some differences among directory services. Overall, these directories show different ratios of referred categories to original categories depending on the subject area, and the categories regarded as format-based show the highest proportion of referred categories. In terms of the total amount of classified information resources, Yahoo has the largest number of resources. The directories compared have different amounts of resources depending on the subject area. The quantitative analysis of resources classified by the specific category is performed on the class of 'News & Media'. The result reveals that Naver and Empas contain overly specified categories compared to Yahoo, as far as the number of information resources categorized is concerned. Comparing the depth of the categories assigned by the three directories to the same information resources, it is found that, on average, Yahoo assigns one-step further segmented divisions than the other two directories to the identical resources.

• Journal of Information Technology and Architecture
• /
• v.11 no.4
• /
• pp.427-439
• /
• 2014

Introduction of new information systems due to continuous progress of ICT has made the enterprise IT environment into a mixed pot of various IT resources. Rapidly changing business situation has emphasized the integration of organizational IT resources as one of key competitive advantages. Those distributed IT resources are now demanding to solve the problems not only on their own effective management but also on security and control issues against unauthorized infiltration and information leakages. Under the situation that the number of IT resources is constantly increasing, it is needed to study a management model and its implementation that integrally solves above all problems. In this paper, it is revealed that a directory service can be used to integrally manage distributed IT resources and a directory service based system model for distributed IT resource management is suggested. By implementing an HR solution over active directory service, it is demonstrated that our integrated management model for distributed resources is applicable to real business cases. It is expected that for small and medium sized enterprises with limited IT investments, directory service based IT resource management system can be a cost-effective solution for increasing security threats and lack of governance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.592-598
• /
• 2000

The locality of data references at the distributed shared memory systems affects the performance significantly. Data allocation methods by considering the locality of data references can improve the performance of DSM systems. This paper evaluates the performance for the dynamic limited directory scheme which data allocation methods can apply very effectively. The information of the data allocation is used by the dynamic limited directory scheme to set the presence bit effectively. And the proper use of the presence bit improves the performance by reducing memory overhead and using directory pool efficiently. Simulations are conducted using three application programs which have various data sharing. The results show that the optimal data allocation method improves the performance up to 3.6 times in the proposed scheme.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.81-82
• /
• 2014

윈도우나 리눅스 등의 일반적인 파일 시스템은 데이터를 로컬 저장 장치에 직접 저장하고 관리하기 때문에 대용량 저장 공간을 기반으로 운영된다. 반면에, 클라우딩을 위한 가상 파일 시스템은 데이터를 로컬 저장 장치에 직접 저장하는 경우보다는 지역적으로 분산된 데이터에 대한 지시자만을 관리하는 경우가 더 많다. 이 연구에서는 소규모 클라우딩 환경에서 파일 시스템의 디렉터리 체계를 DB로 유지하면서 모든 데이터 파일들은 지시자로만 관리하는 유닉스 파일 시스템 스타일의 가상 파일 시스템을 설계하여 제안한다. 시험 결과, 트리 구조의 디렉터리 체계가 의도대로 이루어짐이 확인되었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.103-104
• /
• 2015

IoT의 주요 구성요소는 기존의 데스크 탑 외에 디바이스 즉, 단말 기기들이 주류를 이룬다. 이러한 IoT 디바이스들은 데이터의 유형이나 접근 방법이 다양하고, 실시간적 데이터 생산과 제어를 위한 양방향 데이터 접근 지원을 필요로 한다. 이러한 IoT 디바이스를 연결하여 클라우드 형 서비스로 개발하기 위해서는 디바이스 속성 관리가 용이한 도메인 관리 방법과 디바이스에 대한 일관된 접근 인터페이스를 제공하는 플랫폼이 필요하다. 이 논문에서는 리눅스 파일시스템 후면 즉, 사용자 영역에 리눅스 파일 시스템 스타일의 DB 기반 가상 파일시스템을 구축하여 IoT 디바이스를 연결하고 관리하는 프레임워크를 제시한다. 구현 가상 파일시스템은 계층적 디렉터리 체계를 DB에 유지하면서 단말 노드에는 지리적으로 산재한 IoT 디바이스들에 대한 속성 정보를 관리한다. 디렉터리 및 IoT 디바이스의 추가 삭제 검색 등 도메인 관리는 mkdir. mknod, ls, find 등 리눅스 고유 명령어로 이루어지고, 모든 IoT 디바이스에 대한 접근은 open(), read(), write(), close() 등 POSIX 인터페이스를 통해 가능하다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1145-1153
• /
• 2013

Android mobile platform copy the class files of all applications installed in android platform and keep them into one directory. But to add the service library into a platform, Android must generate a new binary image of platform and replace the platform because android refer the libraries using the memory-mapped file method in a directory. And this memory-mapped file reference method waste the storage space of mobile device because that directory include the duplicated libraries if the libraries refered by application are duplicated, Therefore a dynamic reconfiguration method on android mobile platform is needed to manage the service libraries of application executed on android platform and support the version management and function addition/modification. In this paper, we propose the platform dynamic reconfiguration method to add dynmically the service libraries on android platform.

• Digital Contents
• /
• no.2 s.57
• /
• pp.50-54
• /
• 1998

독립정보전문가와 관련된 이슈의 토의와 포럼 운영을 통한 회원 상호간 전문성과 지식을 함양하기 위해 설립된 AIIP는 회원들의 대부분이 정보서비스와 관련한 온라인 검색, 수작업 조사, 데이터베이스 디자인, 문헌제공, 컨설팅, 저작 및 출판을 담당하는 회사의 사장들이다. 창립 11주년을 맞은 올해 회원수는 약 800명을 넘고 있다. 이 협회에서는 회원을 위해 계간으로 뉴스레터를 발행하고 있으며, 매년 회원의 디렉터리를 발간하고 인터넷상에서 개인리스트를 서비스하고 있다.