• Title/Summary/Keyword: dynamically reconfigurable

Search Result 40, Processing Time 0.022 seconds

Expansible & Reconfigurable Neuro Informatics Engine : ERNIE (대규모 확장이 가능한 범용 신경망 연산기 : ERNIE)

  • 김영주;동성수;이종호
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.40 no.6
    • /
    • pp.56-68
    • /
    • 2003
  • Difficult problems In implementing digital neural network hardware are the extension of synapses and the programmability for relocating neurons. In this paper, the structure of a new hardware is proposed for solving these problems. Our structure based on traditional SIMD can be dynamically and easily reconfigured connections of network without synthesizing and mapping original design for each use. Using additional modular processing unit the numbers of neurons find synapses increase. To show the extensibility of our structure, various models of neural networks : multi-layer perceptrons and Kohonen network are formed and tested. The performance comparison with software simulation shows its superiority in the aspects of performance and flexibility.

Simulator for Dynamic 2/3-Dimensional Switching of Computing Resources

  • Ki, Jang-Geun;Kwon, Kee-Young
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.3
    • /
    • pp.9-17
    • /
    • 2020
  • In this paper, as part of the research for the infrastructure of very high flexible and reconfigurable data center using very high speed crossbar switches, we developed a simulator that can model two and three dimensional connection structure of switches with an efficient control algorithm using software defined network and verified the functions and analyzed the performance accordingly. The simulator consists of a control module and a switch module that was coded using Python language based on the Mininet and Ryu Openflow frameworks. The control module dynamically controls the operation of switching cells using a shortest multipath algorithm to calculate efficient paths adaptively between configurable computing resources. Performance analysis by using the simulator shows that the three-dimensional switch architecture can accommodate more hosts per port and has about 1.5 times more successful 1:n connections per port with the same number of switches than the two-dimensional architecture. Also simulation results show that connection length in a 3-dimensional way is shorter than that of 2-dimensional way and the unused switch ratio in a 3-dimensional case is lower than that of 2-dimensional cases.

A Software Architecture for High-speed PCE (Path Computation Element) Protocol (고성능 PCE (Path Computation Element) 프로토콜 소프트웨어 구조)

  • Lee, Wonhyuk;Kim, Seunhae;Kim, Hyuncheol
    • Convergence Security Journal
    • /
    • v.13 no.6
    • /
    • pp.3-9
    • /
    • 2013
  • With the rapidly changing information communication environment and development of technologies, the informati on networks are evolved from traditional fixed form to an active variable network that flexible large variety of data can be transferred. To reflect the needs of users, the next generation using DWDM (Dense Wavelength Division M ultiplexing) transmission system and OXC (Optical Cross Connect) form a dynamic network. After that GMPLS (Ge neralized Multi-Protocol Label Switching) can be introduced to dynamically manage and control the Reconfigurable Optical Add-drop Multiplexer (ROADM)/Photonic Cross Connect (PXC) based network. This paper propose a softw are architecture of Path Computation Element (PCE) protocol that has proposed by Internet Engineering Task Force (IETF) to path computation. The functional blocks and Application Programming Interface (API) of the PCE protoco l implementation are also presented.

Dynamic Reconfigurable Integrated Management and Monitoring System for Heterogeneous Distributed Environments (이기종 분산 환경에서 동적 재구성이 가능한 통합 관리 및 모니터링 시스템)

  • Min, Bup-Ki;Seo, Yongjin;Kim, Hyeon Soo;Kuk, Seunghak;Jung, Yonghwan;Kim, Chumsu
    • Journal of Internet Computing and Services
    • /
    • v.13 no.6
    • /
    • pp.63-74
    • /
    • 2012
  • In this paper, we develop an integrated management/monitoring system that supports to dynamically reconfigure information models for systems or applications managed by heterogeneous distributed systems. When the subsystems on diverse platforms are added, removed, or modified, the altered configurations should conform to the configuration information of the integrated management/monitoring system. Further, upon the system configurations being changed, the altered system configurations should be synchronized with the information on the integrated management/monitoring system. Moreover, availability should be assured during synchronization to the extent that users can access the monitoring information with no system halting. This paper focuses on notifying the integrated management/monitoring system of any changes in hardware/software configurations on any subsystems under its management, and on dynamically re-configuring the information about hardware and software being managed based on the information notified. Finally, we expect that this research will be contributory to carrying out reliable integrated management by reflecting the information on any heterogeneous distributed systems in the integrated management/monitoring system.

