• Title/Summary/Keyword: Distribute Computing

Search Result 88, Processing Time 0.034 seconds

Structural Optimization based on Equivalent Static Load for Structure under Dynamic Load (동하중을 받는 구조물의 등가정하중 기반 구조최적화 연구)

  • Kim, Hyun Gi;Kim, Eui young;Cho, Maenghyo
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2013.10a
    • /
    • pp.236-240
    • /
    • 2013
  • Due to difficulty of considering dynamic load in side of a computer resource and computing time, it is common that external load is assumed as ideal static load. However, structural analysis under static load cannot guarantee the safety of structural design. Recently, the systematic method to construct equivalent static load from the given dynamic load has been proposed. Previous study has calculated equivalent static load through the optimization procedure under displacement constraints. And previously reported works to distribute equivalent static load were based on ad hoc methods. However, it is appropriate to take into account the stress constraint for the safety design. Moreover, the improper selection of loading position may results in unreliable structural design. The present study proposes the methodology to optimize an equivalent static which distributed on the primary DOFs, DOFs of the constraint elements, DOF of an external load as positions. In conclusion, the reliability of proposed method is demonstrated through a global optimization.

  • PDF

An ICT Framework for Tourism Industry of Nepal: Prospect and Challenges

  • Shrestha, Deepanjal;Jeong, Seung Ryul
    • Journal of Internet Computing and Services
    • /
    • v.17 no.6
    • /
    • pp.113-122
    • /
    • 2016
  • Information and Communication Technology (ICT) has revolutionized the world and has profound impact on the social and economic development of a country. Implementation, practice and accessibility of ICT is viewed as an integral part of any countries' strategy today. These new technologies are becoming popular due to their ability to produce, distribute and provide instant access to massive information in no time. ICT has pervaded almost every aspect of human endeavor that may include health, education, economics, governance, entertainment etc. Tourism is one such vital industry that find enormous application of ICT in its strategic and operational level, to promise long term benefits and enhance economic growth. Tourism industry in western world and some developed countries of Asia have applied ICT for more than 30 years, and have gained tremendous benefits. Nepal which is also growing as one of the favourite tourist destinations lacks proper implementation of ICT in this industry. In our study we examined how the ICT can play a vital role in developing the tourism industry of Nepal. This study is an exploratory research based on primary data collected from tourist visiting Nepal, supported by information from tour operators, government agencies, NGOs and INGOS. A framework is devised on the basis of data and information collected and finally, discussions elaborate on the prospect and challenges of implementation of ICT in tourism industry of $Nep{\grave{a}}l$.

Identity-based key distribution system and conference key distribution system (ID-Based 키 분비방식 및 회의용 키 분배방식)

  • 손기욱
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.1 no.1
    • /
    • pp.38-46
    • /
    • 1991
  • This paper pro poses a ley distribution system based on identification information. The system uses an indivdual user's identification instead of the public file used in the Diffie-Hellman sustem. It does not require any services of a center to distribute work keys and users to keep directory public file. We propose an identity-based key distribution system for generating a commom secret conference kdy for two or more users. We assume users are connected in a ring network. Message among users authenticated using each user's identification informa-tion. The security of the our proposed system is based on the difficulty of both factoring large numbers and computing discrete logarithms over large finite fields.

On-Demand Remote Software Code Execution Unit Using On-Chip Flash Memory Cloudification for IoT Environment Acceleration

  • Lee, Dongkyu;Seok, Moon Gi;Park, Daejin
    • Journal of Information Processing Systems
    • /
    • v.17 no.1
    • /
    • pp.191-202
    • /
    • 2021
  • In an Internet of Things (IoT)-configured system, each device executes on-chip software. Recent IoT devices require fast execution time of complex services, such as analyzing a large amount of data, while maintaining low-power computation. As service complexity increases, the service requires high-performance computing and more space for embedded space. However, the low performance of IoT edge devices and their small memory size can hinder the complex and diverse operations of IoT services. In this paper, we propose a remote on-demand software code execution unit using the cloudification of on-chip code memory to accelerate the program execution of an IoT edge device with a low-performance processor. We propose a simulation approach to distribute remote code executed on the server side and on the edge side according to the program's computational and communicational needs. Our on-demand remote code execution unit simulation platform, which includes an instruction set simulator based on 16-bit ARM Thumb instruction set architecture, successfully emulates the architectural behavior of on-chip flash memory, enabling embedded devices to accelerate and execute software using remote execution code in the IoT environment.

