• Title/Summary/Keyword: distributed computing strategy

Search Result 47, Processing Time 0.023 seconds

An Efficient Job Scheduling Strategy for Computational Grid (계산 그리드를 위한 효율적인 작업 스케줄링 정책)

  • Jo, Ji-Hun;Lee, Won-Joo;Jeon, Chang-Ho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.8
    • /
    • pp.753-757
    • /
    • 2008
  • In this paper, we propose a new scheduling strategy for dynamic programming in Grid environment. The key idea of this scheme is to reduce the execution time of a job by dividing the dynamic table based on the locality of table and allocating jobs to nodes which minimize network latency. This scheme obtains optimal concurrency by constructing the dynamic table using a distributed top down method. Through simulation, we show that the proposed Grid strategy improves the performance of Grid environment compared to previous branch-bound strategies.

A Study on Integrated Binding Service Strategy Based on Name/property in Wide-Area Object Computing Environments (광역 객체 컴퓨팅 환경에서 이름/속성기반의 통합 바이딩 서비스 방안)

  • Jeong, Chang-Won;Oh, Sung-Kwun;Joo, Su-Chong
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.241-248
    • /
    • 2002
  • With the structure of tilde-area computing system which Is specified by a researching team in Vrije University, Netherlands, lots of researchers and developers have been progressing the studies of global location and interconnection services of distributed objects existing in global sites. Most of them halve focused on binding services of only non-duplicated computational objects existing wide-area computing sites without any consideration of duplication problems. But all of objects existing on the earth rave the duplicated characteristics according to how to categorize their own names or properties. These objects with the same property can define as duplicated computational objects. Up to now, the existing naming or trading mechanism has not supported the binding services of duplicated objects, because of deficiency of independent location service. For this reason, we suggest a new model that can not only manages locations of duplicated objects In wide-area computing environments, but also provide minimum binding time by considering both the optimal selection of one of duplicated objects and load balance among distributed systems. Our model is functionally divided into 2 parts, one part to obtain an unique object handle of duplicated objects with same property as a naming and trading service, and the other to search one or more contact addresses by a node manager using a liven object handle, as a location service For location transparency, these services are independently executing each other. Based on our model, we described structure of wide-area integrated tree and algorithms for searching and updating contact address of distributed object on this tree. finally, we showed a federation structure that can globally bind distributed objects located on different regions from an arbitrary client object.

A Hybrid Mechanism of Particle Swarm Optimization and Differential Evolution Algorithms based on Spark

  • Fan, Debin;Lee, Jaewan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.12
    • /
    • pp.5972-5989
    • /
    • 2019
  • With the onset of the big data age, data is growing exponentially, and the issue of how to optimize large-scale data processing is especially significant. Large-scale global optimization (LSGO) is a research topic with great interest in academia and industry. Spark is a popular cloud computing framework that can cluster large-scale data, and it can effectively support the functions of iterative calculation through resilient distributed datasets (RDD). In this paper, we propose a hybrid mechanism of particle swarm optimization (PSO) and differential evolution (DE) algorithms based on Spark (SparkPSODE). The SparkPSODE algorithm is a parallel algorithm, in which the RDD and island models are employed. The island model is used to divide the global population into several subpopulations, which are applied to reduce the computational time by corresponding to RDD's partitions. To preserve population diversity and avoid premature convergence, the evolutionary strategy of DE is integrated into SparkPSODE. Finally, SparkPSODE is conducted on a set of benchmark problems on LSGO and show that, in comparison with several algorithms, the proposed SparkPSODE algorithm obtains better optimization performance through experimental results.

