• Title/Summary/Keyword: 메모리 계층

Search Result 260, Processing Time 0.02 seconds

Design and VLSI Implementation of Reassembly Controller for ATM/AAL Layer (ATM/AAL 처리를 위한 재조립 처리기의 설계 및 VLSI 구현)

  • 박경철;심영석
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.5
    • /
    • pp.369-378
    • /
    • 2003
  • This paper presents design and VLSI implementations of a reassembly processor for ATM/AAL. The assembly processor is responsible for processing ATM cells from the receive physical interface. It controls the transfer of the AAL payload to host memory and performs all necessary SAR and CPCS checks. We propose the improved structure of cell identification algorithm and smart scatter method for host memory management. The proposed cell identification algorithm quickly locates the appropriate reassembly VC table based on the received VPI./VCI channel value in the ATM header. The cell identification algorithm also allow complete freedom in assignment of VCI/VPI values. The reassembly processor uses a smart scatter method to write cell payload data to host memory. It maintains the scatter operation and controls the incoming DMA block during scatter DMA to host memory. The proposed reassembly processor can perform reassembly checks on AAL. OAM cell. For an AAL5 connection, only CPCS checks, including the CRC32, are performed. In this paper, we proposed a practical reassembly architecture. The design of reassembly processor has become feasible using 0.6${\mu}{\textrm}{m}$ CMOS gate array technology.

The Efficient Spatio-Temporal Moving Pattern Mining using Moving Sequence Tree (이동 시퀀스 트리를 이용한 효율적인 시공간 이동 패턴 탐사 기법)

  • Lee, Yon-Sik;Ko, Hyun
    • The KIPS Transactions:PartD
    • /
    • v.16D no.2
    • /
    • pp.237-248
    • /
    • 2009
  • Recently, based on dynamic location or mobility of moving object, many researches on pattern mining methods actively progress to extract more available patterns from various moving patterns for development of location based services. The performance of moving pattern mining depend on how analyze and process the huge set of spatio-temporal data. Some of traditional spatio-temporal pattern mining methods[1-6,8-11]have proposed to solve these problem, but they did not solve properly to reduce mining execution time and minimize required memory space. Therefore, in this paper, we propose new spatio-temporal pattern mining method which extract the sequential and periodic frequent moving patterns efficiently from the huge set of spatio-temporal moving data. The proposed method reduces mining execution time of $83%{\sim}93%$ rate on frequent moving patterns mining using the moving sequence tree which generated from historical data of moving objects based on hash tree. And also, for minimizing the required memory space, it generalize the detained historical data including spatio-temporal attributes into the real world scope of space and time using spatio-temporal concept hierarchy.

Design and Implementation of Multilingual support method for 3-tiered softwares (3-TIER 구조 소프트웨어의 다국어 지원 방식의 설계와 구현)

  • Koh, Jeong-Gook
    • Journal of Korea Multimedia Society
    • /
    • v.15 no.2
    • /
    • pp.266-272
    • /
    • 2012
  • Multilingual support of software is necessary for entering global market. 3-tier architecture is a solution for problems of 2-tier architecture. It divides an application into a client-tier and an application-tier, and presentation logic and database are connected by middleware. The advantage of 3-tier architecture is the enhanced performance through load balancing, scalability, easier maintenance and reusability. This paper proposes a multilingual support method that utilizes common resource files for 3-tier enterprise softwares, applies the proposed method to development of multilingual version of billing solution, and verify the usefulness of it. It is easy for development and maintenance of software, the addition of language supported. Proposed method holds a resource file for each language and provides a multilingual support class library. Therefore this method reduces a waste of memory and disk space. Deployment of a class library into an application tier makes development and maintenance of software, the addition of new language supported easy. To avoid inappropriate modification of a resource file, a multilingual support class library is provided in a dll file.

Attribute-Rich Log-Structured Filesystem for Semantic File Search on SSD (SSD에서의 시맨틱 파일 검색을 위한 확장된 속성 제공의 로그기반 파일시스템)

  • Ki, An-Ho;Kang, Soo-Yong
    • Journal of Digital Contents Society
    • /
    • v.12 no.2
    • /
    • pp.241-252
    • /
    • 2011
  • During the last decades, other parts of operating systems, storage devices, and media are changed steadily, whereas filesystem is changed little. As data is grown bigger, the number of files to be managed also increases in geometrically. Researches about new filesystem schemes are being done widely to support these files efficiently. In web document search area, there are many researches about finding meaningful documents using semantic search. Many researches tried to apply these schemes, which is been proven in web document search previously, to filesystems. But they've focused only on higher layer of filesystem, that is not related seriously to storage media. Therefore they're not well tuned to physical characteristics of new flash memory based SSD which has different features against traditional HDD. We enhance log structured filesystem, that is already well known to work better in SSD, by putting semantic search scheme to and with multi logging point.

Constant Time Algorithm for the Window Operation of Linear Quadtrees on RMESH (RMESH구조에서 선형 사진트리의 윈도우 연산을 위한 상수시간 알고리즘)

  • Kim, Kyung-Hoon;Jin, Woon-Woo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.3
    • /
    • pp.134-142
    • /
    • 2002
  • Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The window operation is one of important geometry operations in image processing, which extracts a sub-image indicated by a window in the image. In this paper, we present an algorithm to perform the window operation of binary images represented by quadtrees, using three-dimensional $n{\times}n{\times}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\times}n{\times}n$ RMESH.

