• Title/Summary/Keyword: Network Processors

Search Result 199, Processing Time 0.025 seconds

Structure of Communication Path Between Processors in ATM Switching System and its Test (ATM 교환기에서 제어계간 통신 경로 구성 및 시험)

  • 김영섭;한용민;김철규;전만영;박홍식
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.32A no.9
    • /
    • pp.1202-1208
    • /
    • 1995
  • Inter-processor communication is required to manage resources in ATM switching system where processors are distributed. ATM switching system, which was developed in our institute, does't have dedicated communication path for inter-processor communication, but use the ordinary switching network same as user data. Therefore, we should test communication paths and equipments before running various application software programs. In this paper, we propose a method to test communication paths between processors in ATM switching system and describe an implemented program using this method.

  • PDF

Multiple Installment Load Distribution Algorithm for Data Sets (균일한 길이 데이터 집합의 분할분배방식)

  • Kim, Hee-Won;Kim, Hyoung Joong;Lee, Jung-Moon
    • Journal of Industrial Technology
    • /
    • v.15
    • /
    • pp.33-40
    • /
    • 1995
  • This paper presents a new method for load distribution in a single-level tree network equipped with front-end processors. This method focuses on effective data distribution over a number of processors minimize job processing time. Optimal multiple installment load distribution algorithm is presented. Minimum number of processors that maximizes efficiency is decided theoretically.

  • PDF

A domain decomposition method applied to queuing network problems

  • Park, Pil-Seong
    • Communications of the Korean Mathematical Society
    • /
    • v.10 no.3
    • /
    • pp.735-750
    • /
    • 1995
  • We present a domain decomposition algorithm for solving large sparse linear systems of equations arising from queuing networks. Such techniques are attractive since the problems in subdomains can be solved independently by parallel processors. Many of the methods proposed so far use some form of the preconditioned conjugate gradient method to deal with one large interface problem between subdomains. However, in this paper, we propose a "nested" domain decomposition method where the subsystems governing the interfaces are small enough so that they are easily solvable by direct methods on machines with many parallel processors. Convergence of the algorithms is also shown.lso shown.

  • PDF

A Study on Sorting in A Computer Using The Binary Multi-level Multi-access Protocol

  • Jung Chang-Duk
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2006.06a
    • /
    • pp.303-310
    • /
    • 2006
  • The sorting algorithms have been developed to take advantage of distributed computers. But the speedup of parallel sorting algorithms decrease rapidly with increased number of processors due to parallel processing overhead such as context switching time and inter-processor communication cost. In this paper, we propose a parallel sorting method which provides linear speedup of an optimal serial algorithm for a system with a large number of processors. This algorithm may even provide superlinear speedup for a practical system. The algorithm takes advantage of an interconnection network properties and its protocol.

  • PDF

A Low Power Asynchronous MSP430 Processor for Ubiquitous Sensor Network (편재형 센서네트워크 노드를 위한 저전력 비동기 MSP430 프로세서)

  • Shin, Chi-Hoon;Shang, Belong;Oh, Myeong-Hoon;Kim, Young-Woo;Kim, Sung-Nam;Yakovlev, Alex;Kim, Sung-Woon
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.451-453
    • /
    • 2007
  • This paper describes the design of an asynchronous implementation of a sensor network processor. The main purpose of this work is the reduction of power consumption in sensor network node processors and the research presented here tries to explore the suitability of asynchronous circuits for this purpose. The Handshake Solutions toolkit is used to implement an asynchronous version of a sensor processor. The design is made compact, trading area and leakage power savings with dynamic power costs, targeting the typical sparse operating characteristics of sensor node processors. It is then compared with a synchronous version of the same processor. Both versions are then compared with existing commercial processors in terms of power consumption.

  • PDF