Design of Mobile Phone Middleware based on Integrated Context Provisioning Strategy (통합 상황 프로비저닝 전략을 기반으로 한 모바일 폰 미들웨어의 설계)

  • Jeong, Hyun-Jin;Won, You-Hun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.12 no.1 s.45
    • /
    • pp.89-98
    • /
    • 2007
  • In these days, the use of context in application running on mobile devices such as PDAs and smart Phone has become a crucial requirement for several research areas, including ubiquitous computing. mobile computing. Previous middlewares which support context provisioning uses single strategy. But, this paper proposed middleware integrated multiple strategies for context provisioning, namely internal sensors-based, external infrastructure-based, and distributed provisioning in ad hoc networks. Applications can query needed context items using SQL like context query language and require context information to use different provisioning mechanisms depending on resource availability and presence of external infrastructures.

  • PDF

Operating Simulation of RPS using DEVS W/S in Web Service Environment

  • Cho, Kyu-Cheol
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.12
    • /
    • pp.107-114
    • /
    • 2016
  • Web system helps high-performance processing for big-data analysis and practical use to make various information using IT resources. The government have started the RPS system in 2012. The system invigorates the electricity production as using renewable energy equipment. The government operates system gathered big-data with various related information system data and the system users are distributed geographically. The companies have to fulfill the system, are available to purchase the REC to other electricity generation company sellers to procure REC for their duty volumes. The REC market operates single auction methods with users a competitive price. But the price have the large variation with various user trading strategy and sellers situations. This papler proposed RPS system modeling and simulation in web environment that is modeled in geographically distributed computing environment for web user with DEVS W/S. Web simulation system base on web service helps to analysis correlation and variables that act on trading price and volume within RPS big-data and the analysis can be forecast REC price.

A Study of Ubiquitous Technology Trends and Confrontation Plans (유비쿼터스 기술동향 및 대응방안에 관한 연구)

  • Lee Seung-Ryol;Yun Ho-Gun;Jeong Hwa-Young
    • Journal of Digital Contents Society
    • /
    • v.4 no.1
    • /
    • pp.35-44
    • /
    • 2003
  • Ubiquitous computing indicates that can use communication network of high-capacity anytime, anywhere, anyone as meaning that network exist everywhere. Ubiquitous means computing environment that human can use computing technology naturally although a person does not feel computers because many computers distributed and linked each other. Current research of Ubiquitous is studied mainly at the United States of America, Japan, Europe, etc,. It is becoming new hot issue of IT field. In this research, we examines a trends and a development strategy of Ubiquitous market's such as the United States of America, Japan, Europe. And we study Information-oriented society based on Korea's Ubiquitous and u-Korea vision of new paradigm.

  • PDF

A Distributed Proxy Server System for Wireless Mobile Web Service (무선 이동 웹 서비스를 위한 분산 프록시 서버 시스템의 설계 및 구현)

  • Lee, Hyuk-Joon;Kim, Dong-Won
    • The KIPS Transactions:PartC
    • /
    • v.9C no.1
    • /
    • pp.79-88
    • /
    • 2002
  • Transcoding proxy strategy has been widely used as a means to reduce the delay in retrieving Web pages over wireless mobile data service networks. However, this strategy has the serious drawbacks of being a potential point of failure or a bottleneck of the service. We developed a distributed proxy server system in which multiple proxy servers are installed at geographically dispersed locations and share the workloads among them by serving mobile hosts only within assigned regions. A new handoff message protocol to enable handoffs between proxies as the mobile hosts move between regions is proposed. According to the proxy server handoff protocol, a client agent at the mobile horst requests a proxy server to start handoff processing by which two proxy servers synchronize distilled data belonging to a HTTP session that must be maintained across the handoff. Also, we introduce the architecture of the proxy server and the client agent that handles the proxy server handoff. Finally, we evaluate the proposed system through performance test.

