• 제목/요약/키워드: distributed programming

검색결과 288건 처리시간 0.025초

멀티미디어 클라이언트-서버 응용 개발 도구인 한우리/C의 미들웨어 (Middleware on Hanuri/C as a Multimedia Client-Server Application Development Tool)

  • 임채덕
    • 한국정보처리학회논문지
    • /
    • 제2권5호
    • /
    • pp.797-806
    • /
    • 1995
  • 본 논문에서는 기존의 클라이언트-서버 응용 개발 도구에 비해서 멀티미디어 처리 기능이 강화되고, 분산 시스템 소프트웨어의 전위(Front-End) 역할을 수행하는 멀티미 디어 클라이언트-서버 응용 개발 도구(한우리/C)를 제안한다. 한우리/C는 분산 처리 환경(Distributed Computing Environment:DCE)위에서 멀티미디어 응용 개발을 지원하 는 제 4세대 언어 형태의 클라이언트-서버 도구이다. 본 논문에서는 한우리/C를 구성 하는 요소등을 중에서 미들웨어 부분에 대한 설계와 구현된 내용을 설명한다.

  • PDF

Energy-Efficiency of Distributed Antenna Systems Relying on Resource Allocation

  • Huang, Xiaoge;Zhang, Dongyu;Dai, Weipeng;Tang, She
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권3호
    • /
    • pp.1325-1344
    • /
    • 2019
  • Recently, to satisfy mobile users' increasing data transmission requirement, energy efficiency (EE) resource allocation in distributed antenna systems (DASs) has become a hot topic. In this paper, we aim to maximize EE in DASs subject to constraints of the minimum data rate requirement and the maximum transmission power of distributed antenna units (DAUs) with different density distributions. Virtual cell is defined as DAUs selected by the same user equipment (UE) and the size of virtual cells is dependent on the number of subcarriers and the transmission power. Specifically, the selection rule of DAUs is depended on different scenarios. We develop two scenarios based on the density of DAUs, namely, the sparse scenario and the dense scenario. In the sparse scenario, each DAU can only be selected by one UE to avoid co-channel interference. In order to make the original non-convex optimization problem tractable, we transform it into an equivalent fractional programming and solve by the following two sub-problems: optimal subcarrier allocation to find suitable DAUs; optimal power allocation for each subcarrier. Moreover, in the dense scenario, we consider UEs could access the same channel and generate co-channel interference. The optimization problem could be transformed into a convex form based on interference upper bound and fractional programming. In addition, an energy-efficient DAU selection scheme based on the large scale fading is developed to maximize EE. Finally, simulation results demonstrate the effectiveness of the proposed algorithm for both sparse and dense scenarios.

엣지 디바이스에서의 병렬 프로그래밍 모델 성능 비교 연구 (A Performance Comparison of Parallel Programming Models on Edge Devices)

  • 남덕윤
    • 대한임베디드공학회논문지
    • /
    • 제18권4호
    • /
    • pp.165-172
    • /
    • 2023
  • Heterogeneous computing is a technology that utilizes different types of processors to perform parallel processing. It maximizes task processing and energy efficiency by leveraging various computing resources such as CPUs, GPUs, and FPGAs. On the other hand, edge computing has developed with IoT and 5G technologies. It is a distributed computing that utilizes computing resources close to clients, thereby offloading the central server. It has evolved to intelligent edge computing combined with artificial intelligence. Intelligent edge computing enables total data processing, such as context awareness, prediction, control, and simple processing for the data collected on the edge. If heterogeneous computing can be successfully applied in the edge, it is expected to maximize job processing efficiency while minimizing dependence on the central server. In this paper, experiments were conducted to verify the feasibility of various parallel programming models on high-end and low-end edge devices by using benchmark applications. We analyzed the performance of five parallel programming models on the Raspberry Pi 4 and Jetson Orin Nano as low-end and high-end devices, respectively. In the experiment, OpenACC showed the best performance on the low-end edge device and OpenSYCL on the high-end device due to the stability and optimization of system libraries.

Challenges in Distributed Agile Software Development Environment: A Systematic Literature Review

  • Ghani, Imran;Lim, Angelica;Hasnain, Muhammad;Ghani, Israr;Babar, Muhammad Imran
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제13권9호
    • /
    • pp.4555-4571
    • /
    • 2019
  • Due to increasing interest in distributed agile software development, there is a need to systematically review the literature on challenges encountered in the agile software development environment. Using the Systematic Literature Review (SLR) approach, 32 relevant publications, dated between 2013 and 2018 were selected from four electronic databases. Data from these publications were extracted to identify the key challenges across the system development life cycle (SDLC) phases, which essentially are short phases in each agile-based iteration. 5 types of key challenges were identified as impacting the SDLC phases; these challenges are Communication, Coordination, Cooperation, Collaboration and Control. In the context of the SLDC phases, the Communication challenge was discussed the most often (79 times, 33%). The least discussed challenges were Cooperation and Collaboration (26 times, 11% each). The 5 challenges occur because of distances which occur in distributed environment. This SLR identified 4 types of distances which contribute to the occurrence of these key challenges - physical, temporal, social-cultural and knowledge/experience. Of the 32 publications, only 4 included research which proposed new solutions to address challenges in agile distributed software development. The authors of this article believe that the findings in this SLR are a resource for future research work to deepen the understanding of and to develop additional solutions to address the challenges in distributed agile software development.

