• Title/Summary/Keyword: 혼합된 메시지 전달

Search Result 15, Processing Time 0.025 seconds

A Delivery Scheme for Hybrid Ferry-Mobile Node Messages in DTNs (DTN에서 페리와 이동노드 기반 계층적 메시지 전달 기법)

  • Kim, Byung-Soon;Lee, Bong-Kyu
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.2
    • /
    • pp.137-142
    • /
    • 2009
  • In traditional message ferrying schemes, only ferries carry messages between partitioned networks. In this paper, we propose a new approach to make both ferries and mobile nodes carry messages so that we reduce message delivery delay in disruption tolerant networks. We evaluate our scheme against conventional message ferrying in terms of message delivery delay, throughput, ferry buffer usage and mobile nodes buffer usage.

Location Management & Message Delivery Scheme for Mobile Agent in Multi-region Mobile Agent Computing Environment (다중 지역 이동 에이전트 컴퓨팅 환경에서의 이동 에이전트 위치 관리 및 메시지 전달 기법)

  • 최성진;강인성;백맹순;손진곤;황종선
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04d
    • /
    • pp.490-492
    • /
    • 2003
  • 다중 지역 이동 에이전트 컴퓨팅 환경을 기반하여 이동 에이전트 시스템을 개발하는데 있어서, 이동 에이전트를 관리하고 이동 에이전트들간의 메시지 전달을 보장하기 위한 위치 관리 및 메시지 전달 기법은 중요한 고려사항이다. 그러나 기존이 관련연구들은 여러 지역으로 구성된 다중 지역 이동 에이전트 컴퓨팅 환경에 적용하기에는 위치 갱신 비용 및 메시지 전달 비용이 상대적으로 증가한다는 단점과 추적문제(Following Problem)를 발생시킨다는 한계를 가지고 있다. 이에 본 논문에서는 기존의 홈 프락시 기법과 블랙보드 기법을 변형ㆍ혼합(Hybird)하는 새로운 이동 에이전트 위치 관리 및 메시지 전달 기법인 HB 프로토콜을 제안하고자 한다. HB 프로토콜은 다중 지역 이동 에이전트 컴퓨팅 환경에서 이동 에이전트의 위치 변경시 발생하는 위치 갱신 비용과 이동 에이전트들간의 메시지 전달 비용을 효과적으로 줄이며, 추적문제를 낮은 통신비용으로 해결한다.

  • PDF

Tree Component Model : Component Composition with Hybrid Message Passing (트리 컴포넌트 모델 : 하이브리드 메시지 전달을 사용한 컴포넌트 조합)

  • Huh, Je-Min;Kim, Ji-Hong
    • The KIPS Transactions:PartD
    • /
    • v.15D no.5
    • /
    • pp.659-668
    • /
    • 2008
  • Recently, the component model based on the Exogenous Connector has been proposed in which controls are separated from computation by managing the beginning and result of method calls in the connector. Although it could be loosely coupled between components, it has a problem that is a potential preponderance of element objects of the system by increasing the number of connectors and connection levels. In this paper we propose the Tree Component Model with the Hybrid Message Passing that combines direct and indirect message passing. In our model, components are wrapped by interfaces and controls are separated from computation by only using their interface references. There is a unique feature that the composition structure of components becomes the tree always. As a result of demonstration and comparison, it is found that the Tree Component Model is applicable practically and decreases objects to mediate message passing and build the system.

Hybrid Delegate-based Group Communication Protocol For Overlapped Groups (중복 그룹을 위한 혼합형 대표자 기반 그룹 통신 프로토콜)

  • Kim, Cha-Young;Ahn, Jin-Ho
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.11-22
    • /
    • 2010
  • In case that group communication protocols assume every process is interested in all events occurring in a large scale group, the events multicasting to a subset of a large process group, such as a sensor network, potentially varying for every event based on their interests might lead to very high communication overhead on each individual process. Moreover, despite the importance of both guaranteeing message delivery order and supporting overlapped group using gossip based group communication for multicasting in sensor or P2P networks, there exist little research works on development of gossip-based protocols to satisfy all these requirements. In this paper, we present a new gossip-based causal message order guaranteeing multicast protocol based on local views and delegates representing subgroups and fully utilizing multi-group features to improve scalability. In the proposed protocol, the message delivery order in overlapped groups has been guaranteed consistently by all corresponding members of the groups including delegates. Therefore, these features of the proposed protocol might be significantly scalable rather than those of the protocols guaranteeing atomic order dependencies between multicast messages by hierarchical membership list of dedicated groups like traditional committee protocols and much stronger rather than fully decentralized protocols guaranteeing dependencies between multicast messages based on only local views. And the proposed protocol is a hybrid approach improving the inherent scalability of multicast nature by gossip-based technique in all communications.

