A. S. Tannenbaum. Modern Operating Systems. Prentice-Hall, Englewood Cli#s, New Jersey, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....item arrives if the channel is empty. Unfortunately, the abstractions provided by Concurrent Haskell are not expressive enough for high level concurrent programming. Already in the early seventies, the disadvantages of semaphores were pointed out and other approaches like monitors were proposed [16]. Nevertheless, Concurrent Haskell still proposes this low level concept of MVars and semaphores. The only exception are channels, which can be used for communication by means of message passing instead of communication by shared variables. However, this is still a very low level concept compared ....

A. S. Tannenbaum. Modern Operating Systems. Prentice-Hall, Englewood Cli#s, New Jersey, 1992.

....Interface 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 ....

....and the 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 ....

[Article contains additional citation context not shown here]

A. Tannenbaum. Modern Operating Systems. Prentice Hall, 1992.

....Both metrics have the disadvantage that they are hijacked by long running jobs. In the extreme case when one of the jobs has an infinite loop, the metric is completely blind to shabby treatment of the other jobs. Perhaps this 46 is why standard operating system texts such as [PS85, Dei90, Tan92] completely ignore traditional scheduling theory. We now introduce a different metric that explicitly recognizes the requirements of interactive jobs. The motivating principle behind the metric is: No job should be ignored for a long time. Here, long time is defined as anything greater than ....

A.S. Tannenbaum. Modern Operating Systems. Prentice-Hall, Englewood Cliffs, NJ, 1992.

....and exploiting file access patterns for improving performance of networked and non networked applications. Prefetching is also used as a standard performance enhancement technique for instruction processing at CPU level. Many of these techniques are described in standard textbooks such as [Tane92] and [Silb93] Recently some of these ideas have been revisited in an effort to improve performance of mobile computing applications. The work of [Tait91] and [Nobl95] is significant in this regard. Caching, especially community caching, has been recognized as viable way to reduce traffic on ....

A. Tannenbaum, "Modern Operating Systems", Prentice Hall, 1992. 15

....covering the many different facets of concurrent programming, parallel programming, concurrent object systems and other related areas. Andrews [And91] is a good text on the general issues of systems level concurrent programming, as are [Ben82] and [Ben90] whilst operating systems texts such as [Tan92] and [Sil94] introduce the concepts from an OS perspective. Multi threading texts are usually based around the usage of particular libraries or interfaces, such as those defined by Unix International (UI) and POSIX. Kleiman et al. [Kle96] provides a good account of multi threaded programming with ....

....Whilst maintaining synchronisation state separately from the functional object may seem strange at first, especially if we consider tracking the number of items in a bounded buffer, this approach has been used for many years. If you pick up any number of operating systems or concurrency texts [And91, Ben90, Sil94, Tan92] you will often find the bounded buffer presented in the context of the producer consumer problem, where an activity producing items for the buffer has to synchronise its actions with an activity consuming items from the buffer. A classic solution to this problem is to use three counting ....

[Article contains additional citation context not shown here]

Tannenbaum A. "Modern Operating Systems", Prentice Hall, 1992

....covering the many different facets of concurrent programming, parallel programming, concurrent object systems and other related areas. Andrews [And91] is a good text on the general issues of systems level concurrent programming, as are [Ben82] and [Ben90] whilst operating systems texts such as [Tan92] and [Sil94] introduce the concepts from an OS perspective. Multi threading texts are usually based around the usage of particular libraries or interfaces, such as those defined by Unix International (UI) and POSIX. Kleiman et al. [Kle96] provides a good account of multi threaded programming with ....

Tannenbaum A. "Modern Operating Systems", Prentice Hall, 1992

.... satisficing behavior [38] i.e. behavior that is good enough , if not optimal. The problem of appropriately allocating an agent s computational resources in dynamic environments bears a strong similarity to the problem of process scheduling in real time or distributed operating systems [41]. In both cases, there are sets of tasks that require computational attention, and the value of successfully completing each task may be time dependent. The real time and distributed operating systems literatures both contain a variety of algorithms for process scheduling (e.g. 24, 16, 26, 48, ....

....the environment. Because each node performs the role of an intelligent assistant, we sometimes refer to the nodes as agent processes . The internal architecture of each DIPART node is based on a generic model of process scheduling, similar to those found in the literature on operating systems [41]. It is depicted in Figure 2. Each node is message driven. Incoming messages indicate external events that typically require some kind of attention. Often there is a time limit associated with each message; in other words, the value of responding to the message may be a time dependent function. ....

A. S. Tannenbaum. Modern Operating Systems. Prentice Hall, Englewood Cliffs, 1992.

....refer to the nodes as agent processes . The internal architecture of each DIPART node is based on a generic model of process scheduling, similar to those found in the literature on operating systems LMC RMM RM s SOC MQ LMC RMM RM s SOC MQ Simulator Other Agents Figure 1: DIPART Architecture (Tannenbaum 1992). Incoming messages are stored on a Message Queue (MQ) and indicate events that may require attention. Often the value of responding to a particular message is time dependent. Thus, a mechanism is needed to determine what processes should be invoked in response to each message, and to schedule ....

.... of decision theoretic estimations of optimal computational sequences (Russell Wefald 1991) Heuristic strategies have been proposed as well (Pollack 1992) The deliberation scheduling problem bears a strong similarity to the problems of process scheduling in real time operating systems (Tannenbaum 1992), job scheduling in operations research (Pinedo 1995) and transmission scheduling in local area networks (Nassehi Tobagi 1987) Not all process or job or transmission scheduling algorithms are applicable to deliberation scheduling, however. In particular, we require scheduling algorithms that ....

Tannenbaum, A. S. 1992. Modern Operating Systems.

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