• Title/Summary/Keyword: distributed applications

Search Result 1,258, Processing Time 0.028 seconds

A web-based collaborative framework for facilitating decision making on a 3D design developing process

  • Nyamsuren, Purevdorj;Lee, Soo-Hong;Hwang, Hyun-Tae;Kim, Tae-Joo
    • Journal of Computational Design and Engineering
    • /
    • v.2 no.3
    • /
    • pp.148-156
    • /
    • 2015
  • Increased competitive challenges are forcing companies to find better ways to bring their applications to market faster. Distributed development environments can help companies improve their time-to-market by enabling parallel activities. Although, such environments still have their limitations in real-time communication and real-time collaboration during the product development process. This paper describes a web-based collaborative framework which has been developed to support the decision making on a 3D design developing process. The paper describes 3D design file for the discussion that contains all relevant annotations on its surface and their visualization on the user interface for design changing. The framework includes a native CAD data converting module, 3D data based real-time communication module, revision control module for 3D data and some sub-modules such as data storage and data management. We also discuss some raised issues in the project and the steps underway to address them.

Development of Autonomous Loading and Unloading for Network-based Unmanned Forklift (네트워크 기반 무인지게차를 위한 팔레트 자율적재기술의 개발)

  • Park, Jee-Hun;Kim, Min-Hwan;Lee, Suk;Lee, Kyung-Chang
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.10
    • /
    • pp.1051-1058
    • /
    • 2011
  • Unmanned autonomous forklifts have a great potential to enhance the productivity of material handling in various applications because these forklifts can pick up and deliver loads without an operator and any fixed guide. Especially, automation of pallet loading and unloading technique is useful for enhancing performance of logistics and reducing cost for automation system. There are, however, many technical difficulties in developing such forklifts including localization, map building, sensor fusion, control, and so on. This is because the system requires numerous sensors, actuators, and controllers that need to be connected with each other, and the number of connections grows very rapidly as the number of devices grows. This paper presents a vision sensorbased autonomous loading and unloading for network-based unmanned forklift where system components are connected to a shared CAN network. Functions such as image processing and control algorithm are divided into small tasks that are distributed over a number of microcontrollers with a limited computing capacity. And the experimental results show that proposed architecture can be an appropriate choice for autonomous loading in the unmanned forklift.

Adaptive OLSR Protocol Based on Average Node Distance in Airdropped Distributed Mobility Model (분산 낙하 이동 모델에서의 평균 노드 거리 기반 적응적 OLSR 프로토콜)

  • Lee, Taekmin;Lee, Jinhae;Wang, Jihyeun;Yoo, Joonhyuk;Yoo, Seong-eun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.13 no.2
    • /
    • pp.83-91
    • /
    • 2018
  • With the development of IT (Information Technology) technology, embedded system and network technology are combined and used in various environments such as military environment as well as everyday life. In this paper, we propose a new airdropped distributed mobility model (ADMM) modeling the dispersion falling of the direct shot of a cluster bomb, and we compare and analyze some representative MANET routing protocols in ADMM in ns-3 simulator. As a result of the analysis, we show OLSR routing protocol is promising in ADMM environment in the view points of packet delivery ratio (PDR), end to end delay, and jitter. In addition, we propose a new adaptation scheme for OLSR, AND-OLSR (Average Node Distance based adaptive-OLSR) to improve the original OLSR in ADMM environment. The new protocol calculates the average node distance, adapts the period of the control message based on the average node distance increasing rate. Through the simulation study, we show that the proposed AND-OLSR outperforms the original OLSR in PDR and control message overhead.

Scate: A Scalable Time and Energy Aware Actor Task Allocation Algorithm in Wireless Sensor and Actor Networks

  • Sharifi, Mohsen;Okhovvat, Morteza
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.330-340
    • /
    • 2012
  • In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

Distributed PNC Election Scheme with Guaranteeing QoS in WPANs (WPAN에서 QoS를 보장하는 분산적인 PNC 선출 방법)

  • Jeong, Soon-Gyu;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2B
    • /
    • pp.133-142
    • /
    • 2007
  • WPANs are formed in relatively small area and a PNC that serves as a central control device plays an important role in the operation and organization of a piconet. Typical applications of WPANs are security system and health monitoring system. In these type of systems, guaranteeing realtime service is very important, and communications cannot take place when the PNC malfunctions. Thus, in this situation, it is necessary to elect a new PNC as soon as possible. For this reason, we propose distributed PNC election scheme that considers not only QoS support but also network connectivity to avoid possible network partition. Simulation results show proposed mechanism can select PNC with guaranteeing QoS and connectivity for a limited period.