An Adaptive Flooding Scheme using N-hop Look-ahead in MANET (MANET에서 N-hop 사전조사를 이용한 적응적인 플러딩 기법)

  • Jong, Jong-Hyeok;Oh, Im-Geol
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.11 no.4
    • /
    • pp.32-39
    • /
    • 2006
  • MANET is a dynamically reconfigurable wireless network with no fixed infrastructure (base station, or AP). In order to provide the data service in MANET, we need an efficient routing protocol to deliver the data to the wanted destination at a mobile node. A method of routing protocols called reactive routing protocol has recently got attention because of their low routing overhead. But a method of flooding broadcasts the packet to all of its neighbors. For this reason, each of the node has high routing overhead to route and keep path discovery. Accordingly in this paper, I propose an adaptive flooding scheme using N-hop look-ahead in MANET, md an optimal N value of doing flooding the packet to limited area. Because of being basically ignorant about topological changes, each of the node did not spontaneously cope with path alteration. But an efficient flooding scheme applying N-hop look-ahead is more resilient to topology changes than traditional algorithms. And also with this efficient flooding scheme, the simulation results demonstrate excellent reduction of routing overhead.

  • PDF

Scalable and Dynamically Reconfigurable Internet Service System Based on Clustered System (확장과 동적재구성 가능한 클러스터기반의 인터넷서비스 시스템)

  • Kim Dong Keun;Park Se Myung
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.10
    • /
    • pp.1400-1411
    • /
    • 2004
  • Recently, explosion of internet user requires fundamental changes on the architecture of Web service system, from single server system to clustered server system, in parallel with the effort for improving the scalability of the single internet server system. But current cluster-based server systems are dedicated to the single application, for example, One-IP server system. One-IP server system has a clustered computing node with the same function and tries to distribute each request based on the If to the clustered node evenly. In this paper, we implemented the more useful application service platform. It works on shared clustered server(back-end server) with an application server(front-end server) for a particular service. An application server provides a particular service at a low load by itself, but as the load increases, it reconfigures itself with one or more available server from the shared cluster and distributes the load on selected server evenly We used PVM for an effective management of the clustered server. We found the implemented application service platform provides more stable and scalable operation characteristics and has remarkable performance improvement on the dynamic load changes.

  • PDF

Geographic and Energy Aware Geocasting in Ad-Hoc Networks (Ad-Hoc 네트워크에서 위치와 에너지를 고려한 지오캐스팅 알고리즘)

  • Lee Ju-Young
    • Journal of Internet Computing and Services
    • /
    • v.5 no.2
    • /
    • pp.75-84
    • /
    • 2004
  • Geocasting, a variant of the conventional multicasting problem, is one of communication type in which the data packets are delivered to a group of all nodes within a specified geographical region (i.e., the geocasting region) and is called location-based multicasting(LBM)(l). An Ad-hoc network is a dynamically reconfigurable and temporary wireless network where all mobile devices using batteries as energy resources cooperatively maintain network connectivity without central administration or the assistance of base stations. Consequently, the technique to efficiently consume the limited amounts of energy resources is an important problem so that the system lifetime is maximized. In this paper, we propose a LBPA(Location-Based Power Aware) geocasting algorithm that selects energy-aware neighbor to route a packet towards the target region In Ad-hoc network environments. The method Is such that the energy consumption is balanced among the nodes in proportion to their energy reserves. Through the simulations, the proposed LBPA algorithm shows better results, that is, as good as 40% on the average over the conventional LBM algorithm in terms of the network lifetime.

  • PDF