Constant Time Algorithms for Region Expansion and Scaling of Linear Quadtrees on RMESH (RMESH 구조에서 선형 사진트리의 영역 확장과 스케일링을 위한 상수시간 알고리즘)

  • Woo, Jin-Woon
    • The KIPS Transactions:PartA
    • /
    • v.11A no.3
    • /
    • pp.173-180
    • /
    • 2004
  • Quadtree, which 11 a hierarchical data structure, is a very important data structure to represent images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related to quadtrees. The region expansion is an operation to expand images by a given distance and the scaling If an operation to scale images by a given scale factor. In this paper, we present algorithms to perform the region expansion and scaling of images represented by quadtrees, using three-dimensional n${\times}$n${\times}$n processors on RMESH(Reconfigurable MESH). These algorithms have constant time complexities by using efficient basic operations to route the locational codes of quadtree on the hierarchical structure of n${\times}$n${\times}$n RMESH.

Constant Time Algorithm for Alignment of Unaligned Linear Quadtrees on RMESH (RMESH구조에서 unaligned 선형 사진트리의 alignment를 위한 상수시간 알고리즘)

  • 김경훈;우진운
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.10-18
    • /
    • 2004
  • Quadtree, which is a hierarchical data structure, is a very important data structure to represent binary images. The linear quadtree representation as a way to store a quadtree is efficient to save space compared with other representations. Therefore, it has been widely studied to develop efficient algorithms to execute operations related with quadtrees. The operations of unaligned linear quadtrees, which are operations among the linear quadtrees with different origin, are able to perform the translated or rotated images efficiently. And this operations requires alignment of the linear quadtrees. In this paper, we present an efficient algorithm to perform alignment of unaligned linear quadtrees, using three-dimensional $n{\pm}n{\pm}n$ processors on RMESH(Reconfigurable MESH). This algorithm has constant-time complexity by using efficient basic operations to route the locational codes of quardtree on the hierarchical structure of $n{\pm}n{\pm}n$ RMESH.

A Dynamic Path Computation Database Model in Mobile LBS System (모바일 LBS 시스템에서 동적 경로 계산 데이터베이스 모델)

  • Joo, Yong-Jin
    • Spatial Information Research
    • /
    • v.19 no.3
    • /
    • pp.43-52
    • /
    • 2011
  • Recently, interest in location-based service (LBS) which utilizes a DBMS in mobile system environment has been increasing, and it is expected to overcome the existing file-based system's limitation in advanced in-vehicle system by utilizing DBMS's advantages such as efficient storage, transaction management, modelling and spatial queries etc. In particular, the road network data corresponds to the most essential domain in a route planning system, which needs efficient management and maintenance. Accordingly, this study aims to develop an efficient graph-based geodata model for topological network data and to support dynamic path computation algorithm based on heuristic approach in mobile LBS system. To achieve this goal, we design a data model for supporting the hierarchy of network, and implement a path planning system to evaluate its performance in mobile LBS system. Last but not least, we find out that the designed path computation algorithm with hierarchical graph model reduced the number of nodes used for finding and improved the efficiency of memory.

Accuracy Analysis of Fixed Point Arithmetic for Hardware Implementation of Binary Weight Network (이진 가중치 신경망의 하드웨어 구현을 위한 고정소수점 연산 정확도 분석)

  • Kim, Jong-Hyun;Yun, SangKyun
    • Journal of IKEEE
    • /
    • v.22 no.3
    • /
    • pp.805-809
    • /
    • 2018
  • In this paper, we analyze the change of accuracy when fixed point arithmetic is used instead of floating point arithmetic in binary weight network(BWN). We observed the change of accuracy by varying total bit size and fraction bit size. If the integer part is not changed after fixed point approximation, there is no significant decrease in accuracy compared to the floating-point operation. When overflow occurs in the integer part, the approximation to the maximum or minimum of the fixed point representation minimizes the decrease in accuracy. The results of this paper can be applied to the minimization of memory and hardware resource requirement in the implementation of FPGA-based BWN accelerator.

A Quality Identification System for Molding Parts Using HTM-Based Sound Recognition (HTM 기반의 소리 연식을 이용한 부품의 양.불량 판별 시스템)

  • Bae, Sun-Gap;Han, Chang-Young;Seo, Dae-Ho;Kim, Sung-Jin;Bae, Jong-Min;Kang, Hyun-Syug
    • Journal of Korea Multimedia Society
    • /
    • v.13 no.10
    • /
    • pp.1494-1505
    • /
    • 2010
  • A variety of sounds take place in medium and small-sized manufactories producing many kinds of parts in a small quantity with one press. We developed the identification system for the quality of parts using HTM(Hierarchical Temporal Memory)-based sound recognition. HTM is the theory that the operation principle of human brain's neocortex is applied to computer, suggested by Jeff Hopkins. This theory memorizes temporal and spatial patterns hierarchically about the real world, which is known for its cognitive power superior to the previous recognition technologies in many cases. By applying the HTM model to the sound recognition, we developed the identification system for the quality of molding parts. In order to verify its performance we recorded the various sounds at the moment of producing parts in the real factory, constructed the HTM network of sound, and then identified the quality of parts by repeating learning and training. It reveals that this system gets an excellent and accurate results at the noisy factory.