• Title/Summary/Keyword: performance scalability

Search Result 646, Processing Time 0.03 seconds

Resource Weighted Load Distribution Policy for Effective Transcoding Load Distribution (효과적인 트랜스코딩 부하 분산을 위한 자원 가중치 부하분산 정책)

  • Seo, Dong-Mahn;Lee, Joa-Hyoung;Choi, Myun-Uk;Kim, Yoon;Jung, In-Bum
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.5
    • /
    • pp.401-415
    • /
    • 2005
  • Owing to the improved wireless communication technologies, it is possible to provide streaming service of multimedia with PDAs and mobile phones in addition to desktop PCs. Since mobile client devices have low computing power and low network bandwidth due to wireless network, the transcoding technology to adapt media for mobile client devices considering their characteristics is necessary. Transcoding servers transcode the source media to the target media within corresponding grades and provide QoS in real-time. In particular, an effective load balancing policy for transcoding servers is inevitable to support QoS for large scale mobile users. In this paper, the resource weighted load distribution policy is proposed for a fair load balance and a more scalable performance in cluster-based transcoding servers. Our proposed policy is based on the resource weighted table and number of maximum supported users, which are pre-computed for each pre-defined grade. We implement the proposed policy on cluster-based transcoding servers and evaluate its fair load distribution and scalable performance with the number of transcoding servers.

An Extended Virtual LAM System Deploying Multiple Route Server (다중 라우트 서버를 두는 확장된 가상랜 시스템)

  • Seo, Ju-Yeon;Lee, Mee-Jeong
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.117-128
    • /
    • 2002
  • Virtual LAN (VLAN) is an architecture to enable communication between end stations as if they were on the same LAN regardless of their physical locations. VLAN defines a limited broadcast domain to reduce the bandwidth waste. The Newbridge Inc. developed a layer 3 VLAN product called VIVID, which configures a VLAN based on W subnet addresses. In a VIVID system, a single route server is deployed for address resolution, VLAN configuration, and data broadcasting to a VLAN. If the size of the network, over which the VLANS supported by the VIVID system spans, becomes larger, this single route server could become a bottleneck point of the system performance. One possible approach to cope with this problem is to deploy multiple route servers. We propose two architectures, organic and independent, to expand the original VIVID system to deploy multiple route servers. A course of simulations are done to analyze the performance of each architecture that we propose. The simulation results show that the performances of the proposed architectures depend on the lengths of VLAN broadcasting sessions and the number of broadcast data frames generated by a session. It has also been shown that there are tradeoffs between the scalability of the architecture and their efficiency in data transmissions.

Development of Real-time Video Surveillance System Using the Intelligent Behavior Recognition Technique (지능형 행동인식 기술을 이용한 실시간 동영상 감시 시스템 개발)

  • Chang, Jae-Young;Hong, Sung-Mun;Son, Damy;Yoo, Hojin;Ahn, Hyoung-Woo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.2
    • /
    • pp.161-168
    • /
    • 2019
  • Recently, video equipments such as CCTV, which is spreading rapidly, is being used as a means to monitor and cope with abnormal situations in almost governments, companies, and households. However, in most cases, since recognizing the abnormal situation is carried out by the monitoring person, the immediate response is difficult and is used only for post-analysis. In this paper, we present the results of the development of video surveillance system that automatically recognizing the abnormal situations and sending such events to the smartphone immediately using the latest deep learning technology. The proposed system extracts skeletons from the human objects in real time using Openpose library and then recognizes the human behaviors automatically using deep learning technology. To this end, we reconstruct Openpose library, which developed in the Caffe framework, on Darknet framework to improve real-time processing. We also verified the performance improvement through experiments. The system to be introduced in this paper has accurate and fast behavioral recognition performance and scalability, so it is expected that it can be used for video surveillance systems for various applications.