Design and Implementation of GT4 based Database Access and Integration Service in Grid Environment (그리드 환경에서 글로버스 툴킷 4 기반 데이터베이스 접근 및 통합 서비스 설계 및 구현)

  • Hyuk-Ho Kim;Ha-Na Lee;Pil-Woo, Lee;Yang-Woo Kim
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1103-1106
    • /
    • 2008
  • Data Grid is a kind of Grid computing provides the cooperative environment through the distributed data sharing, and can manage the massive data easily and efficiently. We designed and implemented Globus Toolkit4 (GT4) based database access and integration service (GDAIS). This service was implemented as Grid service for run on the GT4 which is Grid middleware. And it provides functions which are automatic registration of database in virtual organization, distributed query service, and the unified user interface. Also this system can use components which are provided from GT4. Therefore it can improve the efficiency to distribute and manage databases, can easily access and integrate of the distributed heterogeneous data in Grid environments.

Distribute Intelligent Multi-Agent Technology for User Service in Ubiquitous Environment (유비쿼터스 환경의 사용자 서비스를 위한 분산 지능형 에이전트 기술)

  • Choi, Jung-Hwa;Choi, Yong-June;Park, Young-Tack
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.9
    • /
    • pp.817-827
    • /
    • 2007
  • In the age of ubiquitous environment, huge number of devices and computing services are provided to users. Personalized service, which is modeled according to the character of each and every individual is of particular need. In order to provide various dynamic services according to user's movement, service unit and operating mode should be able to operate automatically with minimum user intervention. In this paper, we discuss the steps of offering approximate service based on user's request in ubiquitous environment. First, we present our simulator designed for modeling the physical resource and computing object in smart space - the infrastructure in ubiquitous. Second, intelligent agents, which we developed based on a FIPA specification compliant multi-agent framework will be discussed. These intelligent agents are developed for achieving the service goal through cooperation between distributed agents. Third, we propose an automated service discovery and composition method in heterogeneous environment using semantic message communication between agents, according to the movement by the user interacting with the service available in the smart space. Fourth, we provide personalized service through agent monitoring anytime, anywhere from user's profile information stored on handhold device. Therefore, our research provides high quality service more than general automated service operation.

A Hierarchical Server Structure for Parallel Location Information Search of Mobile Hosts (이동 호스트의 병렬적 위치 정보 탐색을 위한 서버의 계층 구조)

  • Jeong, Gwang-Sik;Yu, Heon-Chang;Hwang, Jong-Seon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.28 no.1_2
    • /
    • pp.80-89
    • /
    • 2001
  • The development in the mobile computing systems have arisen new and previously unforeseen problems, such as problems in information management of mobile host, disconnection of mobile host and low bandwidths of wireless communications. Especially, location information management strategy of mobile host results in an increased overhead in mobile computing systems. Due to the mobility of the mobiles host, the changes in the mobile host's address depends on the mobile host's location, and is maintained by mapping physical address on virtual address, Since previously suggested several strategies for mapping method between physical address and virtual address did not tackle the increase of mobile host and distribution of location information, it was not able to support the scalability in mobile computing systems. Thus, to distribute the location inrormation, we propose an advanced n-depth LiST (Location information Search Tree) and the parallel location search and update strategy based on the advanced n-depth LiST. The advanced n-depth LiST is logically a hierarchical structure that clusters the location information server by ring structure and reduces the location information search and update cost by parallel seatch and updated method. The experiment shows that even though the distance of two MHs that communicate with each other is large, due to the strnctural distribution of location information, advanced n-depth LiST results in good performance. Moreover, despite the reduction in the location information search cost, there was no increase in the location information update cost.

  • PDF

