• 제목/요약/키워드: Load-balancing

검색결과 924건 처리시간 0.022초

Generic Scheduling Method for Distributed Parallel Systems (분산병렬 시스템에서 유전자 알고리즘을 이용한 스케쥴링 방법)

  • Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • 제28권1B호
    • /
    • pp.27-32
    • /
    • 2003
  • This paper presents the Genetic Algorithm based Task Scheduling (GATS) method for the scheduling of programs with diverse embedded parallelism types in Distributed Parallel Systems, which consist of a set of loosely coupled parallel and vector machines connected via high speed networks The distributed parallel processing tries to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. When scheduling in distributed parallel systems, the matching of the parallelism characteristics between tasks and parallel machines rather than load balancing should be carefully handled with the minimization of communication cost in order to obtain more speedup. This paper proposes the based initialization methods for an initial population and the knowledge-based mutation methods to accommodate the parallelism type matching in genetic algorithms.

Toward manageable middleboxes in software-defined networking

  • Zadkhosh, Ehsan;Bahramgiri, Hossein;Sabaei, Masoud
    • ETRI Journal
    • /
    • 제42권2호
    • /
    • pp.186-195
    • /
    • 2020
  • Software-defined networking (SDN) acts as a centralized management unit, especially in a network with devices that operate under the transport layer of the OSI model. However, when a network with layer 7 middleboxes (MBs) is considered, current SDNs exhibit limitations. As such, to achieve a real-centralized management unit, a new architecture is required that decouples the data and control planes of all network devices. In this report, we propose such a complementary architecture to the current SDN in which SDN-enabled MBs are included along with contemporary SDN-enabled switches. The management unit of this architecture improves network performance and reduces routing cost by considering the status of the MBs during flow forwarding. This unit consists of the following two parts: an SDN controller (SDNC) and a middlebox controller (MBC). The latter selects the best MBs for each flow and the former determines the best path according to its routing algorithm and provides information via the MBC. The results show that the proposed architecture improved performance because the utilization of all network devices including MBs is manageable.

A supervised-learning-based spatial performance prediction framework for heterogeneous communication networks

  • Mukherjee, Shubhabrata;Choi, Taesang;Islam, Md Tajul;Choi, Baek-Young;Beard, Cory;Won, Seuck Ho;Song, Sejun
    • ETRI Journal
    • /
    • 제42권5호
    • /
    • pp.686-699
    • /
    • 2020
  • In this paper, we propose a supervised-learning-based spatial performance prediction (SLPP) framework for next-generation heterogeneous communication networks (HCNs). Adaptive asset placement, dynamic resource allocation, and load balancing are critical network functions in an HCN to ensure seamless network management and enhance service quality. Although many existing systems use measurement data to react to network performance changes, it is highly beneficial to perform accurate performance prediction for different systems to support various network functions. Recent advancements in complex statistical algorithms and computational efficiency have made machine-learning ubiquitous for accurate data-based prediction. A robust network performance prediction framework for optimizing performance and resource utilization through a linear discriminant analysis-based prediction approach has been proposed in this paper. Comparison results with different machine-learning techniques on real-world data demonstrate that SLPP provides superior accuracy and computational efficiency for both stationary and mobile user conditions.

Big Data Decision Analysis of Stress on Adolescent Mental Health

  • Park, Jinhyeok;Kang, Un Gu;Lee, Youngho
    • Journal of the Korea Society of Computer and Information
    • /
    • 제22권11호
    • /
    • pp.89-96
    • /
    • 2017
  • This study analyzed how mental health affects stress in adolescents. The subjects of the study were data of about 60,000 middle and high school students living in the country, using cross-tabulation data and chi - square test to analyze the relationship between stress and mental health of adolescents. As a result of the research, it was found that the adolescents exposed to the excessive stress showed a poor correlation with the recovery of the fatigue, while the adolescents with relatively low stress showed the good recovery of fatigue. In the case of mental illness, depression or despair, the students who answered that they were stressed showed a lot of experience. In the case of suicide ideation, suicide attempt, and suicide attempt, the number of attempts to commit suicide was high when the level of perceived stress was high similar to the result of previous analysis. This finding confirms that stress is an important factor in the quality of life in adolescent mental health. It can be used as a strategy and business to prevent the problem of youth suicide in modern society in advance by stress management.

Scate: A Scalable Time and Energy Aware Actor Task Allocation Algorithm in Wireless Sensor and Actor Networks

  • Sharifi, Mohsen;Okhovvat, Morteza
    • ETRI Journal
    • /
    • 제34권3호
    • /
    • pp.330-340
    • /
    • 2012
  • In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