Further Improvement of Direct Solution-based FETI Algorithm (직접해법 기반의 FETI 알고리즘의 개선)

  • Kang, Seung-Hoon;Gong, DuHyun;Shin, SangJoon
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.35 no.5
    • /
    • pp.249-257
    • /
    • 2022
  • This paper presents an improved computational framework for the direct-solution-based finite element tearing and interconnecting (FETI) algorithm. The FETI-local algorithm is further improved herein, and localized Lagrange multipliers are used to define the interface among its subdomains. Selective inverse entry computation, using a property of the Boolean matrix, is employed for the computation of the subdomain interface stiffness and load, in which the original FETI-local algorithm requires a full matrix inverse computation of a high computational cost. In the global interface computation step, the original serial computation is replaced by a parallel multi-frontal method. The performance of the improved FETI-local algorithm was evaluated using a numerical example with 64 million degrees of freedom (DOFs). The computational time was reduced by up to 97.8% compared to that of the original algorithm. In addition, further stable and improved scalability was obtained in terms of a speed-up indicator. Furthermore, a performance comparison was conducted to evaluate the differences between the proposed algorithm and commercial software ANSYS using a large-scale computation with 432 million DOFs. Although ANSYS is superior in terms of computational time, the proposed algorithm has an advantage in terms of the speed-up increase per processor increase.

Study of MongoDB Architecture by Data Complexity for Big Data Analysis System (빅데이터 분석 시스템 구현을 위한 데이터 구조의 복잡성에 따른 MongoDB 환경 구성 연구)

  • Hyeopgeon Lee;Young-Woon Kim;Jin-Woo Lee;Seong Hyun Lee
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.16 no.5
    • /
    • pp.354-361
    • /
    • 2023
  • Big data analysis systems apply NoSQL databases like MongoDB to store, process, and analyze diverse forms of large-scale data. MongoDB offers scalability and fast data processing speeds through distributed processing and data replication, depending on its configuration. This paper investigates the suitable MongoDB environment configurations for implementing big data analysis systems. For performance evaluation, we configured both single-node and multi-node environments. In the multi-node setup, we expanded the number of data nodes from two to three and measured the performance in each environment. According to the analysis, the processing speeds for complex data structures with three or more dimensions are approximately 5.75% faster in the single-node environment compared to an environment with two data nodes. However, a setting with three data nodes processes data about 25.15% faster than the single-node environment. On the other hand, for simple one-dimensional data structures, the multi-node environment processes data approximately 28.63% faster than the single-node environment. Further research is needed to practically validate these findings with diverse data structures and large volumes of data.