Epidemic-Style Group Communication Algorithm ensuring Causal Order Delivery (인과적 순서 전달을 보장하는 전염형 그룹 통신 알고리즘)

  • Kim Chayoung;Ahn Jinho
    • The KIPS Transactions:PartA
    • /
    • v.12A no.2 s.92
    • /
    • pp.137-144
    • /
    • 2005
  • Many reliable group communication algorithms were presented to satisfy predetermined message ordering properties in small or medium-scale distributed systems. However, the previous algorithms with their strong reliability properties may be unappropriate for large-scale systems. To address this issue, some epidemic-style group communication algorithms were proposed for considerably improving scalability while guaranteeing the reasonably weaker reliability property than the existing ones. The algorithms are all designed for ensuring the atomic order message delivery property. But, some distributed applications such as multimedia systems and collaborative work, may require only the weaker message ordering property, i.e., causal order delivery. This paper proposes an efficient epidemic-style group communication algorithm ensuring causal order delivery to provide the indigenous scalability of the epidemic-style approach.

Implementation and Performance Evaluation of Software Distributed Shared Memory for SMP Clusters (SMP 클러스터를 위한 소프트웨어 분산 공유메모리의 구현 및 성능 측정)

  • 이동현;이상권;박소연;맹승렬
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.331-340
    • /
    • 2003
  • Low-cost commodity SMP(Symmetric Multiprocessor) is widely used as a node of cluster system. In this paper, we implement and evaluate the performance of SDSM system for SMP clusters. Our SDSM system provides HLRC(Home-based Lazy Release Consistency) memory consistency model. Our protocol utilize shared memory within same SMP node, so that page fetch and message passing through network can be reduced. It is implemented on 8 node of 2-way Pentium-III SMP interconnected with 100Mbps Fast Ethernet, and uses TCP/IP for transport/network layer protocol. The experiment with eight applications shows that our SMP protocol achieves maximum 33% speedup improvement and 13%-52% reduction of page fetch compared with uniprocessor protocol.

Performance Evaluation of MAC Protocols with Application to MANET Routing for Distributed Cognitive Radio Networks (분산 무선 인지 네트워크를 위한 MAC 프로토콜의 MANET 라우팅 적용 성능 분석)

  • Kwon, Sehoon;Kim, Hakwon;Kim, Bosung;Roh, Byeong-Hee
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.3 no.4
    • /
    • pp.97-106
    • /
    • 2014
  • In this paper, we propose a design method to extend certain cognitive radio (CR) MAC protocols originally proposed only for the one hop applications in distributed CR networks to MANET routing protocols. Among several CR MAC protocols, the opportunistic MAC (called O-MAC) and the opportunistic period MAC (called OP-MAC) are considered, and AODV as MANET routing protocol is used. We implement the protocols using OPNET network simulator, and compare the performances in both MAC and AODV routing environments. With the experiments, we analyze the relationship between MAC and routing performances of the CR protocols.

A Random Deflected Subgradient Algorithm for Energy-Efficient Real-time Multicast in Wireless Networks

  • Tan, Guoping;Liu, Jianjun;Li, Yueheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4864-4882
    • /
    • 2016
  • In this work, we consider the optimization problem of minimizing energy consumption for real-time multicast over wireless multi-hop networks. Previously, a distributed primal-dual subgradient algorithm was used for finding a solution to the optimization problem. However, the traditional subgradient algorithms have drawbacks in terms of i) sensitivity to iteration parameters; ii) need for saving previous iteration results for computing the optimization results at the current iteration. To overcome these drawbacks, using a joint network coding and scheduling optimization framework, we propose a novel distributed primal-dual Random Deflected Subgradient (RDS) algorithm for solving the optimization problem. Furthermore, we derive the corresponding recursive formulas for the proposed RDS algorithm, which are useful for practical applications. In comparison with the traditional subgradient algorithms, the illustrated performance results show that the proposed RDS algorithm can achieve an improved optimal solution. Moreover, the proposed algorithm is stable and robust against the choice of parameter values used in the algorithm.

A study of intelligent Agent Using CORRA (CORBA기반 지능형 에이전트에 관한 연구)

  • 장일동;이희용
    • Journal of the Korea Society of Computer and Information
    • /
    • v.7 no.1
    • /
    • pp.88-93
    • /
    • 2002
  • In this thesis, we propose an Intelligent Agent based on CORBA technology which can exchange and share data under distributed computing environment using Agent Communication Language(ACL), Recently, due to the rapid development of network technology, the need for the database management appeared. So representative standard, CORBA have been applied and used under distributed environment. Agent applications are being developed for various fields such as electronic commerce, user interface, information retrieval. When a user searches goods, he navigates several servers on different platform until he finds desired goods. The Intelligent Agent presented in this thesis, does these tedious navigations on behalf of the user through communication between different platform.

  • PDF