• Title/Summary/Keyword: Distributed Computing Environment

Search Result 498, Processing Time 0.027 seconds

Distributed Mutual Exclusion Algorithm for Maintaining Tree-Height Balance in Mobile Computing Environments (이동 컴퓨팅 환경에서 트리 높이의 균형을 유지하는 상호 배제 알고리즘)

  • Kim, Hyeong-Sik;Eom, Yeong-Ik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.10
    • /
    • pp.1206-1216
    • /
    • 1999
  • 이동 호스트란 시간과 공간의 제약 없이 필요한 기능을 수행하고, 또한 원하는 정보에 접근할 수 있는 휴대용 컴퓨터를 일컫는다. 이동 컴퓨팅 환경이란 이러한 이동 호스트들을 지원할 수 있도록 구성된 분산 환경이다. 따라서 이동 컴퓨팅 환경에서의 분산 알고리즘은 정적 호스트만을 고려한 기존의 분산 환경에서와는 다르게 이동 호스트의 여러 가지 특성들을 고려하여 제안되어야 한다. 즉, 이동 컴퓨팅 환경의 도래로 인하여 이동성과 휴대성, 그리고 무선 통신과 같은 특성들을 고려한 새로운 분산 상호 배제 알고리즘이 필요하다. 이제까지 이동 컴퓨팅 환경에서의 상호 배제 알고리즘은 토큰 링 구조에 기반을 두고 설계되었다. 토큰 링 구조는 이동 호스트들의 위치를 유지하기 위하여 높은 비용을 필요로 하는 단점을 가지고 있다. 본 논문에서는 균형 높이 트리(height-balanced tree)라는 새로운 모형을 제안함으로써 정적 분산 환경과 이동 분산 환경이 혼합된 환경에서 상호 배제 비용을 감소시킬 수 있는 새로운 알고리즘을 제안하며, 각 경우에 있어서의 비용을 산출하고 평가한다.Abstract The mobile host is a potable computer that carries out necessary functions and has the ability to access desirable informations without any constraints in time and space. Mobile computing environment is a distributed environment that is organized to support such mobile hosts. In that environment, distributed algorithms of which environment not only with static hosts but with mobile host's several properties should be proposed. With the emergence of mobile computing environments, a new distributed mutual exclusion method should be required to consider properties mobile computing system such as mobility, portability, and wireless communication. Until now, distributed mutual exclusion methods for mobile computing environments are designed based on a token ring structure, which have the drawbacks of requiring high costs in order to locate mobile hosts. In this paper, we propose a distributed mutual exclusion method that can reduce such costs by structuring the entire system as a height-balanced tree for static distributed networks and for networks with mobile hosts. We evaluated the operation costs in each case.

A Design CORBA Security Service for DataBase Security in Ubiquitous Computing (유비쿼터스 환경의 데이터베이스 보안을 위한 CSS 설계)

  • Lee, Dae-Sik;Yun, Dong-Sic;Ahn, Heui-Hak
    • Convergence Security Journal
    • /
    • v.5 no.3
    • /
    • pp.15-22
    • /
    • 2005
  • The spread of Internet and the appear of Downsizing, SI(System Integration) is chaning centralized computing to distributed computing. Also distributed computing is rapidly changing to Ubiquitous computing escape from hard wire connected network. CORBA(Common Object Request Broker Architecture) is a middleware that used for smoothness communication between application program and operation system in a different environment. However distributed computing environment is not safe from the danger, the attack like virus, worm is too intellectual and variety. In this paper, we design a new DB security model and suggest efficiency of it in Ubiquitous environment base on CSS(CORBA Security Service) that present ed from OMG(Object Management Group).

  • PDF

InterCom : Design and Implementation of an Agent-based Internet Computing Environment (InterCom : 에이전트 기반 인터넷 컴퓨팅 환경 설계 및 구현)

  • Kim, Myung-Ho;Park, Kweon
    • The KIPS Transactions:PartA
    • /
    • v.8A no.3
    • /
    • pp.235-244
    • /
    • 2001
  • Development of network and computer technology results in many studies to use physically distributed computers as a single resource. Generally, these studies have focused on developing environments based on message passing. These environments are mainly used to solve problems for scientific computation and process in parallel suing inside parallelism of the given problems. Therefore, these environments provide high parallelism generally, while it is difficult to program and use as well as it is required to have user accounts in the distributed computers. If a given problem is divided into completely independent subproblems, more efficient environment can be provided. We can find these problems in bio-informatics, 3D animatin, graphics, and etc., so the development of new environment for these problems can be considered to be very important. Therefore, we suggest new environment called InterCom based on a proxy computing, which can solve these problems efficiently, and explain the implementation of this environment. This environment consists of agent, server, and client. Merits of this environment are easy programing, no need of user accounts in the distributed computers, and easiness by compiling distributed code automatically.

  • PDF

A Framework for Agile Development in Cloud Computing Environment

  • Younas, Muhammad;Ghani, Imran;Jawawi, Dayang Norhayati Abang;Khan, Muhammad Murad
    • Journal of Internet Computing and Services
    • /
    • v.17 no.5
    • /
    • pp.67-74
    • /
    • 2016
  • Distributed agile software development faces difficulties for instance lack of visibility across development and delivery processes, complex and disjointed development processes, inability to capitalize on business opportunities, lack of communication agility between disconnected owners, development teams, and users or clients. However these difficulties are solved with the help of cloud computing services. This study proposes a framework to provide a skeletal or structural environment for distributed agile software development in cloud computing environment. The framework guide towards the best tooling to deliver a consistent, automated, governed, and unified agile software development process with reduced technical debt, and minimized project backlog. In addition to this, the study highlights the benefits of cloud computing in agile software development.

