• Title/Summary/Keyword: virtual link

Search Result 214, Processing Time 0.027 seconds

A Method of Embedded Linux Light-Weight for Efficient Application Execution (어플리케이션 처리속도 개선을 위한 임베디드 리눅스 경량화 기법)

  • Lee, Tae-Woo;Cho, Ji-Yong;Cho, Yong-Hwan
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.3
    • /
    • pp.1-10
    • /
    • 2013
  • In this paper, we propose a method of embedded linux light-weight to improve efficiency of application running on embedded systems. Three methods including fast booting scheme applying the Hibernation technique, JFFS2 file system optimization applying the Symbolic Link and virtual address mapping, kernel light-weight that guarantees the general purpose was applied. Since then check the system dependency and generate kernel image according to the target embedded kit. And embedded system performance of existing linux and linux which the method proposed in this paper was compared. In experimental result, the kernel size was 9.6% improved and the system booting time was 18% improved. And application processing speed on target embedded kit was improved 11% in the best case, 66% in the worst case. This result show that the light-weight method proposed in this paper is guarantee fast booting time and securing resources and it is good for the application processing speed improvement.

A Study on Traffic Big Data Mapping Using the Grid Index Method (그리드 인덱스 기법을 이용한 교통 빅데이터 맵핑 방안 연구)

  • Chong, Kyu Soo;Sung, Hong Ki
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.19 no.6
    • /
    • pp.107-117
    • /
    • 2020
  • With the recent development of autonomous vehicles, various sensors installed in vehicles have become common, and big data generated from those sensors is increasingly being used in the transportation field. In this study, we proposed a grid index method to efficiently process real-time vehicle sensing big data and public data such as road weather. The applicability and effect of the proposed grid space division method and grid ID generation method were analyzed. We created virtual data based on DTG data and mapped to the road link based on coordinates. As a result of analyzing the data processing speed in grid index method, the data processing performance improved by more than 2,400 times compared to the existing link unit processing method. In addition, in order to analyze the efficiency of the proposed technology, the virtually generated data was mapped and visualized.

Correlation of Jacques Lacan's Mirror Stage and the process of Remediation on Image Media (쟈크 라캉의 거울단계와 영상미디어의 매개과정과의 연관성)

  • Ahn, Sang-Hyuk
    • Archives of design research
    • /
    • v.18 no.4 s.62
    • /
    • pp.147-154
    • /
    • 2005
  • In this paper, I am going to analyze a correlation of Jacques Lacan's Mirror Stage and the process of remediation on image media. It is because the remediation process of various digital media is letting people pass through one time of mirror stage again. Remediation for the Internet of traditional media, conflict with the virtual world and real world, identification that a virtual image changes a practical image is for it to be caused a remediation process by mutual link of various image media. The Narcissism which occurs in the relation a self with a idealized self searches a new own expression and forms a skillful mania culture. Reflexivity of active mania culture same as a Jacques Lacan's Mirror Stage is to be the possibility becoming the feature of media culture of today. However, if digital media culture generation spends extremely wasting time from the image media, these image media generations cannot grow into new future-type man. According to this, it is necessory to have a study on Visual Literacy that it is related to a Jacques Lacan's Mirror Stage.

  • PDF

Failure Detection and Resilience in HRing Overlay Network (HRing 오버레이 네트워크에서 실패 탐지 및 회복)

  • Gu, Tae-Wan;Lee, Kwang-Mo
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.21-33
    • /
    • 2007
  • An overlay network is a virtual network which is constructed on top of a physical computer network. A node in the overlay network is connected through virtual or logical links, where each link corresponds to a path of the links in the underlying physical network. Overlay networks are suitable for sharing heterogeneous resources in distributed environments, However, overlay networks are limited for achieving reliable communication that failure detection in overlay networks is a very important issue. In this paper, we review conditions of conventional failure detection and propose a new approach to failure detection and resilience which can be applied to HRing (Hierarchical Ring) overlay networks. The proposed method consists of the failure detection and the failure resilience phases. Because it utilizes the characteristics of the HRing overlay network for failure detection, it can reduce unnecessary network traffic and provide better scalability and flexibility. We also analyzed and evaluated the performance of the proposed approach through simulations.

  • PDF

