• Title/Summary/Keyword: Performance-sharing

Search Result 1,364, Processing Time 0.023 seconds

Parallel Operation of Microgrid Inverters Based on Adaptive Sliding-Mode and Wireless Load-Sharing Controls

  • Zhang, Qinjin;Liu, Yancheng;Wang, Chuan;Wang, Ning
    • Journal of Power Electronics
    • /
    • v.15 no.3
    • /
    • pp.741-752
    • /
    • 2015
  • This study proposes a new solution for the parallel operation of microgrid inverters in terms of circuit topology and control structure. A combined three-phase four-wire inverter composed of three single-phase full-bridge circuits is adopted. Moreover, the control structure is based on adaptive three-order sliding-mode control and wireless load-sharing control. The significant contributions are as follows. 1) Adaptive sliding-mode control performance in inner voltage loop can effectively reject both voltage and load disturbances. 2) Virtual resistive-output-impedance loop is applied in intermediate loop to achieve excellent power-sharing accuracy, and load power can be shared proportionally to the power rating of the inverter when loads are unbalanced or nonlinear. 3) Transient droop terms are added to the conventional power outer loop to improve dynamic response and disturbance rejection performance. Finally, theoretical analysis and test results are presented to validate the effectiveness of the proposed control scheme.

Implementation of a P2P-based Data Sharing System using JXTA (JXTA를 이용한 P2P 기반 자료공유시스템(JDSS)의 구현)

  • 양광민;주형렬
    • Journal of Information Technology Applications and Management
    • /
    • v.10 no.3
    • /
    • pp.1-22
    • /
    • 2003
  • P2P systems have been studied by many researchers in universities and commercial firms in recent years. In this study. we design and implement a system that makes UP for shortcomings of currently available P2P systems. Gnutella and Napster. The study also includes an efficiency analysis scheme conducted through a series of experimental data. The data sharing system of the study demonstrated duality of roles(client, service) of peers. But, their roles were separated from the existing client-server systems. Also, the study implements mechanism that shows the redundancy of data to communicate efficiently among peers for transferring data. The results of performance measure of the system shows that the amount of information shared by peers increases as the amount of peers increases but with no significant increase in response time. This constant response time is far more stable and faster than current file sharing systems. such as Gnutella and Napster. Business applications such as knowledge management, enterprise information portal management and transfer of data are done by use of supercomputers. They need to extend their systems to equip with more capacity and throughput as the number of clients increases. Moreover, they will face with more complicated problems if integration with new systems exists. If this JDSS is introduced to these business applications. it would easily augment scalability of the system with high performance at less expense.

  • PDF

Exploitation of Spatial Diversity in a Novel Cooperative Spectrum Sharing Method based on PAM and Modified PAM Modulation

  • Tran, Truc Thanh;Kong, Hyung Yun
    • Journal of Communications and Networks
    • /
    • v.16 no.3
    • /
    • pp.280-292
    • /
    • 2014
  • This article presents a novel cooperative spectrum sharing (CSS) scheme. The primary transmitter transmits a complex Quadrature amplitude modulation (QAM) signal in the first phase, and CSS occurs in the second phase. The secondary transmitter with the largest forwarding channel gain among the nodes that successfully decode the primary signal in the first phase is selected for CSS. This selected node employs a pulse-amplitude modulation (PAM) signal for primary information message (IM) instead of the QAM signal, and it employs a modified PAM signal for the secondary IM. The proposed modified PAM signal depends on the amplitude of the primary PAM signal. This method results in no mutual interference and negligible primary interference constraint and allows a higher degree of exploitation of spatial diversity, thus enabling increase in secondary power to improve primary transmission. The outage performance is enhanced in both the primary and secondary systems. The critical region, in which the primary outage performance is enhanced with the proposed CSS scheme, can be adjusted and widened by varying either the modulation cooperation sharing factor or the number of secondary transmitters.

Refined fixed granularity algorithm on Networks of Workstations (NOW 환경에서 개선된 고정 분할 단위 알고리즘)

  • Gu, Bon-Geun
    • The KIPS Transactions:PartA
    • /
    • v.8A no.2
    • /
    • pp.117-124
    • /
    • 2001
  • At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

  • PDF

MDS Coded Caching for Device-to-Device Content Sharing Against Eavesdropping

  • Shi, Xin;Wu, Dan;Wang, Meng;Yang, Lianxin;Wu, Yan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4484-4501
    • /
    • 2019
  • In this paper, we put forward a delay-aware secure maximum distance separable (MDS) coded caching scheme to resist the eavesdropping attacks for device-to-device (D2D) content sharing by combining MDS coding with distributed caching. In particular, we define the average system delay to show the potential coupling of delay-content awareness, and learn the secure constraints to ensure that randomly distributed eavesdroppers cannot obtain enough encoded packets to recover their desired contents. Accordingly, we model such a caching problem as an optimization problem to minimize the average system delay with secure constraints and simplify it to its convex relaxation. Then we develop a delay-aware secure MDS coded caching algorithm to obtain the optimal caching policy. Extensive numerical results are provided to demonstrate the excellent performance of our proposed algorithm. Compared with the random coded caching scheme, uniform coded caching scheme and popularity based coded caching scheme, our proposed scheme has 3.7%, 3.3% and 0.7% performance gains, respectively.