User Demand-based Grid Trade Management Model (사용자 요구기반의 그리드 거래 관리 모델)

  • Ma, Yong-Beom;Lee, Jong-Sik
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.3
    • /
    • pp.11-21
    • /
    • 2006
  • Importance of and need for grid resource management have accelerated in accordance with increasing development of grid computing. However, it is very complex to distribute and utilize resources efficiently in geographically dispersed environments. This is due to the different access policies and constraints of grid resource owners. Users request resources according to their needs. Operators of a grid computing system need to be able to monitor the system states for reflecting these demands. So, a grid computing system needs a resource management policy that monitors states of resources and then allocates resources. This paper proposes a user demand-based grid trade management model that provides an efficient resource management by the trade allocation based on a users' demand and providers' supply strategy. To evaluate performance, this paper measures increasing rate of resource trades, average response time of trades, and processing time utilization. Firstly, the average increasing rates of trade are 585.7% and 322.6% higher than an auction model and a double auction model. Secondly, the average response time of the user demand-based grid trade management model is maintained between 3 and 5 simulation time. Finally, it is found that the processing time utilization is an average of 145.4% and 118.0% higher than an auction model and a double auction model. These empirical results demonstrate the usefulness of the user demand-based grid trade management model.

  • PDF

Efficient Locality-Aware Traffic Distribution in Apache Storm (Apache Storm에서 지역성을 고려한 효율적인 트래픽 분배)

  • Son, Siwoon;Lee, Sanghun;Moon, Yang-Sae
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.12
    • /
    • pp.677-683
    • /
    • 2017
  • Apache Storm is a representative real-time distributed processing system, which is able to process data streams quickly over distributed servers. Storm currently provides several stream grouping methods to distribute data traffic to multiple servers. Among them, the shuffle grouping may cause a processing delay problem and the local-or-shuffle grouping used to solve the problem may cause the problem of concentrating the traffic on a specific node. In this paper, we propose the locality-aware grouping to solve the problems that may arise in the existing Storm grouping methods. Experimental results show that the proposed locality-aware grouping is considerably superior to the existing shuffle grouping and the local-or-shuffle grouping. These results show that the new grouping is an excellent approach considering both the locality and load balancing which are limitations of the existing Storm.

Interactive Facial Expression Animation of Motion Data using CCA (CCA 투영기법을 사용한 모션 데이터의 대화식 얼굴 표정 애니메이션)

  • Kim Sung-Ho
    • Journal of Internet Computing and Services
    • /
    • v.6 no.1
    • /
    • pp.85-93
    • /
    • 2005
  • This paper describes how to distribute high multi-dimensional facial expression data of vast quantity over a suitable space and produce facial expression animations by selecting expressions while animator navigates this space in real-time. We have constructed facial spaces by using about 2400 facial expression frames on this paper. These facial spaces are created by calculating of the shortest distance between two random expressions. The distance between two points In the space of expression, which is manifold space, is described approximately as following; When the linear distance of them is shorter than a decided value, if the two expressions are adjacent after defining the expression state vector of facial status using distance matrix expressing distance between two markers, this will be considered as the shortest distance (manifold distance) of the two expressions. Once the distance of those adjacent expressions was decided, We have taken a Floyd algorithm connecting these adjacent distances to yield the shortest distance of the two expressions. We have used CCA(Curvilinear Component Analysis) technique to visualize multi-dimensional spaces, the form of expressing space, into two dimensions. While the animators navigate this two dimensional spaces, they produce a facial animation by using user interface in real-time.

  • PDF