W. Stallings. Operating Systems: Internals and Design Principles. Prentice Hall, 4th edition, September 2000. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
....[2] red black trees [12] and (a, b) trees [13] Nevertheless, many dictionary applications involve sets of weighted data items that are searched and updated non uniformly according to those weights; that is, they are biased. For example, most operating systems textbooks (e.g. see Stallings [23]) devote major coverage to methods for dealing with biasing in memory requests. Other recent examples of biased sets include client web server requests [11] and DNS lookups [6] For such applications, a biased search structure is more appropriate that is, a structure that achieves search times ....
W. Stallings. Operating Systems: Internals and Design Principles. Prentice-Hall, 4th edition, 2001. 17
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (Correct)
....update performance; e.g. AVL trees [2] red black trees [12] and (a; b) trees [13] Nevertheless, many dictionary applications involve sets of weighted data items subject to non uniform access patterns that are biased according to the weights. For example, operating systems (e.g. see Stallings [22]) deal with biasing in memory requests. Other recent examples of biased sets include client web server requests [11] and DNS lookups [6] For such applications, a biased search structure is more appropriate that is, a structure that achieves search times faster than log n for highly weighted ....
W. Stallings. Operating Systems: Internals and Design Principles. Prentice-Hall, 4th edition, 2001.
Using Virtual Environments to Visualize Atmospheric Data: Can It .. - Ziegeler (2002) (Correct)
....memory is an inexhaustible resource and attempt to store all data in some form within memory. When the data sets are large enough, this reliance on the operating system to handle memory paging can cause poor performance, especially if the organization of the data causes irregular disk accesses [27]. The recently released Cave5D 2.0 [8] may have solved some of these problems, but at the time of the beginning of this study, it had not yet been released. Finally, the CAVELibs must be purchased to use Cave5D or vGeo, and vGeo must be purchased itself. 3.1.2. Software Development The ....
W. Stallings, Operating Systems: Internals and Design Principles, Upper Saddle River, NJ: Prentice-Hall, 1998, pp. 319-360.
Identifying and Modeling Components in the SawMill Operating System - Wagner (Correct)
....for instance use device drivers for hardware access. Additional, Linux has an Initialization subsystem and a Library. The system services are accessible from user applications through kernel interfaces. Performance, safety, and security are important requirements of operating systems [Tan92, Sta00] Operating systems form an abstract layer of a computer system. Therefore, a monolithic approach seemed obvious. The operating system services reside in a protected memory range shared by all user process address spaces. The system services communicate with each other via shared data structures ....
....possibility to add code to the operating system without checking its behavior, increase the risk of malfunctions and malicious servers. This makes it hard to get robust, reliable, safe, and secure operating systems. One approach to solve these problems are multi server operating systems [Tan92, Sta00] The servers of the operating system are isolated by putting each of them into a separate address space, and protected by switching them from privileged to non privileged mode. They communicate with each other using inter process communication (IPC) The required protection and communication ....
[Article contains additional citation context not shown here]
W. Stallings. Operating Systems: Internals and Design Principles. Prentice Hall, 2000.
A Dataspace Manager for Physical Memory - Dussa (2002) (Correct)
....Strategies Although there are a number of memory allocation strategies, all techniques can coarsely be classified into three categories: Linear fit, segregated fit, and buddy system. An excellent, more in depth description of many of the strategies presented in this section can be found in [Sta98] Knu97a] does not feature many of the strategies, but covers first fit and buddy system algorithms with great mathematical detail. For an in depth, comprehensive literature review and strategy comparison, see [WJNB95] 2.1.1 Linear Fit This is probably the most common class of memory ....
William Stallings. Operating Systems --- Internals and Design Principles. Prentice-Hall, Inc., 3rd edition, 1998. 37
Solving the Priority Inversion Problem in legOS - Pedersen, Christiansen.. (2001) (Correct)
....not be possible for an independent lower priority process to preempt or cause any delay in the execution of the higher priority process. With independent we mean that the two processes do not share any resource. A real time operating system can be characterized by the following requirements [Stallings, 1998]: Determinism Responsiveness Reliability Fail soft operation User control First of all the operating system has to behave in a deterministic way. For instance a higher priority process is always expected to finish before a lower priority process, if these do not share any ....
Stallings, W. (1998). Operating Systems: internals and design principles. Prentice-Hall, Inc., 3rd edition. 11
ENPORT Model Builder: An Improved Tool for Multiport Modeling of.. - Hales (2001) (Correct)
....Table 1. Access Controllable Objects and Values. Object Access Values Equations None Read Read Modify Subsystem Contents None Open Open Modify Model File None Load Load Save To implement these ideas, the concepts of Groups and Users , patterned after the UNIX operating system [14], was introduced. At all times during a model building session, a variable defining the Current User exists. The Current User is a system parameter used to identify the person currently working in the modeling environment. The value of the Current User Variable can be changed at any time, which ....
Stallings, W. (1998). Operating Systems: Internals and Design Principles, Prentice Hall, Upper Saddle River, NJ.
Exokernels, Protocol implementation and Erlang - Knutsson, Gunningberg (1999) (Correct)
....also means that the application can request memory that will not cause cache conflicts with existing memory areas. 4.6.3 Virtual memory and page handling A virtual memory system has typically a global strategy for handling page replacement. The Least Recently Used (LRU) algorithm is often used[37]. It evicts the page least recently used when the system runs out of physical memory. While LRU is a reasonable strategy in most cases, it can give rise to unwanted behavior in some circumstances, i.e. when touching a page is actually not a good indication that it in most cases will soon be needed ....
William Stallings. Operating Systems: Internals and Design Principles. Prentice-Hall, third edition, 1998.
Using RTAI/LXRT for Partitioning in a Prototype.. - Huber, Peti.. (2005) (Correct)
No context found.
W. Stallings. Operating Systems: Internals and Design Principles. Prentice Hall, 4th edition, September 2000.
A Physically-Addressed L4 Kernel - Nourai (2005) (Correct)
No context found.
William Stallings. Operating Systems: Internals and Design Principles. Prentice Hall, 3rd edition, 1998.
Biased Skip Lists - Bagchi, Buchsbaum, Goodrich (2004) (Correct)
No context found.
W. Stallings. Operating Systems: Internals and Design Principles. Prentice-Hall, 4th edition, 2001. 17
Instrumenting Java Bytecode to Replay Execution Traces of.. - Baur (2003) (Correct)
No context found.
W. Stallings. Operating Systems: Internals and Design Principles. Prentice Hall, Upper Saddle River, NJ 07458, fourth edition, 2001. ISBN 0-13-031999-6 http://www.prenhall.com/stallings .
Approaches to the Development of OLAP Systems - Fiser, Brezany (2004) (Correct)
No context found.
William Stallings, Operating systems: Internals and design principles, 4/e, Prentice Hall, 2000.
Model Checker Aided Design of a Controller for a Wafer .. - Hendriks, van den.. (Correct)
No context found.
W. Stallings. Operating Systems -- Internals and Design Principles. Prentice--Hall, 1998.
Effects Of Coalescing On The Performance Of Segregated Size.. - Defoe (2003) (Correct)
No context found.
William Stallings. Operating Systems: Internals and Design Principles. Prentice Hall, 4th edition, 2001.
Embedded Software Streaming via Block Streaming - Kuacharoen (2004) (Correct)
No context found.
Stallings, W., Operating Systems: internals and design principles. Upper Saddle River, NJ: Prentice Hall, fourth ed., 2001.
An Investigation of the Unified Parallel C Memory Consistency Model - Huang (2002) (Correct)
No context found.
William Stallings. Operating Systems: Internals and Design Principles, 4/E Prentice Hall.
Debugging Parallel Systems: A State of the Art Report - Huselius (2002) (Correct)
No context found.
William Stallings. Operating Systems: Internals and Design Principles. PrenticeHall Inc., 2001.
Monitoring And Analyzing Method Invocations In The 2K Operating.. - Mao (1999) (2 citations) (Correct)
No context found.
William Stallings, Operating Systems: Internals and Design Principles, Prentice-Hall, Inc., 1998.
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