A Geographic Routing Algorithm to Prolong the Lifetime of MANET (MANET에서의 네트워크 수명을 연장시키는 위치기반 라우팅 기법)

  • Lee, Ju-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.19 no.2
    • /
    • pp.119-125
    • /
    • 2010
  • In ad-hoc networks, dynamically reconfigurable and temporary wireless networks, all mobile devices cooperatively maintain network connectivity with no assistance of base stations while they have limited amounts of energy that is used in different rates depending on the power level. Since every node has to perform the functions of a router, if some nodes die early due to lack of energy, it will not be possible for other nodes to communicate with each other and network lifetime will be shortened. Consequently, it is very important to develop a technique to efficiently consume the limited amounts of energy resources so that the network lifetime is maximized. In this paper, geographical localized routing is proposed to help making smarter routing decision using only local information and reduce the routing overhead. The proposed localized routing algorithm selects energy-aware neighbors considering the transmission energy and error rate over the wireless link, and the residual energy of the node, which enables nodes to achieve balanced energy-consumption and the network lifetime to prolong.

An Efficient WLAN Device Power Control Technique for Streaming Multimedia Contents over Mobile IP Storage (모바일 IP 스토리지 상에서 멀티미디어 컨텐츠 실행을 위한 효율적인 무선랜 장치 전력제어 기법)

  • Nam, Young-Jin;Choi, Min-Seok
    • The KIPS Transactions:PartA
    • /
    • v.16A no.5
    • /
    • pp.357-368
    • /
    • 2009
  • Mobile IP storage has been proposed to overcome storage limitation in the flash memory and hard disks. It provides almost capacity-free space for mobile devices over wireless IP networks. However, battery lifetime of the mobile devices is reduced rapidly because of power consumption with continuous use of a WLAN device when multimedia contents are being streamed through the mobile IP storage. This paper proposes an energy-efficient WLAN device power control technique for streaming multimedia contents with the mobile IP storage. The proposed technique consists of a prefetch buffer input/output module, a WLAN device power control module, and a reconfigurable prefetch buffer module. Besides, it adaptively determines the size of the prefetch buffer according to a quality of the multimedia contents, and it dynamically controls the power mode of the WLAN device on the basis of power on-off operations while streaming the multimedia contents. We evaluate the performance of the proposed technique on a PXA270-based mobile device that employs the embedded linux 2.6.11, Intel iSCSI reference codes, and a WLAN device. Extensive experiments reveal that the proposed technique can save the energy consumption of the WLAN device up to 8.5 times with QVGA multimedia contents, as compared with no power control.

Core-aware Cache Replacement Policy for Reconfigurable Last Level Cache (재구성 가능한 라스트 레벨 캐쉬 구조를 위한 코어 인지 캐쉬 교체 기법)

  • Son, Dong-Oh;Choi, Hong-Jun;Kim, Jong-Myon;Kim, Cheol-Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.11
    • /
    • pp.1-12
    • /
    • 2013
  • In multi-core processors, Last Level Cache(LLC) can reduce the speed gap between the memory and the core. For this reason, LLC has big impact on the performance of processors. LLC is composed of shared cache and private cache. In computer architecture community, most researchers have mainly focused on the management techniques for shared cache, while management techniques for private cache have not been widely researched. In conventional private LLC, memory is statically assigned to each core, resulting in serious performance degradation when the workloads are not fairly distributed. To overcome this problem, this paper proposes the replacement policy for managing private cache of LLC efficiently. As proposed core-aware cache replacement policy can reconfigure LLC dynamically, hit rate of LLC is increases drastically. Moreover, proposed policy uses 2-bit saturating counters to improve the performance. According to our simulation results, the proposed method can improve hit rates by 9.23% and reduce the access time by 12.85% compared to the conventional method.