Uncertain Centralized/Decentralized Production-Distribution Planning Problem in Multi-Product Supply Chains: Fuzzy Mathematical Optimization Approaches

  • Khalili-Damghani, Kaveh;Ghasemi, Peiman
    • Industrial Engineering and Management Systems
    • /
    • 제15권2호
    • /
    • pp.156-172
    • /
    • 2016
  • Complex and uncertain issues in supply chain result in integrated decision making processes in supply chains. So decentralized (distributed) decision making (DDM) approach is considered as a crucial stage in supply chain planning. In this paper, an uncertain DDM through coordination mechanism is addressed for a multi-product supply chain planning problem. The main concern of this study is comparison of DDM approach with centralized decision making (CDM) approach while some parameters of decision making are assumed to be uncertain. The uncertain DDM problem is modeled through fuzzy mathematical programming in which products' demands are assumed to be uncertain and modeled using fuzzy sets. Moreover, a CDM approach is customized and developed in presence of fuzzy parameters. Both approaches are solved using three fuzzy mathematical optimization methods. Hence, the contribution of this paper can be summarized as follows: 1) proposing a DDM approach for a multi-product supply chain planning problem; 2) Introducing a coordination mechanism in the proposed DDM approach in order to utilize the benefits of a CDM approach while using DDM approach; 3) Modeling the aforementioned problem through fuzzy mathematical programming; 4) Comparing the performance of proposed DDM and a customized uncertain CDM approach on multi-product supply chain planning; 5) Applying three fuzzy mathematical optimization methods in order to address and compare the performance of both DDM and CDM approaches. The results of these fuzzy optimization methods are compared. Computational results illustrate that the proposed DDM approach closely approximates the optimal solutions generated by the CDM approach while the manufacturer's and retailers' decisions are optimized through a coordination mechanism making lasting relationship.

Bytecode로부터 재목적 코드 생성 기법을 이용한 Pentium 코드 생성에 관한 연구 (A Study on the Pentium Code Generation using Retargetable Code Generation Technique from Bytecode)

  • 정성옥;고광만;이성주
    • 전자공학회논문지CI
    • /
    • 제37권4호
    • /
    • pp.1-8
    • /
    • 2000
  • 인터넷 및 WWW의 급속한 성장은 이 기종 기계 및 분산 네트워크 환경에서 수행될 수 있는 응용 소프트웨어를 위한 프로그래밍 언어에 대한 연구를 부각시키고 있다. 이러한 이기종 기계 및 분산 네트웍 환경에서 응용 소프트웨어 개발을 위해 개발된 Java 언어는 객체지향 특성을 지원하는 언어이며 Java 프로그래밍 언어 환경에서는 이식성, 번역성, 고성능, 및 단순성 등을 지원하고 있다. Bytecode는 Java 언어의 중간 코드로서 이 기종 기계 및 분산 네트웍 환경의 다중 플랫폼 환경에서 다양한 응용 소프트웨어의 개발을 가능하게 하고 있다. 하지만 Bytecode는 인터프리터 기법으로 실행되는 특성 때문에 많은 실행 시간을 소비하는 단점을 가지고 있다. 본 연구에서는 Bytecode로부터 정형화된 방법으로 다양한 목적기계에 대한 코드를 생성하기 위해 재목적 코드 생성 시스템을 설계하고 구현하고자 한다. 특히, Java 컴파일러로부터 생성된 Bytecode로부터 실질적으로 Pentium 코드를 생성하는 시스템을 구현한다. 본 연구의 원활한 수행을 위해 컴파일러 자동화 도구인 ACK의 코드 생성 시스템을 기반으로 한다.

  • PDF

