• Title/Summary/Keyword: Distributed processing environment

Search Result 591, Processing Time 0.027 seconds

A Global XQuery Query Processing based on Local XQuery Query Generation (지역 질의 생성기반 전역 XQuery 질의 처리 기법)

  • Park, Jong-Hyun;Park, Won-Ik;Kim, Young-Kuk;Kang, Ji-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.11
    • /
    • pp.11-20
    • /
    • 2010
  • XML view is proposed to integrate between XML data and heterogeneous data over distributed environment and global XML view is used to search distributed heterogeneous data. At this time, standard query language for user is XQuery and the method for processing global XQuery queries over distributed environment is one of the new research topics. One of the basic and simple methods to process distributed SQL queries is that generates local queries for processing a global query and constructs the result of the global query from the results of the local queries. However, the syntax of XQuery differs from SQL because the XQuery contains some special expressions like FOR clauses for querying to semi-structured data, of course, FOR clauses are not used in SQL. Therefore, there are some problems to adopt the method for processing global SQL queries for generating local XQuery queries. This paper defines some problems when generates local XQuery queries for processing global XQuery queries and proposes a method for generating local XQuery queries considered these problems. Also we implement and evaluate a Global XQuery Processor which uses our method.

Structural Construction of MVC Applications using Distributed Object Composer (분산 객체 조립기를 이용한 MVC 응용의 구성적 작성)

  • Eum, Du-Heon
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.11
    • /
    • pp.1298-1305
    • /
    • 1999
  • 네트워크 및 분산 처리 기술의 발달로 분산 환경에서 동작하는 응용 프로그램에 대한 생산성 향상이 요구되고 있다. 본 논문에서는 MVC(Model, View, Controller) 패턴을 기반으로 하는 분산 응용 프로그램의 생산성 향상을 위해, 조립식 분산 응용의 작성을 지원하는 분산 객체 조립기, DOC(Distributed Object Composer)를 소개한다. 분산 객체 조립성의 기반이 되는 DOC의 구성적{{) '전체'를 창조해 내기 위해 여러 요소들을 결합, 배치하여 하나의 예술작품을 성립시키는 방법. 모아서 조립한다는 의미.}} 인터페이스(Structural Interface)는 기존 객체지향 기술의 절차적 인터페이스(Procedural Interface)에 비해 콤포넌트 재사용성을 개선하고, 분산 응용의 신속한 개발을 지원하여, 소프트웨어의 생산성 및 확장성을 향상시킨다. 또한, DOC 방식으로 모델링하고 구현한 공급망 관리(Supply Chain Management: SCM) 응용 프로그램의 조립식 작성을 통해, DOC의 실시간 정보 처리 및 조립 기능을 보인다.DOC는 이질적인 통신 환경에서 클라이언트와 서버 객체간의 네트워크 투과성을 제공하는 미들웨어, CORBA를 기반으로 한다. 또한, 분산 객체들 간의 상호작용을 자동 처리하기 위해 Java의 관찰자/피관찰자(Observer/Observable)를 확장한 분산 관찰자/피관찰자 패턴을 정의하여 DOC와, 서버 및 클라이언트의 분산 응용 객체들을 정의하기 위한 인터페이스에 적용한다.Abstract Due to the availability of advances in network and distributed processing technologies, the enhanced productivity of application software that runs on distributed environment is demanded. In this paper, we introduce the Distributed Object Composer (DOC) that supports the structural composition of distributed applications for the enhanced productivity of MVC (Model, View, Controller) pattern-based application programs. The structural interface of DOC that is the basis for the composibility of distributed objects increases the reusability of software components and provides better software productivity and extendibility than the procedural interface of the traditional object-oriented technology by supporting rapid constructions of distributed applications. In this paper, we also discuss the real-time information processing and composibility features of DOC by applying the DOC mechanism to the Supply Chain Management (SCM) application.DOC is implemented using the CORBA middleware that supports the network transparency between client and server objects on heterogeneous communication environments. We apply the distributed Observer/Observable pattern that extends the Observer/Obseverable of Java to DOC itself and distributed client/server objects as their interface definitions for the automatic interactions of distributed objects.

