• Title/Summary/Keyword: 스택설계

Search Result 239, Processing Time 0.022 seconds

Analyzing the Overhead of the Memory Mapped File I/O for In-Memory File Systems (메모리 파일시스템에서 메모리 매핑을 이용한 파일 입출력의 오버헤드 분석)

  • Choi, Jungsik;Han, Hwansoo
    • KIISE Transactions on Computing Practices
    • /
    • v.22 no.10
    • /
    • pp.497-503
    • /
    • 2016
  • Emerging next-generation storage technologies such as non-volatile memory will help eliminate almost all of the storage latency that has plagued previous storage devices. In conventional storage systems, the latency of slow storage devices dominates access latency; hence, software efficiency is not critical. With low-latency storage, software costs can quickly dominate memory latency. Hence, researchers have proposed the memory mapped file I/O to avoid the software overhead. Mapping a file into the user memory space enables users to access the file directly. Therefore, it is possible to avoid the complicated I/O stack. This minimizes the number of user/kernel mode switchings. In addition, there is no data copy between kernel and user areas. Despite of the benefits in the memory mapped file I/O, its overhead still needs to be addressed, as the existing mechanism for the memory mapped file I/O is designed for slow block devices. In this paper, we identify the overheads of the memory mapped file I/O via experiments.

Design and Implementation of Kernel Binder Cache for Accelerating Android IPC (안드로이드 IPC 가속화를 위한 커널 바인더 캐쉬의 설계 및 구현)

  • Yeon, Jeseong;Koh, Kern;Lee, Eunji
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.16 no.5
    • /
    • pp.33-38
    • /
    • 2016
  • In Android platform, as applications invoke various service functions through IPC (Inter-Process Communication), IPC performance is critical to the responsiveness in Android. However, Android offers long IPC latency of hundreds of micro-seconds due to complicated software stacks between the kernel Binder and the user-level process Context Manager. This separation provides modularity and flexibility, but degrades the responsiveness of services owing to additional context switching and inefficient request handling. In this paper, we anatomize Android IPC mechanisms and observe that 55% of IPC latency comes from the communication overhead between Binder and Context Manager. Based on this observation, this paper proposes a kernel Binder cache that retains a popular subset of service function mappings, thereby reducing the requests transferred to the user-level daemon. The proposed Binder cache is implemented in Android 5.0 and experimental results with various benchmarks show that the proposed cache architecture improves performance by 52.9% on average.

Optimization of a Fuel Cell Stack for Small Robot Systems (소형 로봇용 연료 전지 스택 설계 사양 최적화)

  • Hwang, S.W.;Choi, G.H.;Park, Sam.;Ench, R. Michael;Bates, Alex M.;Lee, S.C.;Kwon, O.S.;Lee, D.H.
    • 한국태양에너지학회:학술대회논문집
    • /
    • 2012.03a
    • /
    • pp.211-216
    • /
    • 2012
  • Proton Exchange Membrane Fuel Cells (PEMFC) are the most appropriate for energy source of small robot applications. PEMFC has superior in power density and thermodynamic efficiency as compared with the Direct Methaol Fuel Cell (DMFC). Furthermore, PEMFC has lighter weight and smaller size than DMFC which are very important factors as small robot power system. The most significant factor of mobile robots is weight which relates closely with energy consumption and robot operation. This research tried to find optimum specifications in terms of type, number of cell, active area, cooling method, weight, and size. In order to find optimum 500W PEMFC, six options are designed in this paper and studied to reduce total stack weight by applying new materials and design innovations. However, still remaining problems are thermal management, robot space for energy sources, and so on. For a thermal management, design options need to analysis of Computational Fluid Dynamics (CFD) for determining which option has the improved performance and durability.

  • PDF

Design and Implementation of M2M-based Smart Factory Management Systems that controls with Smart Phone (스마트폰과 연동되는 M2M 기반 스마트 팩토리 관리시스템의 설계 및 구현)

  • Park, Byoung-Seob
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.4
    • /
    • pp.189-196
    • /
    • 2011
  • The main issues of the researches are monitoring environment such as weather or temperature variation and natural accident, and sensor gateways which have mobile device, applications for mobile health care. In this paper, we propose the SFMS(Smart Factory Management System) that can effectively monitor and manage a green smart factory area based on M2M service and smart phone with android OS platform. The proposed system is performed based on the TinyOS-based IEEE 802.15.4 protocol stack. To validate system functionality, we built sensor network environments where were equipped with four application sensors such as Temp/Hum, PIR, door, and camera sensor. We also built and tested the SFMS system to provide a novel model for event detection systems with smart phone.

Development of the Mechenical System and Vision Algorithm for the External Appearance Test Using Vision Image Processing (비전 이미지 프로세싱을 이용한 외관검사가 가능한 기계시스템 및 비전 알고리즘 개발)

  • Kim, Young-Choon;Kim, Young-Man;Kim, Sung-Gil;Kim, Hong-Bae;Cho, Moon-Taek
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.2
    • /
    • pp.202-208
    • /
    • 2016
  • In this study, the defect in connection with a C-tray was inspected using a low-cost camera. The four test items were the device overlapping in the tray, the bending of the tray, the loaded quantity of the tray, and the device pocket leaving, an algorithm was developed for defining and detecting the above defect types. Therefore, the developed handling system could extend the application of the stack of the c-tray and provide a quantity verification inspection on the packing processing. The machine operation control program, which can ensure the optimal inspection image to match the scan speed, was developed and the control program that can process the user gui and the vision image utilizing the control was developed. Overall, a mechanical system that is practicable for obtaining an image and processing the vision data was designed.

Design and Implementation of DYMO Protocol Using NanoQplus in Wireless Sensor Networks (무선 센서 네트워크에서 NanoQplus를 이용한 DYMO 프로토콜 설계와 구현)

  • Oh, Su-Taek;Bae, Jang-Sik;Jeong, Hong-Jong;Kim, Dong-Kyun;Park, Jung-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4B
    • /
    • pp.184-191
    • /
    • 2008
  • NanoQplus, which is an embedded operating system for wireless sensor networks (WSNs) and developed by Electronics and Telecommunications Research Institute (ETRI), provides programmer-friendly preemptive multi-threading programming technique, but it has poor network protocol stack, as compared to TinyOS, one of the famous operating systems for WSNs. In this paper, we apply dynamic MANET on-demand routing (DYMO) protocol, which is being standardized in Internet Engineering Task Force (IETF), to NanoQplus. Since DYMO has been proposed for mobile ad-hoc networks (MANETs) and MANETs have less resource restrictions than WSNs, the basic DYMO protocol cannot be applied to WSNs without modifications. Moreover, coherence with MAC protocol should be considered in order to eliminate redundant data between MAC and network layers. Thus, we propose a modified version of the basic DYMO protocol for NanoQplus. The experimental results from a real sensor network test-bed show that the DYMO implementation using NanoQplus works efficiently in WSNs.

Design and Evaluation of Fast-Handover Mechanism Between Hetrogeneous Networks Considering the Location Management in PMIPv6 (PMIPv6에서의 위치관리기법을 고려한 이 기종 망간의 Fast Handover 기법 설계 및 평가)

  • Shim, JaeSung;Park, SeokCheon
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.3
    • /
    • pp.219-228
    • /
    • 2012
  • As the wireless Internet become more widely accessible, variety of Internet services can be used without limitation of location. However, existing mobility management methods such as MIP and PMIP of IETF requires the load of heavy protocol stack on the mobile nodes or the addition of components such as LMA and MAG. In this paper, we proposed the location management technique in the PMIPv6 and Fast Handover technique. according to the moving pattern of the node, the location management technique proposed in order to adjust the paging area dynamically. The Fast Handover technique applied MIH technology and it reduced the handover signal processing time between heterogeneous network. The location management cost in the environment which the node moves in order to evaluate this and handover delay time was calculate. The proposal technique was efficiently more evaluated than PMIPv6 with the smallest 29% and maximum 83%.

Design of Multiprocess Models for Parallel Protocol Implementation (병렬 프로토콜 구현을 위한 다중 프로세스 모델의 설계)

  • Choi, Sun-Wan;Chung, Kwang-Sue
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.10
    • /
    • pp.2544-2552
    • /
    • 1997
  • This paper presents three multiprocess models for parallel protocol implementation, that is, (1)channel communication model, (2)fork-join model, and (3)event polling model. For the specification of parallelism for each model, a parallel programming language, Par. C System, is used. to measure the performance of multiprocess models, we implemented the Internet Protocol Suite(IPS) Internet Protocol (IP) for each model by writing the parallel language on the Transputer. After decomposing the IP functions into two parts, that is, the sending side and the receiving side, the parallelism in both sides is exploited in the form of Multiple Instruction Single Data (MISD). Three models are evaluated and compared on the basis of various run-time overheads, such as an event sending via channels in the parallel channel communication model, process creating in the fork-join model and context switching in the event polling model, at the sending side and the receiving side. The event polling model has lower processing delays as about 77% and 9% in comparison with the channel communication model and the fork-join model at the sending side, respectively. At the receiving side, the fork-join model has lower processing delays as about 55% and 107% in comparison with the channel communication model and the event polling model, respectively.

  • PDF

A New RFID Multi-Tag recognition Algorithm using Collision-Bit (RFID 충돌 비트를 이용한 다중 태그 인식 알고리즘)

  • Ji, Yoo-Kang;Cho, Mi-Nam;Hong, Sung-Soo;Park, Soo-Bong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.6
    • /
    • pp.999-1005
    • /
    • 2008
  • RFID(Radio Frequency IDintification) leader is collision of data, when recognizing the multiple tag the inside area. This collision became the cause which delays the tag recognition time of the leader. The protocol which prevents the delay of tag recognition time of the leader the place where representative it uses QT(Query Tree) algorithms, it uses a collision bit position from this paper and are improved QT-MTC(Query Tree with Multi-Tag Cognition) algorithms which it proposes. This algorithm stored the bit position which bit possibility and the collision where the collision happens occurs in the stack and goes round a tree the number of time which, it reduced could be identified two tags simultaneously in order, it was planned. A result of performance analysis, It compared in QT protocols and the this algorithm against the tag bit which is continued a high efficiency improvement effect was visible.

Design of Broadband Microstrip Antenna for 2.5GHz with Inverted Parasite Patch and the Proximity Stub (근접 스터브와 뒤집힌 기생 패치를 이용한 2.5GHz용 광대역 마이크로스트립 안테나의 설계)

  • Cho, Ki-Ryang;Kim, Dae-Ik;Kim, Gun-Kyun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.3
    • /
    • pp.467-474
    • /
    • 2019
  • In this paper, we studied a method for a broadband stacked patch antenna structure which is widely used for bandwidth improvement. The characteristics according to the distance between the two patches were analyzed and the impedance matching was optimized by connecting parallel open stubs to the main patch feed line. The shunt matching stub is inserted underneath the parasitic patch and so it does not require additional space, which enables the proposed antenna structure to be advantageous in miniaturizing antenna. The effects of the various parameters on the antenna performance are examined, and we introduced the design procedure for the proposed antenna to operate in the frequency range of 2.3~2.7GHz. Experimental results show that the bandwidth of the proposed antenna is about 480MHz with 2.27~2.75GHz bandwidth. And the antenna gain was 5.8dBi at 2.3GHz and 7.8dBi at 2.6GHz within the bandwidth.