Characteristic of the Class Library for Embedded Java System (내장형 자바 시스템을 위한 클래스 라이브러리의 특성)

  • 양희재
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.4
    • /
    • pp.788-797
    • /
    • 2003
  • Class library is one of the most crucial element of Java runtime environment in addition to Java virtual machine. In particular, embedded Java system depends heavily on the class library due to having a low bandwidth communication link and a small amount of memory which are a common restriction of embedded system. It is therefore quite necessary to find the characteristic of the class library for embedded Java system to build an efficient Java runtime environment. In this paper we have analyzed the characteristic of the class library for embedded system. The analysis includes sorts of classes in the library, typical size of the file which contains the class, and the composition of constant pool which is a major part of the file. We also have found typical number of field and method a class contains, the sizes of stack and local variable array each method requires, and the length of bytecode in the method. The result of this study can be used to estimate the startup time for class loading and the size of memory to create an instance of class which are a mandatory information to design an efficient embedded Java virtual machine.

Kinematic and Structural Analysis of a 6-DOF Manipulator for Narrow-space Work (협소 공간 작업을 위한 6축 다관절 로봇의 기구학 및 구조해석)

  • Chung, Seong Youb;Choi, Du-Soon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.3
    • /
    • pp.666-672
    • /
    • 2017
  • Our research team is developing a 6-DOF manipulator for narrow workspaces in press forming processes, such as placing PEM nuts on the bottom of a chassis. In this paper, kinematic analysis was performed for the position control of the manipulator, along with structural analyses for position accuracy with different payloads. First, the Denavit-Hatenberg (DH) parameters are defined, and then the forward and backward kinematic equations are presented using the DH parameters. The kinematic model was verified by visual simulation using Coppelia Robotics' virtual robot experimentation platform (V-REP). Position accuracy analysis was performed through structural analyses of deflection due to self-weight and deflection under full payload (5 kgf) in fully opened and fully folded states. The maximum generated stress was 22.05 MPa in the link connecting axes 2 and 3, which was confirmed to be structurally safe when considering the materials of the parts.

Low-Latency Programmable Look-Up Table Routing Engine for Parallel Computers (병렬 컴퓨터를 위한 저지연 프로그램형 조견표 경로지정 엔진)

  • Chang, Nae-Hyuck
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.2
    • /
    • pp.244-253
    • /
    • 2000
  • Since no single routing-switching combination performs the best under various different types of applications, a flexible network is required to support a range of polices. This paper introduces an implementation of a look-up table routing engine offering flexible routing and switching polices without performance degradation unlike those based on microprocessors. By deciding contents of look-up tables, the engine can implement wormhole routing, virtual cut-through routing, and packet switching, as well as hybrid switching, under a variety of routing algorithms. Since the routing engine has a piplelined look-up table architecture, the routing delay is as small as one flit, and thus it can overlap multiple routing actions without performance degradation in comparison with hardwired routers dedicated to a specific policy. Because four pipeline stages do not induce a hazard, expensive forwarding logic is not required. The routing engine can accommodate four physical links with a time shared cut-through bus or single link with a cross-bar switch. It is implemented using Xilinx 4000 series FPGA.

  • PDF