Big Data Processing Scheme of Distribution Environment (분산환경에서 빅 데이터 처리 기법)

  • Jeong, Yoon-Su;Han, Kun-Hee
    • Journal of Digital Convergence
    • /
    • v.12 no.6
    • /
    • pp.311-316
    • /
    • 2014
  • Social network server due to the popularity of smart phones, and data stored in a big usable access data services are increasing. Big Data Big Data processing technology is one of the most important technologies in the service, but a solution to this minor security state. In this paper, the data services provided by the big -sized data is distributed using a double hash user to easily access to data of multiple distributed hash chain based data processing technique is proposed. The proposed method is a kind of big data data, a function, characteristics of the hash chain tied to a high-throughput data are supported. Further, the token and the data node to an eavesdropper that occurs when the security vulnerability to the data attribute information to the connection information by utilizing hash chain of big data access control in a distributed processing.

Resource Allocation Algorithm for IoT Distributed Processing (IoT 분산 처리를 위한 자원 할당 알고리즘)

  • Yu, Donggyun;Jeong, Dohyeong;Choi, Hyungwook;Lim, Jaedon;Jung, Hoekyung
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.723-724
    • /
    • 2017
  • Recently, researches are being conducted to build a smart environment using various sensors and devices and to provide customized services to users through inter object communication. However, the existing system utilizes a centralized method of transmitting measured sensor data in real time to the server and processing it in batches and As the system is expanded, there is a problem that a high-end server must be configured. In this paper, we design a Resource Allocation Algorithm for IoT distributed processing environment to solve these problems. The resources required for the device to operate are transferred to the server and the server allocates resources in comparison to the task in progress. Therefore, it is expected that the data throughput of the server will be reduced and various devices can be configured in a server having a low specification.

  • PDF

Parallel Computing Environment for R with on Supercomputer Systems (빅데이터 분석을 위한 슈퍼컴퓨터 환경에서 R의 병렬처리)

  • Lee, Sang Yeol;Won, Joong Ho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.39 no.4
    • /
    • pp.19-31
    • /
    • 2014
  • We study parallel processing techniques for the R programming language of high performance computing technology. In this study, we used massively parallel computing system which has 25,408 cpu cores. We conducted a performance evaluation of a distributed memory system using MPI and of a the shared memory system using OpenMP. Our findings are summarized as follows. First, For some particular algorithms, parallel processing is about 150 times faster than serial processing in R. Second, the distributed memory system gets faster as the number of nodes increases while shared memory system is limited in the improvement of performance, due to the limit of the number of cpus in a single system.

Parallel Implementation of Distributed Sample Scrambler (분산표본혼화기의 병렬구현)

  • 정헌주;김재형정성현박승철
    • Proceedings of the IEEK Conference
    • /
    • 1998.06a
    • /
    • pp.62-65
    • /
    • 1998
  • This paper presents a method and implementation of the parallel distributed sample scrambler(DSS) in the cell-based ATM transmission environment. In the serial processing, it requires very high speed clock because the processing clock of the serial DSS is equal with the data transmission speed. In this paper, we develop a conversion method of the serial SRG(shift register generator) to 8bit parallel realization. In this case, it has a sample data processing problem which is a character of DSS. So, a theory of correction time movement is presented to solve this problem. We has developed a ASIC using this algorithm and verified the recommendation of ITU-T, I.432.

  • PDF

