NDLI: Processor scheduling in shared memory multiprocessors

Please wait, while we are loading the content...

Unboundedly parallel simulations via recurrence relations

A performance evaluation of a general parallel processing model

Efficient trace-driven simulation method for cache performance analysis

Techniques for efficient inline tracing on a shared-memory multiprocessor

Blocking: exploiting spatial locality for trace compaction

A Bayesian approach to fault classification

Probabilistic language analysis of weighted voting algorithms

An evaluation of redundant arrays of disks using an Amdahl 5890

Simultaneous analysis of flow and error control strategies with congestion-dependent errors

Queueing analysis of an ATM switch with multichannel transmission groups

Approximate analysis of reader and writer access to a shared resource

Quartz: a tool for tuning parallel program performance

A calculus of variations approach to file allocation problems in computer systems

Data cache management using frequency-based replacement

An approximate analysis of the LRU and FIFO buffer replacement schemes

An advisor for flexible working sets

Analysis of critical architectural and programming parameters in a hierarchical

Performance evaluation of a commercial cache-coherent shared memory multiprocessor

Performance analysis of the connection machine

An analytic model of multistage interconnection networks

Dynamic partitioning in a transputer environment

Processor scheduling in shared memory multiprocessors

The performance of multiprogrammed multiprocessor scheduling algorithms

Efficient simulation of multiprogramming

Making flow control work in networks: a control-theoretic analysis of gateway service disciplines

Making greed work in networks: a game-theoretic analysis of gateway service disciplines

Factors affecting the performance of multiuser database management systems

A benchmark of NonStop SQL release 2 demonstrating near-linear speedup and scaleup on large databases

Phased mission reliability analysis

Performance analysis of a fault tolerant computer system

Ray tracing on distributed memory parallel systems

Characterizing and modeling Ethernet performance of distributed DECwindows applications

Challenges in obtaining peak parallel performance with a Convex C240, parallel vector processor

Traffic characterization of the NSFNET national backbone

Ease: an environment for architecture study and experimentation

Dynamic queue behavior in networks with window protocols

The performance of multistage interconnection networks with finite buffers

Adaptive window flow control and learning algorithms for adaptive routing in data networks

Modeling a circuit switched multiprocessor interconnect

Processor scheduling in shared memory multiprocessors

Content Provider	ACM Digital Library
Author	McCann, Cathy Zahorjan, John
Abstract	Existing work indicates that the commonly used “single queue of runnable tasks” approach to scheduling shared memory multiprocessors can perform very poorly in a multiprogrammed parallel processing environment. A more promising approach is the class of “two-level schedulers” in which the operating system deals solely with allocating processors to jobs while the individual jobs themselves perform task dispatching on those processors.In this paper we compare two basic varieties of two-level schedulers. Those of the first type, static, make a single decision per job regarding the number of processors to allocate to it. Once the job has received its allocation, it is guaranteed to have exactly that number of processors available to it whenever it is active. The other class of two-level scheduler, dynamic, allows each job to acquire and release processors during its execution. By responding to the varying parallelism of the jobs, the dynamic scheduler promises higher processor utilizations at the cost of potentially greater scheduling overhead and more complicated application level task control policies.Our results, obtained via simulation, highlight the tradeoffs between the static and dynamic approaches. We investigate how the choice of policy is affected by the cost of switching a processor from one job to another. We show that for a wide range of plausible overhead values, dynamic scheduling is superior to static scheduling. Within the class of static schedulers, we show that, in most cases, a simple “run to completion” scheme is preferable to a round-robin approach. Finally, we investigate different techniques for tuning the allocation decisions required by the dynamic policies and quantify their effects on performance.We believe our results are directly applicable to many existing shared memory parallel computers, which for the most part currently employ a simple “single queue of tasks” extension of basic sequential machine schedulers. We plan to validate our results in future work through implementation and experimentation on such a system.
Starting Page	214
Ending Page	225
Page Count	12
File Format	PDF
ISBN	0897913590
DOI	10.1145/98457.98760
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1990-04-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302

See location in the Map
03222 282435
Mail: support@ndl.gov.in

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in