• Title/Summary/Keyword: Node Architecture

Search Result 490, Processing Time 0.04 seconds

Bit-level Array Structure Representation of Weight and Optimization Method to Design Pre-Trained Neural Network (학습된 신경망 설계를 위한 가중치의 비트-레벨 어레이 구조 표현과 최적화 방법)

  • Lim, Guk-Chan;Kwak, Woo-Young;Lee, Hyun-Soo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.39 no.9
    • /
    • pp.37-44
    • /
    • 2002
  • This paper proposes efficient digital hardware design method by using fixed weight of pre-trained neural network. For this, arithmetic operations of PEs(Processing Elements) are represented with matrix-vector multiplication. The relationship of fixed weight and input data present bit-level array structure architecture which is consisted operation node. To minimize the operation node, this paper proposes node elimination method and setting common node depend on bit pattern of weight. The result of FPGA simulation shows the efficiency on hardware cost and operation speed with full precision. And proposed design method makes possibility that many PEs are implemented to on-chip.

Blockchain Technology and Utilization Schemes in Tactical Communication Network

  • Yoo, In-Deok;Lee, Woo-Sin;Kim, Hack-Joon;Jin, So-Yeon;Jo, Se-Hyeon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.12
    • /
    • pp.49-55
    • /
    • 2018
  • In this paper, we propose schemes of blockchain utilization in tactical communication environment. The military tactical communication environment has similar characteristics with blockchain network such as distributed architecture, decentralization, and the need for data integrity. A communication node constituting a tactical communication network is constituted by a system capable of configuring and connecting a network for each node. When a communication node, having such capabilities, is configured as a node of blockchain network, various functions could be performed. In this paper, we propose utilization schemes of authentication, integrity, record management, and privilege control based blockchain technology. Functions for authentication, integrity verification, and record management need to ensure the stored data and could track history. The requirement of function's characteristics are matched to blockchain which is storing data sequentially and difficult to hack data, so that it could perform functionally and sufficiently well. Functions for authority control should be able to assign different privileges according to the state of the requestor. Smart contract will function when certain conditions are satisfied and it will be able to perform its functions by using it. In this paper, we will look over functions and utilization schemes of blockchain technology which could reliably share and synchronize data in a tactical communication environment composed of distributed network environment.

A Case Study of Smart Node System by using 3D Printing Technology (3D 프린팅을 활용한 스마트노드 시스템의 적용 사례)

  • Na, Sangho;Lee, JangHyun;Park, YoungMi;Kim, SungJin
    • Proceedings of the Korean Institute of Building Construction Conference
    • /
    • 2021.05a
    • /
    • pp.6-7
    • /
    • 2021
  • 3D printing has the unique advantage of the ability to customize freeform products even in small quantities. It was recently applied successfully in the node connection system for the irregular shaped glass design of Gwanggyo Galleria Department Store. This was achieved by applying 3D printing technology for an innovative smart node design. The novel system offers flexibility to address various design challenges in addition to maximizing construction quality and reducing construction period. In this paper, we aim to examine the use of 3D printing based innovative technologies in the construction industry. With this aim in mind, we present the case of the Gwanggyo Galleria Department Store's smart nodes. The key objective of this study is creating awareness in the construction industry of the need to utilize fourth industrial revolution technology in architecture.

  • PDF

Scalable CC-NUMA System using Repeater Node (리피터 노드를 이용한 Scalable CC-NUMA 시스템)

  • Kyoung, Jin-Mi;Jhang, Seong-Tae
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.9
    • /
    • pp.503-513
    • /
    • 2002
  • Since CC-NUMA architecture has to access remote memory, the interconnection network determines the performance of the CC-NUMA system. Bus which has been used as a popular interconnection network has many limits in a large-scale system because of the limited physical scalability and bandwidth. The dual ring interconnection network, composed of high-speed point-to-point links, is made to resolve the defects of the bus for the large-scale system. However, it also has a problem, in that the response latency is rapidly increased when many nodes are attached to the snooping based CC-NUMA system with the dual ring. In this paper, we propose a ring architecture with repeater nodes in order to overcome the problem of the dual ring on a snooping based CC-NUMA system, and design a repeater node adapted to this architecture. We will also analyze the effects of proposed architecture on the system performance and the response latency by using a probability-driven simulator.

Routing considering Channel Contention in Wireless Communication Networks with Multiple Radios and Multiple Channels (다수 라디오와 채널을 갖는 무선통신망에서 채널경쟁을 고려한 라우팅)

  • Ko, Sung-Won;Kang, Min-Su;Kang, Nam-Hi;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.5
    • /
    • pp.7-15
    • /
    • 2007
  • In wireless communication networks, single-radio single-channel architecture degrades throughput and end-to-end delay due to half-duplex transmission of wireless node and route intra interference. Also, In contention-based MAC (Medium Access Control) architecture, channel contention reduces throughput and packet collision enlarges end-to-end delay. In this paper, we use multi-radio multi-channel architecture which will make wireless node to operate in full duplex mode, and exclude route intra interference. Based on this architecture, we propose a new link metric, ccf which reflects the characteristics of a contention-based wireless link, and propose a routing path metric MCCR considering channel switching delay and route intra interference. MCCR is compared with MCR by simulation, the performance of a route established by MCCR outperforms the performance of a route by MCR in terms of throughput and end-to-end delay.