An Architecture of Scalable ATM Switching System and Its Call Processing Capacity Estimation

  • Kim, Young-Boo;Lee, Soon-Seok;Oh, Chang-Hwan;Kim, Young-Sun;Han, Chi-Moon;Yim, Chu-Hwan
    • ETRI Journal
    • /
    • v.18 no.3
    • /
    • pp.107-125
    • /
    • 1996
  • In this paper, we define the general requirements of ATM switching systems such as scalability, distributed fashion, and modularity. Also we propose a practical implementation of a scalable ATM switching system whose capacity can be easily expanded. Firstly, the architecture of the system is discussed with an emphasis on system scalability, modularity of subsystems and the simple control network of the design requirements. Secondly, we suggest the three types of distributed call/connection control schemes that are suitable for our switching system. We also estimate their call processing capacity on the average and make a comparison of them under the various system architectures. Since our scalable switching system can be constructed to perform the call processing functions on the various levels of the system capacity, it has much adaptability at the various evolution phases or regions of the network environment.

  • PDF

The Design of Process-Engine for Distributed Workflow Management System based on Web (웹기반 분산워크플로우 관리시스템의 프로세스 엔진 설계)

  • Lee, Heon;Park, Kyoo-Seok
    • Journal of Korea Multimedia Society
    • /
    • v.4 no.5
    • /
    • pp.377-389
    • /
    • 2001
  • It has a tendency to build Workflow Systems based on the web with the spread of web environment. The important function in Workflow Systems are to automatize job flow according to the predefined regulations, procedures or conditions. Hence, there needs to consider excluding passive jobs, supporting GUI and a migratory information processing for information flow. Distributed Workflow System for workflow of a distributed service system should perform transfer control and Fault-Tolerance between tasks based on process logic, and real time processing. However, the existing mail systems being used are just for transmission and it doesn't fit to automatize job flow. To solve the matter, there needs a Distributed Workflow Engine to design workflow and automatize its control. In this paper, we design a web browser with graphic interface using web mail, a browser creating a script code for a procedural performance. Also, we design a Process-engine has a Preprocessor which tolerates process scheduler for task transaction or server node's faults on distributed environment. The proposed system enhances the reliability and usability of a system reduces the cost rather than a workflow system based on database, for they execute as proxy for a server's fault or suers' absence.

  • PDF

Evaluation of Distributed Intrusion Detection System Based on MongoDB (MongoDB 기반의 분산 침입탐지시스템 성능 평가)

  • Han, HyoJoon;Kim, HyukHo;Kim, Yangwoo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.12
    • /
    • pp.287-296
    • /
    • 2019
  • Due to the development and increased usage of Internet services such as IoT and cloud computing, a large number of packets are being generated on the Internet. In order to create a safe Internet environment, malicious data that may exist among these packets must be processed and detected quickly. In this paper, we apply MongoDB, which is specialized for unstructured data analysis and big data processing, to intrusion detection system for rapid processing of big data security events. In addition, building the intrusion detection system(IDS) using some of the private cloud resources which is the target of protection, elastic and dynamic reconfiguration of the IDS is made possible as the number of security events increase or decrease. In order to evaluate the performance of MongoDB - based IDS proposed in this paper, we constructed prototype systems of IDS based on MongoDB as well as existing relational database, and compared their performance. Moreover, the number of virtual machine has been increased to find out the performance change as the IDS is distributed. As a result, it is shown that the performance is improved as the number of virtual machine is increased to make IDS distributed in MongoDB environment but keeping the overall system performance unchanged. The security event input rate based on distributed MongoDB was faster as much as 60%, and distributed MongoDB-based intrusion detection rate was faster up to 100% comparing to the IDS based on relational database.

Intelligent Control by Immune Network Algorithm Based Auto-Weight Function Tuning

  • Kim, Dong-Hwa
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.120.2-120
    • /
    • 2002
  • In this paper auto-tuning scheme of weight function in the neural networks has been suggested by immune algorithm for nonlinear process. A number of structures of the neural networks are considered as learning methods for control system. A general view is provided that they are the special cases of either the membership functions or the modification of network structure in the neural networks. On the other hand, since the immune network system possesses a self organizing and distributed memory, it is thus adaptive to its external environment and allows a PDP (parallel distributed processing) network to complete patterns against the environmental situation. Also. It can provi..

  • PDF