• Title/Summary/Keyword: Client-cluster

Search Result 49, Processing Time 0.024 seconds

Landscape Design of Osong Biohealth Technopolis Institute (오송 생명과학단지 조경설계)

  • Kim Do-Kyong;Kim Kyoung-Lyul
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.33 no.1 s.108
    • /
    • pp.109-120
    • /
    • 2005
  • This landscape design proposal was presented to a design competition for Osong Biohealth Technopolis Institute of Cheongwon Gun Chung Cheong Buk Do which was held by Ministry of Health and Welfare in March 2004. The site is located in. Osong Li, Kang Wei Myun, Cheonwon Gun, Chung Cheong Buk Do and has an area of $402,600m^2$. The judging criteria for landscape design set by the client could be articulated as follows: an environment friendly design respecting the surrounding environment, a functionally efficient site plan by clustering buildings with similar uses, a site plan having 'front yard' by locating buildings in rear areas toward existing 'groves'. The proposal set the main design concept of this project as 'clustering'. By doing that, existing grades and plants can be saved, buildings with similar uses can be clustered, huge 'front yard' as a symbolic image of this project can be achieved, and finally many small open spaces for everyday life can be designed accordingly.

Cluster-based VOD System for Heterogeneous Client Platform (이질적인 클라이언트 플랫폼을 위한 클러스터 VOD 시스템)

  • Seo, Dong-Mahn;Park, Chong-Myung;Kim, Dong-Gook;Kim, Yoon;Jung, In-Bum
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.1413-1416
    • /
    • 2005
  • VOD 시스템이 상업적으로 성공하기 위해서는 많은 사용자에게 우수한 질의 다양한 컨텐츠를 스트리밍 서비스하는 것이 중요하다. 최근 대규모의 사용자와 사용자들의 다양한 요구를 만족시키기 위하여 클러스터 서버 환경에서의 VOD 시스템이 연구되고 있다. 본 논문에서는 이질적인 클라이언트 플랫폼 사용자들의 모든 요청을 지원하기 위한 통합 VOD 시스템을 제안한다. 제안된 시스템은 고화질의 WMV 미디어와 표준 수준의 미디어들에 대한 스트리밍 서비스를 제공한다. 또한, 무선 네트워크 환경의 사용자들을 위한 네트워크 적응적 스트리밍 미디어 서비스를 제공하기위한 방안을 제시한다.

  • PDF

Design and Implementation of Event Channel Service for Distributed Environment (분산 환경을 위한 이벤트 채널 서비스의 설계 및 구현)

  • 안형근;한영태;민덕기
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.484-485
    • /
    • 2003
  • 고전적인 Client/server환경에서의 통신은 Lan 환경하의 동기적 일대일 통신 기반 이였다. 그러나 인터넷이 확산되고 일반화되면서 많은 소프트웨어들은 Cluster 또는 Grid 같은 분산시스템 환경과 핸드폰, PDA 같은 Mobile환경에서 개발되고 있다. 이러한 환경은 WAN기반의 비동기적 일대다 다대다 통신을 기반으로 한다. 본 논문은 이러한 환경에 적합한 애플리케이션에 독립적이고 비동기 통신을 제공하며 각 통신요소(Event Supplier, Consumer)를 그룹으로 묶어 동적으로 관리해주는 기능을 제공하는 Event Channel Service를 제안한다. 이 Event Channel Service는 Event Channel을 사용하여 Event Supplier와 Consumer를 분리하며 Push. Pull 방식으로 Event를 전달할 수 있는 구조를 제공한다. 또한 다양한 Protocol을 지원하고 Quality of Service를 제공한다.

  • PDF

