• Title/Summary/Keyword: 분배성능

Search Result 603, Processing Time 0.026 seconds

The Performance Analysis of TRC Dropper to improve fairness on DiffServ Networks (DiffServ 네트워크에서 공평성 향상을 위한 TRC Dropper의 성능 분석)

  • Kim, Hoon-Ki;Hong, Sung-Hwa
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.3
    • /
    • pp.91-102
    • /
    • 2009
  • The average window size is most closely related to average throughput. In order to improve fairness, the proposed dropper tries to control the window size of each flow to equal level by intentional packet drop. Intentional packet drop is performed only to the flows that have been occupied bandwidth in a large amount. Because of intentional packet drop, this flow cut down its transmission rate to a half. Accordingly, somewhat capacity of core link comes into existence. And other flow can use this new capacity of this link. Hence other flows have more throughput than before. In this paper, we propose the TRC (Transmission Rate Control) Dropper improving the fairness between individual flows of aggregated sources on DiffServ network. It has the fairness improvement mechanism mentioned above paragraph.

Design of A Distributed Server System for Supporting Enormous Users Using Blocks (블록을 이용한 대규모 사용자 지원 분산 서버 시스템 설계)

  • Kim, Soon-Gohn
    • Journal of Digital Contents Society
    • /
    • v.12 no.4
    • /
    • pp.559-565
    • /
    • 2011
  • In this paper, I propose a distributed game server system which has flexibility of enormous game character's processing in MMORPG using block scheme. I proposed game servers in distributed system grouped with zone which charge of each map, and the game servers in this zone divide game map into several unit blocks and process distributing blocks to game servers according to its performance. I proposed distributed game server system using block scheme can add/drop game map to/from easily through block process method in game and communication servers. Therefore, my proposed system can enormous character processing and add user created game map to existed game map easily in the future as well. Also, my scheme increases the system utilization and upgrades system stability by dynamic distribution of game map according to the number of characters and performance of servers.

A Ray-Tracing Algorithm Based On Processor Farm Model (프로세서 farm 모델을 이용한 광추적 알고리듬)

  • Lee, Hyo Jong
    • Journal of the Korea Computer Graphics Society
    • /
    • v.2 no.1
    • /
    • pp.24-30
    • /
    • 1996
  • The ray tracing method, which is one of many photorealistic rendering techniques, requires heavy computational processing to synthesize images. Parallel processing can be used to reduce the computational processing time. A parallel algorithm for the ray tracing has been implemented and executed for various images on transputer systems. In order to develop a scalable parallel algorithm, a processor farming technique has been exploited. Since each image is divided and distributed to each farming processor, the scalability of the parallel system and load balancing are achieved naturally in the proposed algorithm. Efficiency of the parallel algorithm is obtained up to 95% for nine processors. However, the best size of a distributed task is much higher in simple images due to less computational requirement for every pixel. Efficiency degradation is observed for large granularity tasks because of load unbalancing caused by the large task. Overall, transputer systems behave as good scalable parallel processing system with respect to the cost-performance ratio.

  • PDF

Joint Polarization and Frequency Assignment Algorithm Based on Graph Theory (그래프 이론 기반의 편파 및 주파수 지정 알고리즘)

  • Koo, Bonhong;Chae, Chan-Byoung;Park, Sung-Ho;Park, Hwi-Sung;Ham, Jae-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.8
    • /
    • pp.954-957
    • /
    • 2016
  • In cases of military communication plan, it often requires to find a proper solution for frequency assignment within feasible time. Minimizing the number of used resources are related to cost issue, hence it is a critical objective. When the dual polar antenna is used, the performance can be much developed by exploiting the polarization separation. In this paper, we propose an algorithm that assigns polarizations and frequencies within complexity of $O(N^2)$ based on the graph matching theory. We have verified that the proposed algorithm shows almost twice performance relative to the uni-polar frequency assignment algorithms and it approaches very closely to its theoretical optima.

Load Balancing Schemes in the MANET with Multiple Internet Gateways (다중 인터넷 게이트웨이를 갖는 MANET의 부하 균등화 기법)

  • Kim, Young-Min;Lim, Yu-Jin;Yu, Hyun;Lee, Jae-Hwoon;Ahn, Sang-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.621-626
    • /
    • 2006
  • A mobile ad hoc network (MANET) is an infrastructureless network that supports multi-hop communication. For the MANET nodes wishing to communicate with nodes in the wired Internet, the global Internet connectivity is required and this functionality can be achieved with the help of the Internet gateway. For the support of reliability and flexibility, multiple Internet gateways can be provisioned for a MANET. In this case, load-balancing becomes one of the important issues since the network performance such as the network throughput can be improved if the loads of the gateways are well-balanced. In this paper, we categorize the load-balancing mechanisms and propose a new metric for load-balancing. Simulation results show that our proposed mechanism using the hop distance and the number of routing table entries as a load-balancing metric enhances the overall network throughput.

