James W. Wendorf. Operating System/Application Concurrency in Tightly Coupled Multi-Processor Systems. Master's thesis, School of Computer Science, Carnegie Mellon University, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Microkernel Operating Systems In Parallel Architectures - Blum (1994) (Correct)
....partners of a process. In a multi threaded system like ODOS the communicating partners are at least the threads of one task. All these threads use the same virtual memory. It is therefore clear that they can run on different processors of one shared memory multi processor [Bla90b, Bla90a, Wen87] They can also migrate from one processor to another. In the shared memory system they can access memory pages randomly. A difficult situation is when threads are spread out onto different sites and not all memory pages are in the local memory. Threads which operate on the same memory page have ....
James W. Wendorf. Operating System/Application Concurrency in Tightly Coupled Multi-Processor Systems. Master's thesis, School of Computer Science, Carnegie Mellon University, 1987.
A Comparison of basic CPU Scheduling Algorithms for.. - Stephen Curran (1990) (2 citations) (Correct)
....how scheduling is performed in existing multiprocessor operating system implementations [Bla90, Kel89, LT88, TSS88, RW87] All of these systems implement variants of the Central Queue algorithm. Two additional studies are concerned with the overhead of the scheduling algorithms themselves. Wendorf [Wen87] concludes that scheduling decisions should only be made on a (small) subset of the processors in a multiprocessor. Ni and Wu [NW89] analytically studied several scheduling algorithms to show the effects of contention to the ready queue on the performance of the algorithms. In this paper, we ....
J.W. Wendorf, Operating system/application concurrency in tightly-coupled multiple-processor systems, PhD Thesis, Carnegie-Mellon University, Aug. 1987.
A Survey of Multiprocessor Operating System Kernels - Mukherjee, Schwan, Gopinath (1993) (1 citation) (Correct)
....to accommodate such changes. 4.3 Mach Mach [3, 191, 242, 243, 95, 192, 15] is a multiprocessor operating system kernel developed at Carnegie Mellon University first for distributed systems, then for tightly coupled UMA multiprocessors. Later extensions of Mach also address NUMA and NORMA machines [255]. Mach runs on a wide variety of uniprocessor and multiprocessor architectures, including the DEC VAX system, Sun 3 workstations, IBM PCs, the IBM RP3 multiprocessor, the Encore Multimax, and recently, the Intel Paragon. Mach is also supported as a product by a number of hardware vendors. Mach is ....
J. Wendorf. Operating System/Application Concurrency in Tightly Coupled Multiprocessor Systems. PhD thesis, School of Computer Science, Carnegie Mellon University, December 1987. Technical Report CMU-CS-88-117.
Scheduling Support for Concurrency and Parallelism in the Mach.. - Black (1990) (100 citations) (Correct)
....to it, gaining performance by bypassing the run queues. This mechanism is one example of a general technique called Handoff Scheduling that context switches directly to a new thread without searching for it on a run queue. 7 Most of this code has been parallelized, see [5] for details. 8 See [6] for an extensive study of this area 3.2. Priority Calculations Thread priorities consist of a base priority plus an offset derived from recent processor usage. The base priority is set low enough to allow internal kernel threads to run at higher priorities than user threads because the internal ....
....under load. If an adequate hardware source of timestamps exists, such as a 32 bit microsecond counter, the scheduler can be configured to base usage calculations on timestamps from this counter. This eliminates the inaccuracies and distortions caused by statistical usage calculations (see [6] for details) Mach uses the overload factor technique for processor usage aging. The aging overhead is distributed by making each thread responsible for aging of its processor usage. Clock interrupts and events that unblock a thread cause it to check its local copy of a counter against a global ....
J. W. Wendorf, Operating System/Application Concurrency in Tightly-Coupled Multiple-Processor Systems. PhD thesis, Carnegie Mellon University, Department of Computer Science, Pittsburgh, PA, 1987. Available as Technical Report CMU-CS-88-117.
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