Tanenbaum, Andrew and Woodhull, Albert 1997. Operating Systems: Design and Implementation, Prentice Hall. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Server Scheduling in the L_p Norm: A Rising Tide Lifts All.. - Bansal, Pruhs (2003) (Correct)
....for some jobs to be starved. In some sense FIFO is the optimally fair policy in that it optimizes the maximum flow time objective. Operating systems such as Unix don t implement pure SETF, or even pure MLF, the less preempting version of SETF. Once again this is out of fear of starving jobs [28, 29]. Unix systems adopt compromise policies that attempt to balance the competing demands of average QoS and fairness. In particular, Unix scheduling policies generally raise the priority of processes in the lower priority queues that are being starved [28] The desire to optimize for the average ....
....this is out of fear of starving jobs [28, 29] Unix systems adopt compromise policies that attempt to balance the competing demands of average QoS and fairness. In particular, Unix scheduling policies generally raise the priority of processes in the lower priority queues that are being starved [28]. The desire to optimize for the average and the desire to not have extreme outliers generally conflict. The most common way to compromise is to optimize the Lp norm, generally for something like p = 2 or p = 3. For example, the standard way to fit a line to collection of points is to pick the ....
[Article contains additional citation context not shown here]
A. Tanenbaum. Operating systems: design and implementation. Prentice-Hall, 2001.
Comparing two Distributed Computing Paradigms - a Performance.. - Knudsen (1995) (5 citations) (Correct)
....Before we describe the Tacoma paradigm, we will give a brief overview of the subject of process migration. This overview enables the reader to identify the main differences when compared to the moving agents paradigm. A process is one of the two major components of a distributed system. Tanenbaum [56] defines a process to be a program in execution, consisting of the executable program and all the other information, i.e. stack, pointers and registers, needed to run the program. The approach taken by the process migration community is to transfer this running process to other machines ....
Tanenbaum, Andrew S.: "Operating systems: Design and implementation", Prentice-Hall, 1987. 85
Routing Indices for Peer-to-Peer Systems - Crespo, Garcia-Molina (2002) (93 citations) (Correct)
....effect of the cycle is the increase in cost of creating updating the RI. Cycle avoidance solution: In this solution we do not allow nodes to create an update connection to other nodes if such connection would create a cycle. The techniques for cycle avoidance have been extensively studied (see [22] for a survey) and we do not cover it further in this paper. The main disadvantage of this approach is that in the absence of global information we may end with a suboptimal solution. Cycle detection and recovery: This solution detects cycles sometime after they are formed and, after that, takes ....
A. Tanenbaum and A. Woodhull. Operating Systems Design and Implementation. Prentice-Hall, Inc., 1999.
Parallel Systems in Symbolic and Algebraic Computation - Matooane (2002) (2 citations) (Correct)
....without any Operating System memory copy. To clarify the strong features of rDMA, consider the conventional distributed IPC based on message passing. These systems create OS support for complex bu#er management and a detailed protocol for send and receive acknowledgement and authentication [8, 117, 94]. The system overview is shown in figure B.6. The Operating System first copies the message into allocated bu#ers within the system space which is then transmitted across the network to the recipient s address space. The overhead for context switching and memory copying adds considerably to ....
Andrew S. Tanenbaum and Albert S. Woodhull. Operating Systems: Design and Implementation. Prentice Hall, second edition, 1997.
Fault Resilience In Main-Memory Databases: Handling Process.. - Bohannon (1999) (Correct)
....implement a binary semaphore, one in which only a single process is allowed to hold the semaphore at a time. Spin locking implementations of binary semaphores have been extensively studied in the parallel computing and operating system communities. We point the reader to operating systems texts [68, 76], a survey by Dinning [23] and surveys with performance analysis by Anderson [5] and by Graunke and Thakkar [32] Spin locks are typically two orders of magnitude faster than operating system semaphores, and are generally acknowledged to be an important factor in the success of multi processor 6 ....
A. Tanenbaum, A. Woodhull, and A. Woodhull. Operating Systems: Design and Implementation. Prentice Hall, second edition, January 1997.
Grasshopper: An orthogonally persistent operating system - Dearle, di Bona, Farrow, .. (1994) (44 citations) (Correct)
....above conventional operating systems. Implementors of persistent languages are invariably forced to construct an abstract machine above the operating system, since the components of a persistent system are different in nature to the components of a conventional operating system. For example, in [37], Tanenbaum lists the four major components of an operating system as being memory management, file system, input output and process management. In persistent systems, the file system and memory management components are unified. In many operating systems, input output is presented using the same ....
Tanenbaum, A. S. "Operating Systems: Design and Implementation", Prentice Hall, International Editions, 1987.
An Examination of Operating System Support for.. - Dearle.. (1992) (12 citations) (Correct)
....operating systems. Existing operating systems do not provide an ideal platform for the development of persistent systems. This is not surprising since this was never part of their design goals. Indeed, most operating systems have files as their only abstraction over long term memory. Tanenbaum [38] has listed the four major components of an operating system as being memory management, file system, input output and process management. The nature of these four components is different in persistent systems. In a persistent system, the functionality of the file system and memory management are ....
Tanenbaum, A. S. "Operating Systems: Design and Implementation", International Editions, Prentice Hall, 0-13-637331-3, 1987.
Supporting Program Comprehension Using Semantic and.. - Maletic, Marcus (2001) (3 citations) (Correct)
....3.1. Previous Experiments using LSI In previous experiments done by the authors, the function and class declaration levels have been used [32] Two readily available sot tware systems were used as data for the experiments: LEDA [26] Library for Efficient Data structures and Algorithms) and MINIX [47] (Operating System) LEDA is a library of the data types and algorithms for combinatorial computing and provides a sizable collection of data types and algorithms in a form that allows them to be used by non experts. LEDA is composed of over 140 C classes. MINIX is a simple version of the UNIX ....
Tanenbaum, A. and Woodhull, A., Operating Systems Design andImplementation, Prentice Hall, 1997.
Grasshopper: An orthogonally persistent operating system - Dearle, di Bona, Farrow, .. (1994) (44 citations) (Correct)
....above conventional operating systems. Implementors of persistent languages are invariably forced to construct an abstract machine above the operating system, since the components of a persistent system are different in nature to the components of a conventional operating system. For example, in [37], Tanenbaum lists the four major components of an operating system as being memory management, file system, input output and process management. In persistent systems, the file system and memory management components are unified. Some persistent systems require that the state of a process ....
Tanenbaum, A. S. "Operating Systems: Design and Implementation", International Editions, 0-13-637331-3, 1987. 14
Asurvey Of Contemporary Instructional Operating - Systems For Use (2005) (Correct)
No context found.
Tanenbaum, Andrew and Woodhull, Albert 1997. Operating Systems: Design and Implementation, Prentice Hall.
CAR: Clock with Adaptive Replacement - Bansal, Modha (2004) (3 citations) (Correct)
No context found.
A. S. Tanenbaum and A. S. Woodhull, Operating Systems: Design and Implementation. Prentice-Hall, 1997.
Understanding the Linux 2.6.8.1 CPU Scheduler - Aas (2005) (Correct)
No context found.
Andrew S. Tanenbaum, Albert S. Woodhull. Operating Systems Design and Implementation, 2nd Edition. Prentice Hall, 1997.
High Availability Computer Systems - Jim Gray Daniel (1991) (10 citations) (Correct)
No context found.
Tanenbaum, A. S. (1987). Operating Systems: Design and Implementation. Prentice Hall, Englewood Cliffs,1989.
Jim Gray, Prakash Sundaresan - Digital San Francisco (Correct)
No context found.
Tanenbaum, A.S., Operating Systems: Design and Implementation, Prentice Hall, 1986.
Efficient URL Caching for World Wide Web Crawling - Broder, Najork, Wiener (2003) (1 citation) (Correct)
No context found.
A. S. Tanenbaum and A. S. Woodhull. Operating Systems -- Design and Implementation. Prentice-Hall, second edition, 1997.
Server Scheduling in the L_p Norm: A Rising Tide Lifts All.. - Bansal, Pruhs (2003) (Correct)
No context found.
A. Tanenbaum. Operating systems: design and implementation. Prentice-Hall, 2001.
Algorithms for Flow Time Scheduling - Bansal (2003) (Correct)
No context found.
A. Tanenbaum. Operating systems: design and implementation. Prentice-Hall, 2001.
Using Minix to Teach Computer Security Courses - Wenliang Du And (Correct)
No context found.
A. Tanenbaum. Operating Systems: Design and Implementation. Prentice Hall, 2nd edition, 1996. 5
Communion: A New Strategy For Memory Management In.. - Computer Systems Edson (Correct)
No context found.
TANENBAUM, A. S. & WOODHULL, A. S. Operating systems: design and implementation. 2nd. Ed., Prentice-Hall , 1997.
Explicit Surface Remeshing - Surazhsky, Gotsman (2003) (3 citations) (Correct)
No context found.
A. S. Tanenbaum. Operating Systems: Design and Implementation. Prentice-Hall, Inc., 1987.
Designing an Operating System for a Heterogeneous.. - Nollet, Coene.. (2003) (7 citations) (Correct)
No context found.
A. Tanenbaum, A. Woodhull, "Operating Systems: Design and Implementation", Prentice Hall Inc., 1997, ISBN 0-13-638677-6
CAR: Clock with Adaptive Replacement - Bansal, Modha (2004) (3 citations) (Correct)
No context found.
A. S. Tanenbaum and A. S. Woodhull, Operating Systems: Design and Implementation. Prentice-Hall, 1997.
Symmetric Multi-Processing (SMP) systems on top of - Contemporary Intel Appliances (Correct)
No context found.
Tanenbaum & Woodhull. Operating Systems: Design and Implementation. Prentice Hall 1997
Software---Practice And Experience, Vol. 25(6), 579--596.. - Automatic Verification Of (Correct)
No context found.
A.S. Tanenbaum, Operating Systems: Design and Implementation, Prentice-Hall, 1987.
SDFS A Design and Architecture of Highly Scalable.. - Suriyabhumi, Uthayopas (Correct)
No context found.
Andrew S. Tanenbaum, Albert S. Woodhull, "Operating Systems: Design and Implementation", Prentice Hall, 2 nd edition, 1997
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