Personalized Exhibition Booth Recommendation Methodology Using Sequential Association Rule (순차 연관 규칙을 이용한 개인화된 전시 부스 추천 방법)

  • Moon, Hyun-Sil;Jung, Min-Kyu;Kim, Jae-Kyeong;Kim, Hyea-Kyeong
    • Journal of Intelligence and Information Systems
    • /
    • v.16 no.4
    • /
    • pp.195-211
    • /
    • 2010
  • An exhibition is defined as market events for specific duration to present exhibitors' main product range to either business or private visitors, and it also plays a key role as effective marketing channels. Especially, as the effect of the opinions of the visitors after the exhibition impacts directly on sales or the image of companies, exhibition organizers must consider various needs of visitors. To meet needs of visitors, ubiquitous technologies have been applied in some exhibitions. However, despite of the development of the ubiquitous technologies, their services cannot always reflect visitors' preferences as they only generate information when visitors request. As a result, they have reached their limit to meet needs of visitors, which consequently might lead them to loss of marketing opportunity. Recommendation systems can be the right type to overcome these limitations. They can recommend the booths to coincide with visitors' preferences, so that they help visitors who are in difficulty for choices in exhibition environment. One of the most successful and widely used technologies for building recommender systems is called Collaborative Filtering. Traditional recommender systems, however, only use neighbors' evaluations or behaviors for a personalized prediction. Therefore, they can not reflect visitors' dynamic preference, and also lack of accuracy in exhibition environment. Although there is much useful information to infer visitors' preference in ubiquitous environment (e.g., visitors' current location, booth visit path, and so on), they use only limited information for recommendation. In this study, we propose a booth recommendation methodology using Sequential Association Rule which considers the sequence of visiting. Recent studies of Sequential Association Rule use the constraints to improve the performance. However, since traditional Sequential Association Rule considers the whole rules to recommendation, they have a scalability problem when they are adapted to a large exhibition scale. To solve this problem, our methodology composes the confidence database before recommendation process. To compose the confidence database, we first search preceding rules which have the frequency above threshold. Next, we compute the confidences of each preceding rules to each booth which is not contained in preceding rules. Therefore, the confidence database has two kinds of information which are preceding rules and their confidence to each booth. In recommendation process, we just generate preceding rules of the target visitors based on the records of the visits, and recommend booths according to the confidence database. Throughout these steps, we expect reduction of time spent on recommendation process. To evaluate proposed methodology, we use real booth visit records which are collected by RFID technology in IT exhibition. Booth visit records also contain the visit sequence of each visitor. We compare the performance of proposed methodology with traditional Collaborative Filtering system. As a result, our proposed methodology generally shows higher performance than traditional Collaborative Filtering. We can also see some features of it in experimental results. First, it shows the highest performance at one booth recommendation. It detects preceding rules with some portions of visitors. Therefore, if there is a visitor who moved with very a different pattern compared to the whole visitors, it cannot give a correct recommendation for him/her even though we increase the number of recommendation. Trained by the whole visitors, it cannot correctly give recommendation to visitors who have a unique path. Second, the performance of general recommendation systems increase as time expands. However, our methodology shows higher performance with limited information like one or two time periods. Therefore, not only can it recommend even if there is not much information of the target visitors' booth visit records, but also it uses only small amount of information in recommendation process. We expect that it can give real?time recommendations in exhibition environment. Overall, our methodology shows higher performance ability than traditional Collaborative Filtering systems, we expect it could be applied in booth recommendation system to satisfy visitors in exhibition environment.

An efficient interconnection network topology in dual-link CC-NUMA systems (이중 연결 구조 CC-NUMA 시스템의 효율적인 상호 연결망 구성 기법)

  • Suh, Hyo-Joong
    • The KIPS Transactions:PartA
    • /
    • v.11A no.1
    • /
    • pp.49-56
    • /
    • 2004
  • The performance of the multiprocessor systems is limited by the several factors. The system performance is affected by the processor speed, memory delay, and interconnection network bandwidth/latency. By the evolution of semiconductor technology, off the shelf microprocessor speed breaks beyond GHz, and the processors can be scalable up to multiprocessor system by connecting through the interconnection networks. In this situation, the system performances are bound by the latencies and the bandwidth of the interconnection networks. SCI, Myrinet, and Gigabit Ethernet are widely adopted as a high-speed interconnection network links for the high performance cluster systems. Performance improvement of the interconnection network can be achieved by the bandwidth extension and the latency minimization. Speed up of the operation clock speed is a simple way to accomplish the bandwidth and latency betterment, while its physical distance makes the difficulties to attain the high frequency clock. Hence the system performance and scalability suffered from the interconnection network limitation. Duplicating the link of the interconnection network is one of the solutions to resolve the bottleneck of the scalable systems. Dual-ring SCI link structure is an example of the interconnection network improvement. In this paper, I propose a network topology and a transaction path algorism, which optimize the latency and the efficiency under the duplicated links. By the simulation results, the proposed structure shows 1.05 to 1.11 times better latency, and exhibits 1.42 to 2.1 times faster execution compared to the dual ring systems.

A Design of Low Cost Differential GPS System based on Web-Service (웹서비스 기반의 저가형 위성항법보정시스템 설계)

  • Jung, Se-Hoon;Seo, Ho-Seok;Park, Dong-Gook;Sim, Chun-Bo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.3
    • /
    • pp.487-498
    • /
    • 2013
  • A variety of location-based services applications, such as missing children search, emergency rescue requests and so on that requiring high-precision location information are increasing. Precision of GPS that can be used in most systems, however, is still low. In this paper, we design and propose a low cost differential global positioning system(DGPS) based on Web services using object-oriented modeling technique which can offer useable location service, variety device and safe service in wireless environment. The proposed system is designed with UML based on object-oriented modeling to maximize system recyclability and system scalability. In addition, we would like to improve the precision of the GPS in accordance with mobile station location when build low cost mobile station, location differential framework and server. We implement a communication interface based on web-service which is available in the form of a variety of services and can offer stable according to mobile environments. Finally, as performance evaluation results, we can obtain precision location within 1 ~ 2m through proposed system and 88.5% probability of less than 2m.

The Impact of Changes in Social Information Processing Mechanism on Social Consensus Making in the Information Society (정보화사회에 있어서 사회적 정보처리 메커니즘의 변화가 사회적 컨센서스 형성에 미치는 영향에 대한 연구)

  • Jin, Seung-Hye;Kim, Yong-Jin
    • Information Systems Review
    • /
    • v.13 no.3
    • /
    • pp.141-163
    • /
    • 2011
  • The advancement of information technologies including the Internet has affected the way of social information processing as well as brought about the paradigm shift to the information society. Accordingly, it is very important to study the process of social information processing over the digital media through which social information is generated, distributed, and led to social consensus. In this study, we analyze the mechanism of social information processing, identify a process model of social consensus and institutionalization of the results, and finally propose a set of information processing characteristics on the internet media. We deploy the ethnographic approach to analyze the meaning of group behavior in the context of society to analyze two major events which happened in Korean society. The formation process of social consensus is found to consist of 5 steps: suggestion of social issues, selective reflection on public opinion, acceptance of the issues and diffusion, social consensus, and institutionalization and feedback. The key characteristics of information processing in the Internet is grouped into proactive response to an event, the changes in the role of opinion leader, the flexibility of proposal and analysis, greater scalability, relevance to consensus making, institutionalization and interaction. This study contributes to the literature by proposing a process model of social information processing which can be used as the basis for analyzing the social consensus making process from the social network perspective. In addition, this study suggests a new perspective where the utility of the Internet media can be understood from the social information processing so that other disciplines including politics, communications, and management can improve the decision making performance in utilizing the Internet media.

Distributed Mobility Management Scheme in LTE/SAE Networks (LTE/SAE 네트워크에서 분산 이동성 관리 기법)

  • Kim, Yong-Hwan;Han, Youn-Hee;Kim, Min;Park, Seok Yong;Moon, Sang Jun;Lee, Jin Ho;Choi, Dae Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.11
    • /
    • pp.879-894
    • /
    • 2013
  • Recently, due to a explosive growth in the mobile Internet traffic, the problem of excessive data traffic handling on core network and thus scalability problem have been magnified in 3GPP LTE/SAE networks. Current LTE/SAE network based on the central P-GW (PDN Gateway) used as mobility anchor cannot deal with such demand for exponentially increasing mobile Internet traffic. In this paper, we propose a new LTE/SAE network architecture supporting distributed P-GWs and corresponding distributed mobility management to solve these problems. For this, in addition to the deployment of such distributed P-GWs, we propose a dynamic and distributed mobility management by distributing MMEs (Mobility Management Entities) which dynamically manages the location information of a UE's PDN connection, and also propose a handover procedure of such PDN connections by using the proposed distributed P-GWs and MMEs. The performance of the proposed dynamic and distributed LTE/SAE network system is compared with the current LTE/SAE network system in terms of handover latency and network throughput.