A Dual Real-Time Scheduling Design under Real-Time Constraints Kernel Environments (실시간 제약 커널 환경하에서의 이중 실시간 스케쥴링 설계)

  • 인치호
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.6 no.4
    • /
    • pp.369-375
    • /
    • 2001
  • This paper proposes a dual real-time scheduling design under real-time constraints kernel environments. In this paper, we have designed both the real-time kernel and the general kernel that have their different properties to satisfy these properties, that is, interrupt latency, scheduling precision, and message passing. In real-time tasks, interrupt processing should be run. In general kernel, non real-time tasks or general tasks are run. Also, when tasks conflict, it executed the mixed priority scheduling that non real-time kernel executed static scheduling and real-time kernel executed dynamic priority transformation scheduling, that is, least-laxity-first/minimization preemption scheduling. We have compared the results of this study for performance of the proposal real-time kernel with both RT Linux 0.5a and QNX 4.23A, that is, of interrupt latency scheduling precision and message passing.

  • PDF

Performance Enhancement of Parallel Prime Sieving with Hybrid Programming and Pipeline Scheduling (혼합형 병렬처리 및 파이프라이닝을 활용한 소수 연산 알고리즘)

  • Ryu, Seung-yo;Kim, Dongseung
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.10
    • /
    • pp.337-342
    • /
    • 2015
  • We develop a new parallelization method for Sieve of Eratosthenes algorithm, which enhances both computation speed and energy efficiency. A pipeline scheduling is included for better load balancing after proper workload partitioning. They run on multicore CPUs with hybrid parallel programming model which uses both message passing and multithreading computation. Experimental results performed on both small scale clusters and a PC with a mobile processor show significant improvement in execution time and energy consumptions.

A combination of periodic and on-demand scheduling for data broadcasting in mobile convergence networks (모바일 융합망에서 주기적방법과 on-demand 방법을 결합한 데이터 방송 스케줄링 기법)

  • Kang, Sang-Hyuk;Ahn, Hee-June
    • Journal of Broadcast Engineering
    • /
    • v.14 no.2
    • /
    • pp.189-196
    • /
    • 2009
  • We propose a hybrid broadcast scheduling based on a combination of periodic and on-demand data scheduling methods for mobile data broadcasting in convergence networks from communication and broadcasting. We consider an environment in which the forward channel is for data broadcasting and the reverse channel is for sending data requests via cellular phones, WLAN, WiBro, etc. Collecting statistics of requests from clients, the server partitions the data items into hot-item and cold-item sets. Hot items are sent based on a push-based scheduling. An on-demand scheduling method is applied to cold items. Performance evaluation from simulations shows that our proposed scheduling algorithm yields small response time with high successful response ratio.

A Cache Consistency Algorithm for Client Caching Data Management Systems (클라이언트 캐슁 데이터 관리 시스템을 위한 캐쉬 일관성 알고리즘)

  • Kim Chi-Yeon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.1043-1046
    • /
    • 2006
  • Cached data management of clients is required to guarantee the correctness of client's applications. There are two categories of cache consistency algorithms : detection-based and avoidance-based cache consistency algorithm. Detection?.based schemes allow stale data access and then check the validity of any cached data before they ran be allowed to commit. In contrast, under avoidance-based algorithms, transactions never have the opportunity to access stale data. In this paper, we propose a new avoidance-based cache consistency algorithm make use of version. The proposed method maintains the two versions at clients and servers, so it has no callback message and it can be reduced abort ratio of transactions compare with the single-versioned algorithms. In addition to, the proposed method can be decreased cache miss using by mixed invalidation and propagation for remote update action.

  • PDF

Hybridity Images of Miyazaki-hayao Animation (미야자키 하야오의 애니메이션에 나타난 혼종적 이미지(Hybridity Image))

  • Kim, Jun-Su
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.12
    • /
    • pp.160-167
    • /
    • 2008
  • Animations consist of the created artificial images. To interpret of the meaning from analyzing the style of main images is an important element in understanding of animations. Therefore, to analyze images expressed in works of Miyazaki-hayao, this study substitutes the concept of 'hybridity' for images of characters, backgrounds, and mechanics created by him and explores how they are expressed, how they produce symbolic meanings and functions. It is confirmed that main images in selected works as a scope of research have hybridity of images between 'past, present, and future', 'eastern elements and western elements', 'real and virtual', 'human beings and animal' in narrative. From these results, it is concluded that because of hybridity between images, he can present fresh pleasures to spectators, simultaneously communicate thoughtful messages above mere enjoyment, which is a differentiable point with works of other directors.