Study of Modular Multiplication Methods for Embedded Processors

  • Seo, Hwajeong;Kim, Howon
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.3
    • /
    • pp.145-153
    • /
    • 2014
  • The improvements of embedded processors make future technologies including wireless sensor network and internet of things feasible. These applications firstly gather information from target field through wireless network. However, this networking process is highly vulnerable to malicious attacks including eavesdropping and forgery. In order to ensure secure and robust networking, information should be kept in secret with cryptography. Well known approach is public key cryptography and this algorithm consists of finite field arithmetic. There are many works considering high speed finite field arithmetic. One of the famous approach is Montgomery multiplication. In this study, we investigated Montgomery multiplication for public key cryptography on embedded microprocessors. This paper includes helpful information on Montgomery multiplication implementation methods and techniques for various target devices including 8-bit and 16-bit microprocessors. Further, we expect that the results reported in this paper will become part of a reference book for advanced Montgomery multiplication methods for future researchers.

Parallel implementations and their performance evaluations of a SOFM neural network on the multicomputer (다중컴퓨터망에서 SOFM 신경회로망의 병렬구현 및 성능평가)

  • 김선종;최흥문
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.10
    • /
    • pp.90-97
    • /
    • 1996
  • This paper presents an efficient parallel implementation and its performance evaluations of a SOFM neural netowrk on the multicomputer. We investigate the parallel performance as the size of a neural network N, the number of the patterns L, and the number of the processors p increase. We propose an analytica performance evaluation model for eac of the parallel implementations and verified the validity of the model through experiments. Analytical result show that the number of processors for a maximum speedup of the network decomposition nd the training-set decomposition increases in proportion to .root.N and .root.L, respectively. The performances of the both decompositions depend on the number of training patterns L and the size of the neural network N and, if L.geq.0.423N, the performance of trhe training-set decomposition is proved to be better than that of the network decomposition.

  • PDF

An on-line non-invasive network monitor for the SPAX parallel computer (SPAX 병렬 컴퓨터에서의 온라인 무간섭 네트워크 성능 감시기)

  • 이승구
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.34C no.6
    • /
    • pp.44-50
    • /
    • 1997
  • This paper describes the design and test of an on-line non-invasive network performance monitor (hardware portion) for the SPAX parallel computer. The SPAX parallel computer supports up to 256 intel P6 processors with 4 P6 processors constituting a processign node. The nodes are interconnected with a dual two-level crossbar network calle dXcent-net. Since the performance of the SPAX parallel computer is highly dependent on the proper and efficient operation of the network, an on-line non-invasive network performance monitor (with hardware components) has been developed to aid in the monitoring and tunign of the Xcent-net. Successful testing of a prototype node monitor board and PC interface system shows that our monitor design provides a low-cost practical solution to this problem.

  • PDF

An Efficient Distributed Algorithm to Solve Breadth-First spanning Tree Updating Problem (너비 우선 신장 트리 갱신문제를 위한 분산알고리즘)

  • Park, Jung-Ho;Park, Yoon-Young;Hwang, Suk-Hyung
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1370-1376
    • /
    • 2000
  • Consider the problem to updata breadth-First Spanning Tree in response to topology change of the network. The paper proposes an efficient distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(p√q+q+a+n') respectively, where n' is the number fo processors in the network after the topology change, a is the number of added links, p is the total number of links in the biconnected component (of the network before the topology change) including the detected links or added links, and q is the total number of processors in the biconnected component (of the network before the topology change) including the deleted links or added links, and q is the total number of processors in the biconnected component including the deleted links or added links.

  • PDF

Design and implementation of an Embedded Network Processor (내장형 네트워크 프로세서의 설계 및 구현)

  • Joung Jinoo;Kim Seong-cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.6
    • /
    • pp.1211-1217
    • /
    • 2005
  • Current generation embedded systems are built around only a small number of SOCs, which are again based on general-purpose embedded micro-processors, such as ARM and MIPS. These RISC-based processors are not, however, designed for specific functions such as networking and multimedia processing, whose importances have increased dramatically in recent years. Network devices for small business and home networks, are especially dependent upon such SOCs based on general processors. Except for PHY and MAC layer functions, which are built with hardware, all the network functions are processed by the embedded micro-processor. Enabling technologies such as VDSL and FTTH promise Internet access with a much higher speed, while at the same time explore the limitations of general purpose microprocessors. In this paper we design a network processor, embed it into an SOC for Home gateway, evaluate the performance rigorously, and gauge a possibility for commercialization.