The Propagate Cache Updates Pattern

نویسنده

  • Kyle Brown
چکیده

This pattern is part of a largely undeveloped section of the pattern language on application architectures that use messaging. These patterns are more finely-grained, and less generally applicable than the other patterns in this language, documented in [Woolf] and [Hohpe]. Other patterns in this section that have not yet been published include Logging to a Queue, where a logging infrastructure is built using Enterprise Messaging and Local and Remote Update, where we discuss how to keep information held both in a local (distributed) database and a remote (mainframe) database in synchronization using Enterprise Messaging.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Selective Push Algorithm for Cooperative Cache Consistency Maintenance over MANETs

Cooperative caching is an important technique to support efficient data dissemination and sharing in Mobile Ad hoc Networks (MANETs). In order to ensure valid data access, the cache consistency must be maintained properly. Many existing cache consistency maintenance algorithms are stateless, in which the data source node is unaware of the cache status at each caching node. Even though stateless...

متن کامل

CUP: Controlled Update Propagation in Peer-to-Peer Networks

Recently the problem of indexing and locating content in peer-to-peer networks has received much attention. Previous work suggests caching index entries at intermediate nodes that lie on the paths taken by search queries, but until now there has been little focus on how to maintain these intermediate caches. This paper proposes CUP, a new comprehensive architecture for Controlled Update Propaga...

متن کامل

A Peer-to-Peer Approach to Resource Discovery in Multi-agent Systems

A multi-agent system is a network of software agents that cooperate to solve problems. In openmulti-agent systems, the agents that need resources provided by other agents are not aware of which agents provide the particular resources. We propose a fully distributed approach to this resource discovery problem. Each agent A maintains a limited size local cache in which it keeps information about ...

متن کامل

Parallel Cache Management Protocol for Static and Dynamic Web Contents

This paper studies Random Request Distribution and Load Balancing Cache protocol (RLC) and Randomly Selected and Limited Look at neighbor (RSLL) cache algorithm based on Byte Access Frequency Factor (BAFF) for internet services with multimedia and dynamic web content. The RSLL cache algorithm considers reducing response time and achieving good load balance among web servers using limitation of ...

متن کامل

Parallelization of Graph Transformation Based on Incremental Pattern Matching

Graph transformation based on incremental pattern matching explicitly stores all occurrences of patterns (left-hand side of rules) and updates this result cache upon model changes. This allows instantaneous pattern queries at the expense of costlier model manipulation and higher memory consumption. Up to now, this incremental approach has considered only sequential execution despite the inheren...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002