Improvement of High-Availability Seamless Redundancy (HSR) Traffic Performance for Smart Grid Communications

  • Nsaif, Saad Allawi;Rhee, Jong Myung
    • Journal of Communications and Networks
    • /
    • v.14 no.6
    • /
    • pp.653-661
    • /
    • 2012
  • High-availability seamless redundancy (HSR) is a redundancy protocol for Ethernet networks that provides two frame copies for each frame sent. Each copy will pass through separate physical paths, pursuing zero fault recovery time. This means that even in the case of a node or a link failure, there is no stoppage of network operations whatsoever. HSR is a potential candidate for the communications of a smart grid, but its main drawback is the unnecessary traffic created due to the duplicated copies of each sent frame, which are generated and circulated inside the network. This downside will degrade network performance and might cause network congestion or even stoppage. In this paper, we present two approaches to solve the above-mentioned problem. The first approach is called quick removing (QR), and is suited to ring or connected ring topologies. The idea is to remove the duplicated frame copies from the network when all the nodes have received one copy of the sent frame and begin to receive the second copy. Therefore, the forwarding of those frame copies until they reach the source node, as occurs in standard HSR, is not needed in QR. Our example shows a traffic reduction of 37.5%compared to the standard HSR protocol. The second approach is called the virtual ring (VRing), which divides any closed-loop HSR network into several VRings. Each VRing will circulate the traffic of a corresponding group of nodes within it. Therefore, the traffic in that group will not affect any of the other network links or nodes, which results in an enhancement of traffic performance. For our sample network, the VRing approach shows a network traffic reduction in the range of 67.7 to 48.4%in a healthy network case and 89.7 to 44.8%in a faulty network case, compared to standard HSR.

HeNB-Aided Virtual-Handover for Range Expansion in LTE Femtocell Networks

  • Tang, Hao;Hong, Peilin;Xue, Kaiping
    • Journal of Communications and Networks
    • /
    • v.15 no.3
    • /
    • pp.312-320
    • /
    • 2013
  • Home evolved Node-B (HeNB), also called a femtocell or a femto base station, is introduced to provide high data rate to indoor users. However, two main problems arise in femtocell networks: (1) Small coverage area of HeNB, which results in limited cell-splitting gain and ping-pong handover (HO) problems and (2) high inter-femtocell interference because HeNBs may be densely deployed in a small region. In this study, an efficient cooperation mechanism called an HeNB-aided virtual-HO (HaVHO) scheme is proposed to expand the coverage area of femtocells and to reduce inter-femtocell interference. The cooperation among neighbor HeNBs is exploited in HaVHO by enabling an HeNB to relay the data of its neighbor HeNB without an HO. The HaVHO procedure is compatible with the existing long term evolution specification, and the information exchange overhead in HaVHO is relatively low. To estimate the signal to interference plus noise ratio improvement, the area average channel state metric is proposed, and the amount of user throughput enhancement by HaVHO is derived. System-level simulation shows that HaVHO has a better performance than the other four schemes, such as lesser radio link failure, lesser ping-pong handover, lesser short-stay handover, and higher user throughput.

Development of a Packet-Switched Public computer Communication Network -PART 2: KORNET Design and Development of Network Node Processor(NNP) (Packet Switching에 의한 공중 Computer 통신망 개발 연구 -제2부: KORNET의 설계 및 Network Node Processor(NNP)의 개발)

  • 조유제;김희동
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.6
    • /
    • pp.114-123
    • /
    • 1985
  • This is the second part of the four-part paper describing the development of a packet-switched computer network named the cORNET In this paper, following the first par paper that describes the concepts of the KORNET and the development of the network management center (NMC), wc present the design of the KORNET and the development of the network node processor (NNP) The initial configuration of the KORNET consists of three NNP's and one NMC. We have developed each NNP as a microprocessor-based (Mc68000) multiprocessor system, and implemented the NMC using a super-mini computer (Mv/8000) For the KORNET we use the virtual circuit (VC) method as the packet service strategy and the distributed adaptive routing algorithm to adapt efficiently the variation of node and link status. Also, we use a dynamic buffer management algorithm for efficient storage management. Thc hardware of the NNP system has been designed with emphasis on modularity so that it may be expanded esily . Also, the software of the NNP system has been developed according to the CCITT recommendations X.25, X.3, X.28 and X.29.

  • PDF