Property Enlargement of JDBC 3-tier Model Using CORBA Under Distributed Object Environments (분산객체환경에서의 JDBC 3-tier 모델의 성능확대와 CORBA의 이용)

  • Lee, Jin-Yong;Jeon, Sun-Mi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.9
    • /
    • pp.2248-2255
    • /
    • 1998
  • The property of connectivity between DBMS and application system developed in java is very important under the distributed object environments with heterogeneous systems. In these days, mostly used JDBC 3-tier model, which supports the connectivity, has two problems: the one is the restricted connectivity needed for the Java applet as application programs and the other is the additional efforts to design and implemtnt in linking any application program with the middleware from being deficit of standard protocol. In order to solve these problems, we have worked on Enlarging the properties of JDBC 3 tier model by applying CORBA distributed object environments. Thus, the enlarged 3-tier model has an ORB-JDBC sub protocol for the client sub-protocol and a middleware whose property is supported by CORBA.

  • PDF

A Distributed Electrical Impedance Tomography Algorithm for Real-Time Image Reconstruction (실시간 영상 복원을 위한 분산 전기단층촬영 알고리즘)

  • Junghoon Lee;Gyunglin Park
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.10 no.1
    • /
    • pp.25-36
    • /
    • 2004
  • This paper proposes and measures the performance of a distributed EIT (Electrical Impedance Tomography) image reconstruction algorithm which has a master-slave structure. The image construction is a computation based application of which the execute time is proportional to the cube of the unknowns. After receiving a specific frame from the master, each computing node extracts the basic elements by executing the first iteration of Kalman Filter in parallel. Then the master merges the basic element lists into one group and then performs the sequential iterations with the reduced number of unknowns. Every computing node has MATLAB functions as well as extended library implemented for the exchange of MATLAB data structure. The master implements another libraries such as threaded multiplication, partitioned inverse, and fast Jacobian to improve the speed of the serial execution part. The parallel library reduces the reconstruction time of image visualization about by half, while the distributed grouping scheme further reduces by about 12 times for the given target object when there are 4 computing nodes.

The Development of Kernel-based Monitoring System for Grid Application (커널 기반 그리드 응용 모니터링 시스템의 개발)

  • Kim Tae-Kyung;Kim Dong-Su;Byeon Ok-Hwan;Chung Tai M.
    • The KIPS Transactions:PartC
    • /
    • v.11C no.6 s.95
    • /
    • pp.821-828
    • /
    • 2004
  • To analyze the usage information of system and network resources to the each grid application by measuring the real time traffic and calculating the statistic information, we suggested the kernel-based monitoring methods by researching the efficient monitoring method. This method use small system resourcesand measure the monitoring information accurately with less delay than the usual packet capture methods such as tcpdump. Also we implemented the monitoring systems which can monitor the used resources of system and network for grid application using the suggested kernel-based monitoring method. This research can give the useful information to the development of grid application and to grid network scheduler which can assign the proper resources to the grid application to perform efficiently. Network administrator can decide whether the expansion of network is required or not using the monitoring information.

Priority Polling and Dual Token Bucket based HCCA Algorithm for IEEE 802.11e WLAN (IEEE 802.11e WLAN을 위한 우선순위 폴링 및 이중 토큰 버킷 기반의 HCCA 알고리즘)

  • Lee, Dong-Yul;Lee, Chae-Woo
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.46 no.4
    • /
    • pp.31-41
    • /
    • 2009
  • IEEE 802.11e proposed by IEEE 802.11 working group to guarantee QoS has contention based EDCA and contention free based HCCA. HCCA, a centralized polling based mechanism of 802.11e, needs a scheduling algorithm to allocate the network resource efficiently. The existing standard scheduler, however, is inefficient to support for QoS guarantee for real-time service having VBR traffic. To improve these limit, in this paper, we First, we propose priority polling algorithm which additionally considers the size of MSI and TXOP based on EDD algorithm to increase number of QSTAs. We also propose a dual token bucket TXOP allocation algorithm to reduce congestion caused by stations which enters network with considerable delay variance. TSPEC parameters, Maximum Burst Size (MBS) and Peak Data Rate (PR), are applied to design depth and token generation rate of two buckets. Simulation results show that the proposed algorithm has much higher performance compared with reference and SETT-EDD scheduler in terms of throughput and delay.

SoC Network Architecture for Efficient Multi-Channel On-Chip-Bus (효율적인 다중 채널 On-Chip-Bus를 위한 SoC Network Architecture)

  • Lee Sanghun;Lee Chanho;Lee Hyuk-Jae
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.42 no.2 s.332
    • /
    • pp.65-72
    • /
    • 2005
  • We can integrate more IP blocks on a silicon die as the development of fabrication technologies and EDA tools. Consequently, we can design complicated SoC architecture including multi-processors. However, most of existing SoC buses have bottleneck in on-chip communication because of shared bus architectures, which result in the performance degradation of systems. In most cases, the performance of a multi-processor system is determined by efficient on-chip communication and the well-balanced distribution of computation rather than the performance of the processors. We propose an efficient SoC Network Architecture(SNA) using crossbar routers which provide a solution to ensure enough communication bandwidth. The SNA can significantly reduce the bottleneck of on-chip communication by providing multi-channels for multi-masters. According to the proposed architecture, we design a model system for the SNA. The proposed architecture has a better efficiency by $40\%$ than the AMBA AHB according to a simulation result.