A. S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Operator Learning for a Problem Class in a Distributed.. - Jelasity, Preuss, Eiben (2002) (Correct)
....Producing durable knowledge can be an expensive and slow process. However, distributed systems on wide are networks offer a natural solution to problems that require a huge amount of resources. With the overall success of the Internet distributed computation is getting more and more attention [6, 16]. Systems exist that can utilize resources available in the form of e.g. the idle time of computers on the Internet [15, 17] As part of the DREAM project ( 12] such a computational environment was developed, the DRM (distributed resource machine) The DRM unlike e.g. SETI home is based on ....
A. S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002.
XGuide - Concurrent Web Development with Contracts - Kerer (2003) (4 citations) (Correct)
....the response time, Web servers can be grouped in Web server clusters. A load balancer distributes the incoming requests on the separate servers improving performance and availability. In general, Web sites and Web applications are perfect examples of distributed applications as outlined in [138]. Tanenbaum et al. classify applications according to where their processing 12 2.2 The Architecture of the World Wide Web Figure 2.1: The extended client server architecture of the World Wide Web. happens. Some Web applications require the client to perform a large share of the workload; ....
Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems: Principles and Paradigms. Prentice-Hall, Englewood Cliffs, NJ, 2002.
Self-Stabilizing and Snap-Stabilizing Wave Algorithms (Extended.. - Petit (Correct)
....distributed in mum computation, election of a leader, synchronization of processes, mutual exclusion, spanning tree construction, etc. The reader may refer to a large number of books about the principles of distributed systems and their use in computer networks, e.g. Gou98, RH90, Tel94, Tan96, TvS02] Wave algorithms (sometimes referred to as total algorithms [Tel88] are widely used as the basis to solve many network control problems. A wave algorithm is a distributed algorithm where the participation of all processes in the network is required before a particular event, called a decision, ....
AS Tanenbaum and M van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002.
NRMI: Natural and Efficient Middleware - Tilevich, Smaragdakis (2003) (2 citations) (Correct)
....lists, graphs, trees, hash tables, or even non recursive structures like a customer object with pointers to separate address and company objects. This is a serious restriction and one that has been often identified. The recent (2002) Tanenbaum and van Steen Distributed Systems textbook [17] summarizes the problem and (most) past approaches concisely: Although [call by copy restore] is not always identical [to call by reference] it frequently is good enough. I]t is worth noting that although we can now handle pointers to simple arrays and structures, we still cannot handle ....
....alternative of call by copy in middleware is callby copy restore. Call by copy restore is a parameter passing semantics that is usually defined informally as having the variable copied to the stack by the caller . and then copied back after the call, overwriting the caller s original value [17]. A more strict (yet still informal) definition of call by copy restore is: Making accessible to the callee a copy of all data reachable by the caller supplied arguments. After the call, all modifications to the copied data are reproduced on the original data, overwriting the original data values ....
[Article contains additional citation context not shown here]
Andrew S. Tanenbaum and Maarten van Steen, Distributed Systems: Principles and Paradigms, Prentice-Hall, 2002.
Data Replication Strategies in Grid Environments - Lamehamedi, Szymanski.. (2002) (3 citations) (Correct)
....create new replicas at desirable locations or select among replicas based on network or storage system performance. 3. Replica Management Services Design Replication has been studied extensively and different distributed replica management strategies have been proposed in the literature [22, 4, 17, 8, 7, 11, 18, 13]. In the context of data grid technology, replication is mostly used to reduce access latency and bandwidth consumption. In our approach, replication is also used to balance the load of data requests within the system both on the network and host levels, and to improve reliability. Given the size ....
A. S. Tanenbaum and M. van Steen, "Distributed Systems, Principles and Paradigms," first edition, Prentice Hall, 2002.
Development of a Remote Object Webcam Controller (ROWC) with.. - McCown (2002) (Correct)
....reflected in the GUI. Cam Controller addVideo removeVideo MediaStore Object Viewer Object GUI Viewer Object GUI Update Update MediaArchive Events Media Archive Callback Object Figure 12 Updating GUI when media archive is changed. Cam Controllers on the other hand use the CORBA callback model [TS02]. The callback model is useful for asynchronous event notification. For example, assume a client needs to know about a particular event that will eventually take place on the server. The client will need to provide an object to the server that contains methods the server will invoke when the ....
Tanenbaum, A. and M. Steen, Distributed Systems: Principles and Paradigms, Prentice Hall, 2002, pp. 504-505.
An Agent-based Location Service for Ad Hoc Networks - Jiang, Camp (Correct)
....to three other location service alternatives. We call our agent based location service NEWS since it could be extended to maintain other information on MANET nodes. An agent is an autonomous process capable of reacting to its environment, possibly in collaboration with users and other agents [17]. These software agents have been used in the implementation of network protocols at various layers. A mobile agent is an agent that can migrate from one host to another host in a heterogeneous network. The agent chooses when and where to migrate. When the agent makes the decision to migrate, the ....
A. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002.
Gossip-Based Dissemination of Time - Iwanicki (2005) Self-citation (Van steen) (Correct)
No context found.
A.S. Tanenbaum and M. van Steen, Distributed Systems: Principles and Paradigms. Prentice Hall, 2002. 68
Safety and Consistency in Policy-Based Authorization Systems - Lee, Winslett (2006) (Correct)
No context found.
A. S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002.
by CRC Press LLC - Network Security And (Correct)
No context found.
A.S. Tanenbaum and M. van Steen, Distributed Systems --- Principles and Paradigms, Prentice-Hall, Englewood Cliffs, NJ, U.S.A., 2002.
Exploiting Independent State for Network Intrusion Detection - Sommer, Paxson (2004) (Correct)
No context found.
A. S. Tanenbaum and M. V. Steen. Distributed Systems -- Principles and Paradigms. Prentice Hall, 2002.
Caching Web Services in Mobile Ad-Hoc Networks: Opportunities.. - Friedman (2002) (2 citations) (Correct)
No context found.
A. S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002.
A Survey of Ring-Building Network Protocols Suitable for.. - Sobeih, Yurcik (Correct)
No context found.
A. S. Tanenbaum and M. van Steen, Distributed Systems: Principles and Paradigms, Prentice Hall, Inc., 2002.
Parallel Hypothesis Driven Video Content Analysis - Granmo (2004) (Correct)
No context found.
A. S. Tanenbaum and M. Steen. Distributed Systems - Principles and Paradigms. Prentice Hall, 2002.
An Active Memory as a Model for Information Fusion - Wrede, Hanheide, Bauckhage.. (2004) (1 citation) (Correct)
No context found.
A. S. Tanenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002.
Parallel Hypothesis Driven Video Content Analysis - Granmo (2004) (Correct)
No context found.
A. S. Tanenbaum and M. Steen. Distributed Systems - Principles and Paradigms. Prentice Hall, 2002.
Tracing System-Level Communication in Distributed Systems - Mann, Kondorosi (2004) (Correct)
No context found.
A. S. Tanenbaum and M. v. Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, 2002.
Distributed Scheduling for Disconnected Cooperation - Malewicz (2003) (1 citation) (Correct)
No context found.
Tanenbaum, A.S., van Steen, M.: Distributed Systems: Principles and Paradigms. Prentice Hall (2001)
Ist-2001-33234 - Peer-To-Peer Implementation And (Correct)
No context found.
Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, Inc., 2002. ISBN-0-13-088893-1.
Network Security and Secure Applications - Kruegel (2004) (Correct)
No context found.
Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems - Principles and Paradigms. Prentice Hall, Englewood Cli s, New Jersey, USA, 2002.
Legal Aspects of Agent Technology - Apistola Brazier Kubbe (2002) (Correct)
No context found.
A.S. Tanenbaum, M. Steen, van. (2002), Distributed Systems principles and paradigms. p. 367 Prentice Hall Inc. New Jersey. ISBN 0-13-088893-1.
Turntaking: A Case for Agent-Based Programming - Hulstijn, Vreeswijk (2003) (Correct)
No context found.
Andrew S. Tanenbaum and Maarten van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, New York, 2002.
Efficient Delivery of Web Services - Ouzzani (2004) (1 citation) (Correct)
No context found.
A. S. Tannenbaum and M. van Steen. Distributed Systems: Principles and Paradigms. Prentice Hall, New Jersey, USA, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC