• 제목/요약/키워드: Shared Space Performance

검색결과 53건 처리시간 0.028초

Performance Isolation of Shared Space for Virtualized SSD based Storage Systems

  • Kim, Sungho;Kwak, Jong Wook
    • 한국컴퓨터정보학회논문지
    • /
    • 제24권9호
    • /
    • pp.1-8
    • /
    • 2019
  • In this paper, we propose a performance isolation of shared space for virtualized SSD based storage systems, to solve the weakness in a VSSD framework. The proposed scheme adopts a CFQ scheduler and a shared space-based FTL for the fairness and the performance isolation for multiple users on virtualized SSD based storage systems. Using the CFQ scheduler, we ensure SLOs for the storage systems such as a service time, a allocated space, and a IO latency for users on the virtualized storage systems. In addition, to improve a throughput and reduce a computational latency for garbage collection, a shared space-based FTL is adopted to maintain the information of SLOs for users and it manages shared spaces among the users. In our experiments, the proposal improved the throughput of garbage collection by 7.11%, on average, and reduced the computational latency for garbage collection by 9.63% on average, compared to the previous work.

Ethernet-Based Avionic Databus and Time-Space Partition Switch Design

  • Li, Jian;Yao, Jianguo;Huang, Dongshan
    • Journal of Communications and Networks
    • /
    • 제17권3호
    • /
    • pp.286-295
    • /
    • 2015
  • Avionic databuses fulfill a critical function in the connection and communication of aircraft components and functions such as flight-control, navigation, and monitoring. Ethernet-based avionic databuses have become the mainstream for large aircraft owning to their advantages of full-duplex communication with high bandwidth, low latency, low packet-loss, and low cost. As a new generation aviation network communication standard, avionics full-duplex switched ethernet (AFDX) adopted concepts from the telecom standard, asynchronous transfer mode (ATM). In this technology, the switches are the key devices influencing the overall performance. This paper reviews the avionic databus with emphasis on the switch architecture classifications. Based on a comparison, analysis, and discussion of the different switch architectures, we propose a new avionic switch design based on a time-division switch fabric for high flexibility and scalability. This also merges the design concept of space-partition switch fabric to achieve reliability and predictability. The new switch architecture, called space partitioned shared memory switch (SPSMS), isolates the memory space for each output port. This can reduce the competition for resources and avoid conflicts, decrease the packet forwarding latency through the switch, and reduce the packet loss rate. A simulation of the architecture with optimized network engineering tools (OPNET) confirms the efficiency and significant performance improvement over a classic shared memory switch, in terms of overall packet latency, queuing delay, and queue size.

다중프론트 해법의 공유메모리 병렬화 (Parallelization of Multifrontal Solution Method for Shared Memory Architecture)

  • 김민기;김정호;박찬익;김승조
    • 한국항공우주학회지
    • /
    • 제40권11호
    • /
    • pp.972-978
    • /
    • 2012
  • 본 논문은 유한요소 구조해석의 선형해법으로 널리 사용되는 다중프론트 해법의 공유메모리 환경하의 병렬화 방법을 논의한다. 다중프론트 해법은 병렬성이 내재되어 있어서 여타 해법보다 상대적으로 병렬화가 용이한 방법이다. 다중프론트 해법의 공유메모리 컴퓨터에서 최적의 성능을 내도록 병렬 계산을 수행하기 위한 기법들이 제시되었다. 주로 독립적인 계산 작업 시에 필요한 주 메모리 용량을 줄이는 데 초점을 맞춘 방법들로서 프론트 행렬 연성화와 행렬 분리로 명명된 두 기법에 대해 자세히 설명한다. 개발된 방법으로 기존의 알고리즘과의 성능 비교를 수행하여 본지에 제안한 방법이 현대의 다중코어 컴퓨터에서 훨씬 더 효율적인 기법임을 입증하였다.

A High-Performance Scalable ATM Switch Design by Integrating Time-Division and Space-Division Switch Architectures

  • Park, Young-Keun
    • Journal of Electrical Engineering and information Science
    • /
    • 제2권6호
    • /
    • pp.48-55
    • /
    • 1997
  • Advances in VLSI technology have brought us completely new design principles for the high-performance switching fabrics including ATM switches. From a practical point of view, port scalability of ATM switches emerges as an important issue while complexity and performance of the switches have been major issues in the switch design. In this paper, we propose a cost-effective approach to modular ATM switch design which provides the good scalability. Taking advantages of both time-division and space-division switch architectures, we propose a practically implementable large scale ATM switch architecture. We present a scalable shared buffer type switch for a building block and its expansion method. In our design, a large scale ATM switch is realized by interconnecting the proposed shared buffer switches in three stages. We also present an efficient control mechanism of the shared buffers, synchronization method for the switches in each stage, and a flow control between stages. It is believed that the proposed approach will have a significant impact on both improving the ATM switch performance and enhancing the scalability of the switch with a new cost-effective scheme for handling the traffic congestion. We show that the proposed ATM switch provides an excellent performance and that its cell delay characteristic is comparable to output queueing which provides the best performance in cell delay among known approaches.

  • PDF

Dual Core 시스템에서 Shared Memory 기능 설계 (The Design of the Shared Memory in the Dual Core System)

  • 장승주;이광용;김재명
    • 한국정보통신학회논문지
    • /
    • 제12권8호
    • /
    • pp.1448-1455
    • /
    • 2008
  • 본 논문은 대부분의 Linux 운영체제에서 지원해 주는 System V의 IPC 중 하나인 Shared Memory를 Dual Core 시스템 상에서 동작하도록 설계한다. Linux에서 사용되는 Shared Memory는 동일한 메모리 영역에 여러 개의 프로세스가 접근할 수 있도록 해 주는 기술이 다. 본 논문에서는 Shared Memory의 큰 두 갈래 중 커널 단계에서 처리되는 SVR(System V Release) 형식의 Shared Memory를 다룬다. 본 논문에서는 리눅스 운영체제의 공유 메모리 기능을 Dual Core 시스템에서 동작하도록 설계한다. 본 논문에서 제안하는 Dual Core 시스템에서 공유 메모리 기능 설계 방안은 듀얼 코어를 활용하여 기존의 단일 처리기 시스템에서보다 성능을 향상시킬 수 있도록 한다. 공유 메모리를 이용한 프로세스의 동작이 별개의 CPU에서 동작되도록 함으로써 성능 향상을 꾀한다.

Shared Memory Model over a Switchless PCIe NTB Interconnect Network

  • Lim, Seung-Ho;Cha, Kwangho
    • Journal of Information Processing Systems
    • /
    • 제18권1호
    • /
    • pp.159-172
    • /
    • 2022
  • The role of the interconnect network, which connects computing nodes to each other, is important in high-performance computing (HPC) systems. In recent years, the peripheral component interconnect express (PCIe) has become a promising interface as an interconnection network for high-performance and cost-effective HPC systems having the features of non-transparent bridge (NTB) technologies. OpenSHMEM is a programming model for distributed shared memory that supports a partitioned global address space (PGAS). Currently, little work has been done to develop the OpenSHMEM library for PCIe-interconnected HPC systems. This paper introduces a prototype implementation of the OpenSHMEM library through a switchless interconnect network using PCIe NTB to provide a PGAS programming model. In particular, multi-interrupt, multi-thread-based data transfer over the OpenSHMEM shared memory model is applied at the implementation level to reduce the latency and increase the throughput of the switchless ring network system. The implemented OpenSHMEM programming model over the PCIe NTB switchless interconnection network provides a feasible, cost-effective HPC system with a PGAS programming model.

분산 공유 메모리 시스템에서 메모리 참조 패턴에 근거한 거짓 공유 감속 기법 (Reducing False Sharing based on Memory Reference Patterns in Distributed Shared Memory Systems)

  • 조성제
    • 한국정보처리학회논문지
    • /
    • 제7권4호
    • /
    • pp.1082-1091
    • /
    • 2000
  • In Distributed Shared Memory systems, false sharing occurs when two different data items, not shared but accessed by two different processors, are allocated to a single block and is an important factor in degrading system performance. The paper first analyzes shared memory allocation and reference patterns in parallel applications that allocate memory for shared data objects using a dynamic memory allocator. The shared objects are sequentially allocated and generally show different reference patterns. If the objects with the same size are requested successively as many times as the number of processors, each object is referenced by only a particular processor. If the objects with the same size are requested successively much more than the number of processors, two or more successive objects are referenced by only particular processors. On the basis of these analyses, we propose a memory allocation scheme which allocates each object requested by different processors to different pages and evaluate the existing memory allocation techniques for reducing false sharing faults. Our allocation scheme reduces a considerable amount of false sharing faults for some applications with a little additional memory space.

  • PDF

Dynamic Survivable Routing for Shared Segment Protection

  • Tapolcai, Janos;Ho, Pin-Han
    • Journal of Communications and Networks
    • /
    • 제9권2호
    • /
    • pp.198-209
    • /
    • 2007
  • This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

Single Address Space(SAS) Architecture를 이용한 Embedded Operating System (Embedded Operating System using the Single Address Space(SAS) Architecture)

  • 안광혁
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
    • /
    • pp.608-611
    • /
    • 2003
  • A large part of the embedded system, compared with the PC, have low performance CPU and small memory. So the embedded operating system fits the condition of that hardware system. A Single Address Space (SAS) OS has the operating system and all applications in the single address space. The SAS architecture enhances sharing and co-operation, because addresses have a unique interpretation. Thus, pointer-based date structures can be directly communicated and shared between programs at any time, and can be stored directly on storage. The key point of the SAS OS on the embedded system is the low overhead inter-action between programs in process and usage. So SAS OS can be ported on the low performance CPU. In this paper, we design the SAS OS (named emNOS, Embedded Network Operating System) on the ARMTTDMI processor. Finally we show the benefits of the SAS OS on the embedded system.

  • PDF

Performance Analysis of FSO Communication Systems with Photodetector Multiplexing

  • Feng, Jianfeng;Zhao, Xiaohui
    • Current Optics and Photonics
    • /
    • 제1권5호
    • /
    • pp.440-455
    • /
    • 2017
  • In this paper, we carry out a performance analysis of a two-user free-space optical (FSO) communication system with photodetector multiplexing, in which the two users are defined as the primary user (PU) and secondary user (SU). Unlike common single-user FSO systems, our photodetector multiplexing FSO system deploys a shared detector at the receiver and enables PU and SU to send their own data synchronously. We conduct the performance analysis of this FSO system for two cases: (1) in the absence of background radiation, and (2) in the presence of background radiation. Decision strategies for PU and SU are presented according to the two scenarios above. Exact and approximate conditional symbol-error probability (SEP) expressions for both PU and SU are derived, in an ideal channel with no fading. Average SEP expressions are also presented in the no-background-radiation scenario. Additionally, in some particular cases where the power ratio tends to 0.5 or 1, approximate SEP expressions are also obtained. Finally, numerical simulations are presented under different conditions, to support the performance analysis.