A. S. Tanenbaum. Distributed Operating Systems. Prentice-Hall, Inc., 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
A Dynamic Load Balancing Model for a Distributed System - Akay (2001) (Correct)
.... of the whole system efficiently by distributing the load among the processors to maximize the overall system performance[1] The distributed scheduler must perform the load distributing operations transparently, which means the whole system is viewed as a single computer by the users of it [2]. A distributed system consists of independent workstations connected usually by a local area network. Users of the system submit jobs to their computers at random times. In such a system some computers are heavily loaded while others have available processing capacity. The goal of the load ....
Tanenbaum, A., 1995, Distributed Operating Systems, Prentice Hall
A Protocol for Lock Based Cache Consistency in the Pegasus.. - Lein-Mathisen (1992) (Correct)
....provide four functions: Manage processes and threads, provide low level memory management support, support communication and handle low level I O. A collection of servers provide most of the traditional operating system functionality. Communication in Amoeba is based on the client server paradigm [43]. The system consists of a set of objects which are managed by servers. Clients which want to use an object must give a requests to the server managing the object. Different servers provide different services. When an object is created the server creates a capability for it which is ....
Tanenbaum, A., and Van Renesse, R. Distributed operating systems. Computer Surveys (USA) 17, 4 (December 1985), pp. 419--470.
The Design and Verification of the Rio File Cache - Ng, Chen (2001) (1 citation) (Correct)
....memory such as Flash RAM [73] We do not consider power outages further in this paper. Memory s vulnerability to operating system crashes is more challenging. Most people would feel nervous if their system crashed while the sole copy of important data was in memory, even if the power stayed on [68], 63] 28] Consequently, file systems write data periodically to disk and transaction processing applications view transactions as committed only when data is written to disk. Memory s perceived unreliability forces a trade off between performance and reliability (Fig. 1) Applications ....
....entire category. Our goal is to make the Rio file cache as reliable as a write through file cache. Write through file caches are considered very reliable against software crashes because they propagate data immediately to disk and disks are not easily corrupted by operating system crashes [63] [68], 15] We configure FreeBSD to use a write through file cache, then measure the corruption rate to be 3.1 percent using the method described in Section 2. That is, 3.1 percent of the crashes corrupt some data in the file system. Our reliability goal for the Rio file cache is thus to achieve a ....
A.S. Tanenbaum, Distributed Operating Systems. Prentice Hall, 1995.
Virtual Shared Files: Towards User-Friendly.. - Konovalov, Samofalov, .. (Correct)
....memory is explicitly allocated by user what is essential for massively parallel computers. 1 Introduction. Mechanism of parallel components interaction is a critical issue of creating programs for massively parallel computers. Traditionally there are 3 kinds of parallel interaction paradigms [8]: shared memory, message passing, RPC. Usually to compare them such criteria as e ectiveness, overhead of implementation and portability are used. As can be seen from the experience of using supercomputer MBC 100 [4] for application programmers it s also very important that interaction paradigm ....
Tanenbaum, A. S.: Distributed Operating System. Prentice-Hall, Inc. (1995)
A Two-Tier Distributed Electronic Design Framework - Kazmierski, Clayton (2002) (Correct)
....HSPICE results. 4. Security Java is designed specifically for network based computing and security measures are an integral part of Java s design. Few other distributed solutions can make this claim. From their inception, most other distributed solutions utilize a traditional execution model [14]. The business end of he Java security model [15] is conveniently described by using the metaphor of the Sandbox , which comprises a number of cooperating system components, ranging from security managers that execute as part of the application, to security measures designed into the Java Virtual ....
Tanenbaum AS. "Distributed Operating Systems", Prentice Hall International Publishing 1995, ISBN 0-13-143934-0.
Object-oriented Issues - A Literature Review - Nierstrasz (Correct)
....explain various aspects of data abstraction. See also papers on languages with data abstraction mechanisms, and some of the papers on types. Gutt77 Ledg77 Smit77a Smit77b] Distribution: Papers on distributed problems are also mixed in with those on concurrency, reliability, and transactions. [Bada86 Jaco86 Tane85] Object management: These papers talk about object oriented databases and databases for managing objects. The Oppen paper discusses object naming issues. Baro81 Derr85 Gold80a Lyng84 Maie86 McLe85 Oppe83 Skar86 Zdon84 Zdon86a] Memory: These are all papers on garbage collection. The Almes ....
A.S. Tanenbaum and R. Van Renesse, "Distributed Operating Systems", ACM Computing Surveys, vol. 17, no. 4, pp. 419-470, Dec 1985.
Techniques for Mapping Tasks to Machines in Heterogeneous - Howard (Correct)
....problem under consideration. 5. MSHN: An example resource management system #### ######## A resource management system (RMS) views the set of heterogeneous machines that it manages as a single virtual machine, and attempts to give the user a location transparent view of the virtual machine [24]. The RMS should be able to provide the users a higher level of overall performance than would be available from the users local system alone. The management system for heterogeneous networks (MSHN pronounced mission ) 18] is an RMS for use in HC environments. MSHN is a collaborative research ....
R. van Renesse, A.S. Tanenbaum, Distributed operating systems, ACM Comput. Surveys 17 (4) (1985.
Parallel Crawlers - Cho, Garcia-Molina (2002) (26 citations) (Correct)
....how a crawler should adjust revisit frequencies for pages when the pages change at di#erent rates. We believe these studies are orthogonal to what we discuss in this paper. There also exists a significant body of literature studying the general problem of parallel and distributed computing [20, 22, 25, 28]. Some of these studies focus on the design of e#cient parallel algorithms. For example, References [25, 21, 15] present various architectures for parallel computing, propose algorithms that solve various problems (e.g. finding maximum cliques) under the architecture, and study the complexity of ....
....of divide and conquer approach, since we partition and assign the Web to multiple processes. Another body of literature designs and implements distributed operating systems, where a process can use distributed resources transparently (e.g. distributed memory, distributed file systems) [28, 27, 1, 17]. Clearly, such OSlevel support makes it easy to build a general distributed application, but we believe that we cannot simply run a centralized crawler on a distributed OS to achieve parallelism. A web crawler contacts millions of web sites in a short period of time and consumes extremely large ....
A. S. Tanenbaum and R. V. Renesse. Distributed operating systems. ACM Computing Surveys, 17(4), December 1985.
A Distributed File System Over Distributed Shared Memory - Jamjoom, Raasch, Shih (1999) Self-citation (Andrew) (Correct)
No context found.
Tanenbaum, Andrew S. Distributed Operating System. New Jersey: Prentice Hall, 1995.
Autonomous Decentralized Community Communication Technology for.. - Ragab (2004) (Correct)
No context found.
A. S. Tanenbaum. Distributed Operating Systems. Prentice-Hall, Inc., 1995.
The BeanChannel: Java Distributed Event Model - Kleindienst (Correct)
No context found.
Tanenbaum, A.: Distributed Operating Systems, Prentice Hall, 1995
A Cost/Benefit Model for Dynamic Resource Sharing - Dimitrios Katramatos Dept (2000) (Correct)
No context found.
A. Tanenbaum. Distributed Operating Systems. Prentice-Hall, Inc., 1995.
Distributed Algorithms and Educational Simulation/Visualisation.. - Koldehofe (2005) (Correct)
No context found.
Tanenbaum, A. S. 1995. Distributed Operating Systems. Prentice-Hall, Inc., Chapter 6, 289--375.
An Overview of Methods Employed by Hackers - And Crackers Pradeep (Correct)
No context found.
A. S. Tanenbaum, Distributed operating systems. Englewood Cliffs, NJ 07632, USA: Prentice-Hall, 1995.
Supporting Interoperability in Corba via Object Services - Adamec, Gróf.. (1995) (Correct)
No context found.
A. S. Tanenbaum. Distributed Operating Systems. Prentice Hall, 1995.
Cooperative Negotiation in a Multi-Agent System for Real-Time.. - Bigham, Du (2003) (Correct)
No context found.
A. S. Tanenbaum. Distributed Operating Systems. Prentice Hall, Inc., 1995.
An Overview of Methods Employed by Hackers - And Crackers Pradeep (Correct)
No context found.
A. S. Tanenbaum, Distributed operating systems. Englewood Cliffs, NJ 07632, USA: Prentice-Hall, 1995.
An Agent-Based Middleware for Supporting Spontaneous.. - Aldunate, Gonzalez.. (2002) (Correct)
No context found.
Tanenbaum A. Distributed operating systems. Prentice Hall. 1996.
Fast Multi-Threading on Shared Memory Multiprocessors - Cordina (2000) (5 citations) (Correct)
No context found.
Tanenbaum, A.S.Distributed Operating Systems. Prentice-Hall International, 1995.
Reliability Requirements in Mobile Agent Systems - Silva, Macedo (2000) (Correct)
No context found.
A.S.Tanenbaum. Distributed Operating Systems. Prentice Hall, Inc. 1995
Eve: A Scalable Network Client Emulator - Hani Jamjoom Kang (2003) (Correct)
No context found.
TANENBAUM,A.S.Distributed Operating Systems. Prentice-Hall, Inc., 1995. 15
An Architectural Approach to Replication Configuration - Marangozova, Hagimont (Correct)
No context found.
A.Tanenbaum. Distributed operating systems. Prentice Hall, 1995.
A Survey of Remote Procedure Call - Gopinath Prasanna Srikar (Correct)
No context found.
AS Tanenbaum. Distributed Operating Systems. Section 2.4.
Comparision of Multiagent Inference Methods in Multiply Sectioned.. - Xiang (Correct)
No context found.
A.S. Tanenbaum. Distributed Operating Systems. Prentice Hall, 1995.
DeViouS: A Distributed Environment for Computer Vision - III, Samal (1995) (1 citation) (Correct)
No context found.
A. S. Tanenbaum and R. van Renesse, `Distributed operating systems', Computing Surveys, 17, (4), 419--470 (1985).
First 50 documents Next 50
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