Henry Massalin and Calton Pu. Fine-Grain Scheduling. Technical Report CUCS-381-88, Columbia University, November 1988. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Tools and Techniques for Building Fast Portable Threads Packages - Keppel (1993) (71 citations) (Correct)
....close to those of user level threads. Psyche and Scheduler Activations use two level scheduling so that most context switches occur without kernel intervention. Synthesis allows user processes to customize kernel threads in safe ways and uses very fast communication between kernel and user spaces [MP88, MP89]. These systems allow each application to choose (or build) a thread library that implements just the minimum needed functionality and, thus, runs with minimum overhead. Psyche emphasizes the use of applications with more than one thread model within a single application, though all of the above ....
Henry Massalin and Calton Pu. Fine-Grain Scheduling. Technical Report CUCS-381-88, Columbia University, November 1988.
Idleness is Not Sloth - Golding, Bosch, Staelin, al. (1995) (77 citations) (Correct)
....to the quality of the predictions. Rate change based: these predictors maintain an estimate of the first derivative of the arrival rate to predict in advance when the arrival rate will fall below a threshold. Periodic: if the workload contains periodic work, a digital phase locked loop or DPLL [Massalin89a, Lindsey81] can be used to synchronize predictions to periodic events in the workload, such as the UNIX syncer daemon. By knowing when work will arrive, it is also known when the system is idle. 3.1.2. Idle period duration Duration predictors can use a wide range of techniques to adapt to a changing ....
Henry Massalin and Calton Pu. Fine-grain scheduling. Proceedings of Workshop on Experience in Building Distributed and Multiprocessor Systems (Ft. Lauderdale, FL), pages 91--104. USENIX Association, October 1989.
Push: An Experimental Facility for Implementing Distributed.. - Bharat Bhargava (Correct)
....the Unix BSD model for interprocess communication, whose main goal is generality, results in an expensive sequence of procedure calls. Many of those procedure calls are irrelevant to individual messages [6] The Synthesis project also studied the problem of reducing the context switch overhead [18]. Their solution is based on additional hardware support. Push can be used to reduce context switch time along with Synthesis improvements in the performance of layered code, on systems without the special hardware support. Streams increase the modularity and reusability of kernel code in the ....
Henry Massalin and Calton Pu. Fine-grain scheduling. In Proc of the USENIX Workshop on Experiences with Distributed and Multiprocessor Systems, pages 91--104, Fort Lauderdale, FL, October 1989.
Threads and Input/Output in the Synthesis Kernel - Massalin, Pu (1995) (59 citations) Self-citation (Massalin Pu) (Correct)
....Synthesis uses finegrain scheduling, which assigns larger or smaller quanta to threads based on a need to execute criterion. A detailed explanation on fine grain scheduling is beyond the scope of this paper; the idea and its implementation in Synthesis are described in detail in another paper [3]. Here, we only give a brief informal summary. In our directed graph model of computation (Section 2.1) a thread s need to execute is determined by the rate at which I O data flows into and out of its quaspace. Since CPU time consumed by the thread is an increasing function of the data flow, ....
H. Massalin and C. Pu. Fine-grain scheduling. In Proceedings of the Workshop on Experience in Building Distributed Systems, Asilomar, Calilfornia, October 1989.
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