Infrastructure of Grid-based Distributed Remotely Sensed Images Processing Environment and its Parallel Intelligence Algorithms

  • ZHENG, Jiang;LUO, Jian-Cheng;Hu, Cheng;CHEN, Qiu-Xiao
    • Proceedings of the KSRS Conference
    • /
    • 2003.11a
    • /
    • pp.1284-1286
    • /
    • 2003
  • There is a growing demand on remotely sensed and GIS data services in modern society. However, conventional WEB applications based on client/server pattern can not meet the criteria in the future . Grid computing provides a promising resolution for establishing spatial information system toward future applications. Here, a new architecture of the distributed environment for remotely sensed data processing based on the middleware technology was proposed. In addition, in order to utilize the new environment, a problem had to be algorithmically expressed as comprising a set of concurrently executing sub-problems or tasks. Experiment of the algorithm was implemented, and the results show that the new environmental can achieve high speedups for applications compared with conventional implementation.

  • PDF

Comparison of Distributed and Parallel NGS Data Analysis Methods based on Cloud Computing

  • Kang, Hyungil;Kim, Sangsoo
    • International Journal of Contents
    • /
    • v.14 no.1
    • /
    • pp.34-38
    • /
    • 2018
  • With the rapid growth of genomic data, new requirements have emerged that are difficult to handle with big data storage and analysis techniques. Regardless of the size of an organization performing genomic data analysis, it is becoming increasingly difficult for an institution to build a computing environment for storing and analyzing genomic data. Recently, cloud computing has emerged as a computing environment that meets these new requirements. In this paper, we analyze and compare existing distributed and parallel NGS (Next Generation Sequencing) analysis based on cloud computing environment for future research.

Deep Learning Based Security Model for Cloud based Task Scheduling

  • Devi, Karuppiah;Paulraj, D.;Muthusenthil, Balasubramanian
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3663-3679
    • /
    • 2020
  • Scheduling plays a dynamic role in cloud computing in generating as well as in efficient distribution of the resources of each task. The principle goal of scheduling is to limit resource starvation and to guarantee fairness among the parties using the resources. The demand for resources fluctuates dynamically hence the prearranging of resources is a challenging task. Many task-scheduling approaches have been used in the cloud-computing environment. Security in cloud computing environment is one of the core issue in distributed computing. We have designed a deep learning-based security model for scheduling tasks in cloud computing and it has been implemented using CloudSim 3.0 simulator written in Java and verification of the results from different perspectives, such as response time with and without security factors, makespan, cost, CPU utilization, I/O utilization, Memory utilization, and execution time is compared with Round Robin (RR) and Waited Round Robin (WRR) algorithms.

Implementation of Distributed Computing Environment using Java Agent (자바 에이젼트를 이용한 분산컴퓨팅 환경 구현)

  • 서건원;이길흥
    • Journal of the Korea Computer Industry Society
    • /
    • v.3 no.2
    • /
    • pp.199-208
    • /
    • 2002
  • Because of the change of computing environment, an agent technology is spotlighted recently. By deploying agent distributedly in network and offering the necessary service quickly in place easing realization of service, the enlargement of the effectiveness of network is necessary more and more. In this paper, agents programmed in java are distributed in place easing realization of service in network. And a manager connects to agents and informs URL of service code of the agent. This paper implements distributed computing environment in which agent downloads service code from URL of service code, executes the code, and returns the result of execution to manager.

  • PDF

Development of a Hybrid Watershed Model STREAM: Model Structures and Theories (복합형 유역모델 STREAM의 개발(I): 모델 구조 및 이론)

  • Cho, Hong-Lae;Jeong, Euisang;Koo, Bhon Kyoung
    • Journal of Korean Society on Water Environment
    • /
    • v.31 no.5
    • /
    • pp.491-506
    • /
    • 2015
  • Distributed models represent watersheds using a network of numerous, uniform calculation units to provide spatially detailed and consistent evaluations across the watershed. However, these models have a disadvantage in general requiring a high computing cost. Semi-distributed models, on the other hand, delineate watersheds using a simplified network of non-uniform calculation units requiring a much lower computing cost than distributed models. Employing a simplified network of non-uniform units, however, semi-distributed models cannot but have limitations in spatially-consistent simulations of hydrogeochemical processes and are often not favoured for such a task as identifying critical source areas within a watershed. Aiming to overcome these shortcomings of both groups of models, a hybrid watershed model STREAM (Spatio-Temporal River-basin Ecohydrology Analysis Model) was developed in this study. Like a distributed model, STREAM divides a watershed into square grid cells of a same size each of which may have a different set of hydrogeochemical parameters reflecting the spatial heterogeneity. Like many semi-distributed models, STREAM groups individual cells of similar hydrogeochemical properties into representative cells for which real computations of the model are carried out. With this hybrid structure, STREAM requires a relatively small computational cost although it still keeps the critical advantage of distributed models.

A Hoarding Policy for collaborative computing in Mobile Environment : design and Implementation. (이동컴퓨터 상에서의 공동작업을 위한 자동저장 방식 설계 및 구현)

  • 이근영;김남광박승규
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.491-494
    • /
    • 1998
  • This paper describes the design and implementation of file system which allows the collaborative computing in mobile environment. The design goal is to make a logically one file system in the distributed computer systems. The characteristics of frequent, foreseeable and variable disconnections in a mobile environment wrer taken into consideration. We introduce an auto-hoarding system that provides the availability of large number of nodes which are weakly and intermittently connected. The data consistency problems in distributed or replicated mobile data are also discussed.

  • PDF