Workflow Scheduling Using Heuristic Scheduling in Hadoop

  • Thingom, Chintureena;Kumar R, Ganesh;Yeon, Guydeuk
    • Journal of information and communication convergence engineering
    • /
    • v.16 no.4
    • /
    • pp.264-270
    • /
    • 2018
  • In our research study, we aim at optimizing multiple load in cloud, effective resource allocation and lesser response time for the job assigned. Using Hadoop on datacenter is the best and most efficient analytical service for any corporates. To provide effective and reliable performance analytical computing interface to the client, various cloud service providers host Hadoop clusters. The previous works done by many scholars were aimed at execution of workflows on Hadoop platform which also minimizes the cost of virtual machines and other computing resources. Earlier stochastic hill climbing technique was applied for single parameter and now we are working to optimize multiple parameters in the cloud data centers with proposed heuristic hill climbing. As many users try to priorities their job simultaneously in the cluster, resource optimized workflow scheduling technique should be very reliable to complete the task assigned before the deadlines and also to optimize the usage of the resources in cloud.

A Dynamic Hashing Based Load Balancing for a Scalable Wireless Internet Proxy Server Cluster (확장성 있는 무선 인터넷 프록시 서버 클러스터를 위한 동적 해싱 기반의 부하분산)

  • Kwak, Hu-Keun;Kim, Dong-Seung;Chung, Kyu-Sik
    • The KIPS Transactions:PartA
    • /
    • v.14A no.7
    • /
    • pp.443-450
    • /
    • 2007
  • Performance scalability and storage scalability become important in a large scale cluster of wireless internet proxy cache servers. Performance scalability means that the whole performance of the cluster increases linearly according as servers are added. Storage scalability means that the total size of cache storage in the cluster is constant, regardless of the number of cache servers used, if the whole cache data are partitioned and each partition is stored in each server, respectively. The Round-Robin based load balancing method generally used in a large scale server cluster shows the performance scalability but no storage scalability because all the requested URL data need to be stored in each server. The hashing based load balancing method shows storage scalability because all the requested URL data are partitioned and each partition is stored in each server, respectively. but, it shows no performance scalability in case of uneven pattern of client requests or Hot-Spot. In this paper, we propose a novel dynamic hashing method with performance and storage scalability. In a time interval, the proposed scheme keeps to find some of requested URLs allocated to overloaded servers and dynamically reallocate them to other less-loaded servers. We performed experiments using 16 PCs and experimental results show that the proposed method has the performance and storage scalability as different from the existing hashing method.

Structuralization Expected Outcome of Social Welfare Program Based on Community Network : Using Concept Mapping Method (지역사회네트워크를 기반으로 한 사회복지프로그램 기대성과 구조화 : 컨셉트 맵핑(concept mapping)을 활용하여)

  • Kwon, Sunae
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.5
    • /
    • pp.107-116
    • /
    • 2014
  • The purpose of this study is to verify the applicability of concept mapping in the process of planning social welfare program based on community network. Concept mapping is a kind of decision-making method that structuralized complex ideas and presented visually. Already, concept mapping is widely utilized in counseling, nursing and public health area to plan and evaluation their program and service. For recent, effectiveness of concept mapping has been reported. Concept mapping is a effective decision-making method that they recognize outcome gap between service provider and client, reach the outcome's consensus in counseling and nursing, medical area. In this study, we conceptualized 3rd year outcomes of Community Impact Project that was supported from Busan Chest using concept mapping. This CI project intervenes children and youth who lives in Buk-gu, Busan. Concept mapping has six stages-preparation, collecting ideas, structuring statements, representing statement, interpreting the results of the analysis, applying the results. We followed these steps. The participants were working at social welfare organizations, total 11 persons. We obtained 60 statements and analyzed using multidimensional scaling. we collected 5 clusters, cluster 1 'awareness and attitude change of children and youth', cluster 2 'social system change of children and youth', cluster 3 'friendly community formation', cluster 4 'community people change', cluster 5 'service provider change'. As a result, among total 5 clusters formed, 'awareness and attitude change of children and youth' came to the strongest outcomes. When concept mapping was applied to the program planning, the consensus of the opinion came easily in the decision-making process, and the participants were empowered. In addition, clear conceptualization on each element of the program planning was made.