Distributed Table Join for Scalable RDFS Reasoning on Cloud Computing Environment (클라우드 컴퓨팅 환경에서의 대용량 RDFS 추론을 위한 분산 테이블 조인 기법)

  • Lee, Wan-Gon;Kim, Je-Min;Park, Young-Tack
    • Journal of KIISE
    • /
    • v.41 no.9
    • /
    • pp.674-685
    • /
    • 2014
  • The Knowledge service system needs to infer a new knowledge from indicated knowledge to provide its effective service. Most of the Knowledge service system is expressed in terms of ontology. The volume of knowledge information in a real world is getting massive, so effective technique for massive data of ontology is drawing attention. This paper is to provide the method to infer massive data-ontology to the extent of RDFS, based on cloud computing environment, and evaluate its capability. RDFS inference suggested in this paper is focused on both the method applying MapReduce based on RDFS meta table, and the method of single use of cloud computing memory without using MapReduce under distributed file computing environment. Therefore, this paper explains basically the inference system structure of each technique, the meta table set-up according to RDFS inference rule, and the algorithm of inference strategy. In order to evaluate suggested method in this paper, we perform experiment with LUBM set which is formal data to evaluate ontology inference and search speed. In case LUBM6000, the RDFS inference technique based on meta table had required 13.75 minutes(inferring 1,042 triples per second) to conduct total inference, whereas the method applying the cloud computing memory had needed 7.24 minutes(inferring 1,979 triples per second) showing its speed twice faster.

Multi-dynamic Decision Support System for Multi Decision Problems for Highly Ill.structured Problem in Ubiquitous Computing (유비쿼터스 환경에서 다중 동적 의사결정지원시스템(UMD-DSS) : 비구조적 문제 중심으로)

  • Lee, Hyun-Jung;Lee, Kun-Chang
    • Journal of Intelligence and Information Systems
    • /
    • v.14 no.2
    • /
    • pp.83-102
    • /
    • 2008
  • Ubiquitous computing requires timely supply of contextual information in order to upgrade decision quality. In this sense, this study is aimed at proposing a multi-dynamic decision support system for highly ill-structured problems. Especially, it is very important for decision makers in the ubiquitous computing to coordinate conflicts among local goals and global goal harmoniously. The proposed Multi-Dynamic Decision Support System (MDDSS) is basically composed of both central structure and distributed structure, in which central structure supports multi objects decision making and distributed structure supports individual decision making. Its hybrid architecture consists of decision processor, multi-agent controller and intelligent knowledge management processor. Decision processor provides decision support using contexts which come from individual agents. Multi-agent controller coordinates tension among multi agents to resolve conflicts among them. Meanwhile, intelligent knowledge management processor manages knowledge to support decision making such as rules, knowledge, cases and so on. To prove the validity of the proposed MDDSS, we applied it to an u-fulfillment problem system in which many kinds of decision makers exist trying to satisfy their own objectives, and timely adjustment of action strategy is required. Therefore, the u-fulfillment problem is a highly ill-structured problem. We proved its effectiveness with the aid of multi-agent simulation comprising 60 customers and 10 vehicles under three experimental modes.

  • PDF

Robust and Auditable Secure Data Access Control in Clouds

  • KARPAGADEEPA.S;VIJAYAKUMAR.P
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.5
    • /
    • pp.95-102
    • /
    • 2024
  • In distributed computing, accessible encryption strategy over Auditable data is a hot research field. Be that as it may, most existing system on encoded look and auditable over outsourced cloud information and disregard customized seek goal. Distributed storage space get to manage is imperative for the security of given information, where information security is executed just for the encoded content. It is a smaller amount secure in light of the fact that the Intruder has been endeavored to separate the scrambled records or Information. To determine this issue we have actualize (CBC) figure piece fastening. It is tied in with adding XOR each plaintext piece to the figure content square that was already delivered. We propose a novel heterogeneous structure to evaluate the issue of single-point execution bottleneck and give a more proficient access control plot with a reviewing component. In the interim, in our plan, a CA (Central Authority) is acquainted with create mystery keys for authenticity confirmed clients. Not at all like other multi specialist get to control plots, each of the experts in our plan deals with the entire trait set independently. Keywords: Cloud storage, Access control, Auditing, CBC.