A Tunable Transmitter - Tunable Receiver Algorithm for Accessing the Multichannel Slotted-Ring WDM Metropolitan Network under Self-Similar Traffic

  • Sombatsakulkit, Ekanun;Sa-Ngiamsak, Wisitsak;Sittichevapak, Suvepol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.777-781
    • /
    • 2004
  • This paper presents an algorithm for multichannel slotted-ring topology medium access protocol (MAC) using in wavelength division multiplexing (WDM) networks. In multichannel ring, there are two main previously proposed architectures: Tunable Transmitter - Fixed Receiver (TTFR) and Fixed Transmitter - Tunable Receivers (FTTR). With TTFR, nodes can only receive packets on a fixed wavelength and can send packets on any wavelengths related to destination of packets. Disadvantage of this architecture is required as many wavelengths as there are nodes in the network. This is clearly a scalability limitation. In contrast, FTTR architecture has advantage that the number of nodes can be much larger than the number of wavelength. Source nodes send packet on a fixed channel (or wavelength) and destination nodes can received packets on any wavelength. If there are fewer wavelengths than there are nodes in the network, the nodes will also have to share all the wavelengths available for transmission. However the fixed wavelength approach of TTFR and FTTR bring low network utilization. Because source node with waiting data have to wait for an incoming empty slot on corresponding wavelength. Therefore this paper presents Tunable Transmitter - Tunable Receiver (TTTR) approach, in which the transmitting node can send a packet over any wavelengths and the receiving node can receive a packet from any wavelengths. Moreover, the self-similar distributed input traffic is used for evaluation of the performance of the proposed algorithm. The self-similar traffic performs better performance over long duration than short duration of the Poison distribution. In order to increase bandwidth efficiency, the Destination Stripping approach is used to mark the slot which has already reached the desired destination as an empty slot immediately at the destination node, so the slot does not need to go back to the source node to be marked as an empty slot as in the Source Stripping approach. MATLAB simulator is used to evaluate performance of FTTR, TTFR, and TTTR over 4 and 16 nodes ring network. From the simulation result, it is clear that the proposed algorithm overcomes higher network utilization and average throughput per node, and reduces the average queuing delay. With future works, mathematical analysis of those algorithms will be the main research topic.

  • PDF

LDPC Decoder Architecture for High-speed UWB System (고속 UWB 시스템의 LDPC 디코더 구조 설계)

  • Choi, Sung-Woo;Lee, Woo-Yong;Chung, Hyun-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.3C
    • /
    • pp.287-294
    • /
    • 2010
  • MB-OFDM UWB system will adopt LDPC codes to enhance the decoding performance with higher data rates. In this paper, we will consider algorithm and architecture of the LDPC codes in MB-OFDM UWB system. To suggest the hardware efficient LDPC decoder architecture, LLR(log-likelihood-ration) calculation algorithms and check node update algorithms are analyzed. And we proposed the architecture of LDPC decoder for the high throughput application of Wimedia UWB. We estimated the feasibility of the proposed architecture by implementation in a FPGA. The implementation results show our architecture attains higher throughput than other result of QC-LDPC case. Using this architecture, we can implement LDPC decoder for high throughput transmission, but it is 0.2dB inferior to the BP algorithm.

On Reducing False Positives of a Bloom Filter in Trie-Based Algorithms

  • Mun, Ju Hyoung;Lim, Hyesook
    • IEIE Transactions on Smart Processing and Computing
    • /
    • v.4 no.3
    • /
    • pp.163-168
    • /
    • 2015
  • Many IP address lookup approaches employ Bloom filters to obtain a high-speed search performance. Especially, it has been recently studied that the search performance of trie-based algorithms can be significantly improved by adding Bloom filters. In such algorithms, the number of trie accesses can be greatly reduced because Bloom filters can determine whether a node exists in a trie without actually accessing the trie. Bloom filters do not have false negatives but have false positives. False positives can lead to unnecessary trie accesses. The false positive rate must thus be reduced to enhance the performance of lookup algorithms applying Bloom filters. One important characteristic of trie-based algorithms is that all the ancestors of a node are also stored. The proposed algorithm utilizes this characteristic in reducing the false positive rate of a Bloom filter without increasing the size of the memory for the Bloom filter. When a Bloom filter produces a positive result for a node of a trie, we propose to check whether the ancestors of the node are also positives. Because Bloom filters have no false negatives, the negatives of any of the ancestors mean that the positive of the node is false. In other words, we propose to use more Bloom filter queries to reduce the false positive rate of a Bloom filter in trie-based algorithms. Simulation results show that querying one ancestor of a node can reduce the false positive rate by up to 67% with exactly the same architecture and the same memory requirement. The proposed approach can be applied to other trie-based algorithms employing Bloom filters.

Design and Implementation of Low-Power Transcoding Servers Based on Transcoding Task Distribution (트랜스코딩 작업의 분배를 활용한 저전력 트랜스코딩 서버 설계 및 구현)

  • Lee, Dayoung;Song, Minseok
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.15 no.4
    • /
    • pp.18-29
    • /
    • 2019
  • A dynamic adaptive streaming server consumes high processor power because it handles a large amount of transcoding operations at a time. For this purpose, multi-processor architecture is mandatory for which effective transcoding task distribution strategies are essential. In this paper, we present the design and implementation details of the transcoding workload distribution schemes at a 2-tier (frontend node and backend node) transcoding server. For this, we implemented four schemes: 1) allocation of transcoding tasks to appropriate back-end nodes, 2) task scheduling in the back-end node and 3) the communication between front-end and back-end nodes. Experiments were conducted to compare the estimated and the actual power consumption in a real testbed to verify the efficacy of the system. It also proved that the system can reduce the load on each node to optimize the power and time used for transcoding.