High-Availability Web Server Cluster Employing Multiple Front-Ends for Small and Middle-sized Web Sites (중소형 사이트를 위한 다수의 전면 서버를 갖는 고가용성 웹 서버 클러스터)

  • Moon Jong-bae;Kim Myung-ho
    • The KIPS Transactions:PartA
    • /
    • v.11A no.5
    • /
    • pp.355-364
    • /
    • 2004
  • These days, various clustering technologies have been adopted to construct web sites. High performance hardware switches have good performance, but have disadvantage of high cost for constructing small and middle-sized web sites. Now a days, many sites have been constructed with the LVS (Linux Virtual Server), which is free of charge and has good performance. Having a centralized load balancing with one front-end, the LVS causes a bottleneck when it receives all at once. In the paper, we suggest a way to remove the LVS bottleneck by providing multiple front-ends. In this architecture, all of cluster nodes act as both a front-end and a back-end. When the load of a node receiving requests is not large enough, the node responds to the client directly. When the load of a node is large enough, the node send the request to a node which is selected by a scheduling algorithm. The scheduling algorithm is discussed to balance loads between servers. While single front-end cluster raises the throughput curvedly, the multiple front-end cluster raises the throughput linearly.

Multi-platform Visualization System for Earth Environment Data (지구환경 데이터를 위한 멀티플랫폼 가시화 시스템)

  • Jeong, Seokcheol;Jung, Seowon;Kim, Jongyong;Park, Sanghun
    • Journal of the Korea Computer Graphics Society
    • /
    • v.21 no.3
    • /
    • pp.36-45
    • /
    • 2015
  • It is important subject of research in engineering and natural science field that creating continuing high-definition image from very large volume data. The necessity of software that helps analyze useful information in data has improved by effectively showing visual image information of high resolution data with visualization technique. In this paper, we designed multi-platform visualization system based on client-server to analyze and express earth environment data effectively constructed with observation and prediction. The visualization server comprised of cluster transfers data to clients through parallel/distributed computing, and the client is developed to be operated in various platform and visualize data. In addition, we aim user-friendly program through multi-touch, sensor and have made realistic simulation image with image-based lighting technique.

A Self-Learning based Adaptive Clustering in a Wireless Internet Proxy Server Environment (무선 인터넷 프록시 서버 환경에서 자체 학습 기반의 적응적 클러스터렁)

  • Kwak Hu-Keun;Chung Kyu-Sik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.399-412
    • /
    • 2006
  • A clustering based wireless internet proxy server with cooperative caching has a problem of minimizing overall performance because some servers become overloaded if client request pattern is Hot-Spot or uneven. We propose a self-learning based adaptive clustering scheme to solve the poor performance problems of the existing clustering in case of Hot-Spot or uneven client request pattern. In the proposed scheme, requests are dynamically redistributed to the other servers if some servers supposed to handle the requests become overloaded. This is done by a self-learning based method based dynamic weight adjustment algorithm so that it can be applied to a situation with even various request pattern or a cluster of hosts with different performance. We performed experiments in a clustering environment with 16 PCs and a load balancer. Experimental results show the 54.62% performance improvement of the proposed schemes compared to the existing schemes.

NGSOne: Cloud-based NGS data analysis tool (NGSOne: 클라우드 기반의 유전체(NGS) 데이터 분석 툴)

  • Kwon, Chang-hyuk;Kim, Jason;Jang, Jeong-hwa;Ahn, Jae-gyoon
    • Journal of Platform Technology
    • /
    • v.6 no.4
    • /
    • pp.87-95
    • /
    • 2018
  • With the decrease of sequencing price, many national projects that analyzes 0.1 to 1 million people are now in progress. However, large portion of budget of these large projects is dedicated for construction of the cluster system or purchase servers, due to the lack of programs or systems that can handle large amounts of data simultaneously. In this study, we developed NGSOne, a client program that is easy-to-use for even biologists, and performs SNP analysis using hundreds or more of Whole Genome and Whole Exome analysis without construction of their own server or cluster environment. DRAGEN, BWA / GATK, and Isaac / Strelka2, which are representative SNP analysis tools, were selected and DRAGEN showed the best performance in terms of execution time and number of errors. Also, NGSOne can be extended for various analysis tools as well as SNP analysis tools.