Performance Analysis of Qos over CBQ Estimator (CBQ Estimator을 고려한 QoS 성능 분석)

  • 박우출;박상준;이병호
    • Proceedings of the IEEK Conference
    • /
    • 2000.11a
    • /
    • pp.287-290
    • /
    • 2000
  • This paper analyze link-sharing mechanisms in packet networks based on the hierarchical class based queueing. The CBQ outlines a set of flexible, efficiently implemented gateway mechanisms that can meet a range of service and link-sharing requirements. We have analyzed the Class level(B, C, D) using the EWMA (Exponential Weighted Moving Average) weight value and EWMA average limit value.

  • PDF

Performance Analysis of Shared-Memory ATM switches in Self-Similar Traffic Environment (Self-Similar 트래픽 환경에서 공유 메모리를 갖는 ATM 스위치의 성능분석)

  • 김기완;김두용
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.235-237
    • /
    • 2003
  • 멀티미디어 데이터 전송이 가능한 초고속 통신망의 발달로 음성을 위주로 서비스하던 과거와는 다른 self-similar 특성을 갖는 데이터 트래픽이 발생된다는 것이 알려지고 있다. 이러한 트래픽은 전통적인 네트워크 해석 방법인 포와송 트래픽 모델과는 상당히 차이가 난다는 것이 여러 트래픽의 측정 결과 나타나고 있다. 본 논문에서는 공유 메모리를 갖는 CS(Complete Sharing), DT(Dynamic Threshold), PO(Push-Out) 그리고, SMXQ(Sharing with Maximum Queue)와 같은 다양한 ATM(Asynchronous Transfer Mode) 스위치의 버퍼 관리 기법을 이용하여 입력포트에 self-similar 성질을 갖는 트래픽이 들어올 때 출력포트에서의 self-similarity와 셀 손실률 그리고, 이용률 등을 분석한다.

  • PDF

A Comparative Study of the Marketing Performance of Seafood Wholesaler and Middlemen (수산물 유통 도매상과 중도매인의 유통성과 비교연구)

  • Lee, Jung-Phil;Jang, Young-Soo
    • The Journal of Fisheries Business Administration
    • /
    • v.47 no.4
    • /
    • pp.15-30
    • /
    • 2016
  • Changes in marketing environment have made it feasible for functions and roles of marketing subjects who participated in marketing routes to be changed. However, there has not been a study to prove it or to deal with newly required functions. Hereupon, this study has specifically investigated and analyzed marketing functions and performance on marketing associates for seafood in Busan in order to identify how marketing functions influenced on marketing performance. Marketing function might differently influence on the performance depending on the difference of business type. Results of verifying the hypothesis are as follows. As for variables that influenced on wholesaler groups, marketing, product development+investment, information-sharing, and trade functions turned out to be influential. Among wholesaler groups, marketing, sorting, collection, market frontier+product development, integral distribution, information-sharing, and finance functions turned out to be influential. In addition to these basic results, another difference industries, restrictive range of activities, the differences in handling goods, such as by correspondence of the results to changes in the distribution environment, from the results of the present study it is possible to guess.

Wiki-Based Expert Knowledge Collaboration Effects on Performance of Project Members (위키방식의 전문지식 협력이 프로젝트 구성원의 성과에 미치는 효과)

  • Kim, Hee Yeong;Kang, Sungbae;Lee, John
    • Journal of Information Technology Services
    • /
    • v.12 no.1
    • /
    • pp.173-187
    • /
    • 2013
  • The advent of Web2.0 has believed to be the solution against many barriers in information sharing, especially wiki. Information sharing and collaboration are realized voluntarily and unselfishly with wiki. The purpose of this paper is to analyze the benefits and challenges of using wiki as a project management method in an IT/IS project. Wiki-based project management could provide project managers and members with expert knowledge collaboration for better project results. In the research model, we used TMS(Transactive Memory System) theory to define the relation of collaboration and performance of project members. Based on a survey among project members, the interactions between wiki characteristics and performance are examined in an IS project environment. Using Smart PLS 2.0, the data was analyzed to define the interactions by the structural equation modeling. From the empirical data, the mediated effect of expert knowledge collaboration is supported. We also derive the implications of wiki-based method. It is expected to bring new possibilities of Project management performance.

The development of the high effective and stoppageless file system for high performance computing (High Performance Computing 환경을 위한 고성능, 무정지 파일시스템 구현)

  • Park, Yeong-Bae;Choe, Seung-Hwan;Lee, Sang-Ho;Kim, Gyeong-Su;Gong, Yong-Jun
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2004.11a
    • /
    • pp.395-401
    • /
    • 2004
  • In the current high network-centralized computing and enterprising environment, it is getting essential to transmit data reliably at very high rates. Until now previous client/server model based NFS(Network File System) or AFS(Andrew's Files System) have met the various demands but from now couldn't satisfy those of the today's scalable high-performance computing environment. Not only performance but data sharing service redundancy have risen as a serious problem. In case of NFS, the locking issue and cache cause file system to reboot and make problem when it is used simply as ip-take over for H/A service. In case of AFS, it provides file sharing redundancy but it is not possible until the storage supporting redundancy and equipments are prepared. Lustre is an open source based cluster file system developed to meet both demands. Lustre consists of three types of subsystems : MDS(Meta-Data Server) which offers the meta-data services, OST(Objec Storage Targets) which provide file I/O, and Lustre Clients which interact with OST and MDS. These subsystems with message exchanging and pursuing scalable high-performance file system service. In this paper, we compare the transmission speed of gigabytes file between Lustre and NFS on the basis of concurrent users and also present the high availability of the file system by removing more than one OST in operation.

  • PDF