A Creative Solution of Distributed Modular Systems for Building Ubiquitous Heterogeneous Robotic Applications

  • Ngo Trung Dung;Lund Henrik Hautop
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
    • /
    • pp.410-415
    • /
    • 2004
  • Employing knowledge of adaptive possibilities of agents in multi-agents system, we have explored new aspects of distributed modular systems for building ubiquitous heterogeneous robotic systems using intelligent building blocks (I-BLOCKS) [1] as reconfigurable modules. This paper describes early technological approaches related to technical design, experimental developments and evaluation of adaptive processing and information interaction among I-BLOCKS allowing users to easily develop modular robotic systems. The processing technology presented in this paper is embedded inside each $DUPLO^1$ brick by microprocessor as well as selected sensors and actuators in addition. Behaviors of an I-BLOCKS modular structure are defined by the internal processing functionality of each I-Block in such structure and communication capacities between I-BLOCKS. Users of the I-BLOCKS system can easily do 'programming by building' and thereby create specific functionalities of a modular robotic structure of intelligent artefacts without the need to learn and use traditional programming language. From investigating different effects of modern artificial intelligence, I-BLOCKS we have developed might possibly contain potential possibilities for developing modular robotic system with different types of morphology, functionality and behavior. To assess these potential I-BLOCKS possibilities, the paper presents a limited range of different experimental scenarios in which I-BLOCKS have been used to set-up reconfigurable modular robots. The paper also reports briefly about earlier experiments of I-BLOCKS created on users' natural inspiration by a just defined concept of modular artefacts.

  • PDF

선형계획법을 이용한 마이크로그리드의 분산전원 조합 최적화 (An Optimization of the Distributed Generator Combination for Microgrid using Linear Programming)

  • 이학주;채우규;정원욱;송일근
    • 조명전기설비학회논문지
    • /
    • 제24권8호
    • /
    • pp.133-141
    • /
    • 2010
  • 마이크로그리드는 부하 인근지역에서 분산전원에 전력과 열을 동시에 공급할 수 있는 소규모의 온 사이트형 전력공급 시스템으로 신재생에너지의 확대보급을 위한 기반 조성이 가능하다. 이러한 마이크로그리드 시스템의 경제적인 구축을 위해 엔지니어링 프로그램의 활용이 요구되고 있다. 이에 본 논문에서는 선형계획법을 이용하여 마이크로그리드의 구축비용이 최소화될 수 있는 분산전원 최적조합, 그에 대한 경제성 평가 및 분석이 가능한 엔지니어링 프로그램을 개발하였다. 제시한 엔지니어링 프로그램은 GAMS를 이용하여 구현하였으며, 분산전원 최적조합 모듈 및 신재생에너지의 출력 예측 모듈을 포함하고 있다, 사용자의 편리성을 고려하여 구성하였으며, 사례연구를 통하여 제안한 프로그램의 유용성을 보이고 있다. 본 논문에서 개발한 마이크로그리드 엔지니어링 프로그램은 향후 마이크로그리드의 확대보급 및 에너지 수급 계획 수립에 활용이 기대된다.

발견적 해법을 이용한 분산 컴퓨터 시스템 설계 (A Heuristic for the Design of Distributed Computing Systems)

  • 손승현;김재련
    • 산업경영시스템학회지
    • /
    • 제19권40호
    • /
    • pp.169-178
    • /
    • 1996
  • Geographically dispersed computing system is made of computers interconnected by a telecommunications network. To make the system operated efficiently, system designer must determine the allocation of data files to each node. In designing such distributed computing system, the most important issue is the determination of the numbers and the locations where database files are allocated. This is commonly referred to as the file allocation problem (FAP)[3]. The proposed model is a 0/l integer programming problem minimizing the sum of file storage costs and communication(query and update) costs. File allocation problem belongs to the class of NP-Complete problems. Because of the complexity, it is hard to solve. So, this paper presents an efficient heuristic algorithm to solve the file allocation problem using Tabu Search Technique. By comparing the optimal solutions with the heuristic solutions, it is believed that the proposed heuristic algorithm gives good solutions. Through the experimentation of various starting points and tabu restrictions, this paper presents fast and efficient method to solve the file allocation problem in the distributed computing system.

  • PDF

분포형 압전필름 감지기와 압전세라믹 작동기를 이용한 보의 진동 제어 (Vibration Control of Beam using Distributed PVDF Sensor and PZT Actuator)

  • 유정규;박근영;김승조
    • 소음진동
    • /
    • 제7권6호
    • /
    • pp.967-974
    • /
    • 1997
  • Distributed piezoeletric sensor and actuator have been designed for efficient vibration control of a cantilevered beam. Both PZT and PVDF have been used in this study, the former as an actuator and the latter as a sensor for the integrated structure. We have optimized the position and the size of the PZT actuator and the electrode shape of the PVDF sensor. Finite element method is used to model the structure and the optimized actuators, we have designed the active electrode width of the PVDF sensor along the span of the beam. Actuator design is based on the criterion of minimizing the system energy in the control modes under a given initial condition. Model control forces for the residual (uncontrolled) modes have been minimized during the sensor design to minimize the observation spill-over. Genetic algorithm and sequential quadratic programming technique have been utilized as an optimization scheme. Discrete LQG control law has been applied to the integrated structure for real time vibration control. Performance of the sensor, the actuator, and the integrated smart structure has been demonstrated by experiments.

  • PDF