A Disaster Evacuation System Using Smart Devices for Indoor Crisis Management in BLE Environments (BLE 환경에서 실내 위기관리를 위한 스마트 장치 기반의 재난대피 시스템)

  • Jang, Minsoo;Jeong, Wooyong;Lim, Kyungshik
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • 제10권5호
    • /
    • pp.281-296
    • /
    • 2015
  • This paper describes a novel disaster evacuation system using embedded systems such as smart devices for crisis and emergency management. In indoor environments deployed with the Bluetooth Low Energy(BLE) beacons, smart devices detect their indoor positions from beacon messages and interact with Map Server(MS) and Route Server(RS) in the Internet over the LTE and/or Wi-Fi functions. The MS and RS generate an optimal path to the nearest emergency exit based on a novel graph generation method for less route computation, called the Disaster Evacuation Graph(DEG), for each smart device. The DEG also enables efficient processing of some constraints in the computation of route, such as load balancing in situation of different capacities of paths or exits. All data interfaces among three system components, the MS, RS, smart devices, have been defined for modular implementation of our disaster evacuation system. Our experimental system has been deployed and tested in our building thoroughly and gives a good evidence that the modular design of the system and a novel approach to compute emergency route based on the DEG is competitive and viable.

Design of a Real-Time Facility Diagnosis & Complex Data Management System Using IT Convergence Technology (IT융합기술을 활용한 실시간 설비진단 및 복합정보 관리시스템 설계)

  • Kang, Moon-Sik
    • Journal of the Korea Society of Computer and Information
    • /
    • 제19권5호
    • /
    • pp.53-60
    • /
    • 2014
  • With the rapid development of IT technology, recently, the development of IT convergence technology related to the facility diagnosis is prevalent, and the study for the efficient integrated management scheme is required to handle all relevant information, from the design to the maintenance, including the stage of repair. In this paper, an efficient scheme to process the complex data for the facility and its diagnosis is proposed based on IT convergence technique and the real-time complex data management is designed. In order to evaluate the performance of the proposed system, the real-time management system is designed for a particular facility, and the comparative results show the good performance of the proposed system.

A Study on Distributed & Intelligent Platform for Digital Contents (디지털 콘텐츠 저장 및 유통을 위한 분산 지능형 플랫폼에 관한 연구)

  • 장연세;임승린;나오키엔도
    • Journal of the Korea Society of Computer and Information
    • /
    • 제8권3호
    • /
    • pp.53-60
    • /
    • 2003
  • In these day, Digital Contents is authorized in forms of HTML and various kind of multi-media by an enterprise and/or organization. At this circumstances, it is very hard or impossible to search a contents between them. Futhermore, you may have to change your contents service systems to extend to cover more user services needs. On this paper, we propose a new architecture to get extendability and empowered interoperability without any maintenance, update or changes. And we introduce the OMG's CORBA to make fault resilient system and to provide a load balancing using a distributed process mechanism. Even more, we adopted the SyncML specification. It can help us to make it real to synchronize between DBMS at real-time. So all these are support easy content synchronization and user-friendness.

  • PDF

Design and Implementation of School Affairs Management System using PHP on the Internet (인터넷 상에서 PHP를 이용한 학사관리 시스템의 설계 및 구현)

  • Moon, Jin-Yong;Koo, Yong-Wan
    • The Transactions of the Korea Information Processing Society
    • /
    • 제7권10호
    • /
    • pp.3148-3154
    • /
    • 2000
  • In this paper. the design and implementationof the on-line registration system for the school affairs is described. The environments for the system configurations include a PC server under Linux Iperating System. Apache Web-server, and MySQL as database engine. In addition, PHP, which becomes a popular Internet server-based script language lately, is used to implement a real-time database. In order to avoid overload problems during short-term registration period, which deconstraces the typical surge of traffics, the proposed system is designed to minimize the unnecessary interfacing tasks. On administrator side task, the sytem is designed to have environments by separating the dechcated server that restricts the scope of specific database thasks. In doing so, it become possibal to build an optical system by distributing, balancing the transaction load, maintainimg the security and efficient administrative tasks.

  • PDF

Analysis of the Load Balancing Algorithms according to the Request Patterns on the LVS Cluster Systems (LVS 클러스터 시스템의 요구 패턴에 따른 부하 분산 알고리즘 분석)

  • Li, Shan-Hong;Kim, Sung-Ki;Na, Yong-Hee;Min, Byoung-Joon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 한국정보처리학회 2002년도 추계학술발표논문집 (상)
    • /
    • pp.151-154
    • /
    • 2002
  • 갈수록 증가하는 인터넷 사용자의 서비스 요구량에 대처하기 위해, 부하 분산 기능을 갖는 클러스터 시스템의 이용이 늘어가고 있다. 본 연구에서는 클라이언트에게 보다 향상된 응답 성능을 제공하기 위해 사용되는 RR(Round Robin), WRR(Weighted Round Robin), LC(Least Connection), WLC(Weighted Least Connection) 부하 분산 알고리즘에 대해서, 클라이언트로부터 인입되는 7 가지 요구 수신 패턴에 따른 부하 분산 응답 특성을 분석하고 그 결과를 논한다. 이를 위해, 실제 시스템의 측정 결과를 토대로 단위 시간 당 인입되는 클라이언트의 요구량 변화를 7 가지 패턴으로 분류하였고, 리눅스 가상 서버(LVS: Linux Virtual Server) 클러스터 시스템을 대상으로 7 가지 요구 패턴에 대한 부하 분산 응답 특성을 얻었다. 본 연구를 통해서 클라이언트 요구랑 변화 패턴에 따른 최적의 부하 분산 알고리즘을 제시할 수 있었다. 본 연구 결과는 향후 효율적인 동적 부하 분산 연구에 좋은 참고가 될 것이다.

  • PDF