NDLI: Characterizations of parallelism in applications and their use in scheduling

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

The placement optimization program: a practical solution to the disk file assignment problem

Diversity in database reference behavior

A statistical approach to diagnosing intermittent performance-problems using monotone relationships

Bounding availability of repairable computer systems

Performance of optimistic make

The performance implications of thread management alternatives for shared-memory multiprocessors

Optimistic implementation of bulk data transfer protocols

TRAPEDS: producing traces for multicomputers via execution driven simulation

Behavioral characterization of multiprocessor memory systems: a case study

Mache: no-loss trace compaction

Evaluation of retransmission strategies in a local area network environment

Finite buffers for fast multicast

Performance of a dual-bus unidirectional broadcast network operating under probabilistic scheduling strategy

Solution of closed, product form, queueing networks via the RECAL and tree-RECAL methods on a shared memory multiprocessor

Feedback queues with preemption-distance priorities

Parallel simulation of queueing networks: limitations and potentials

Control and coordination policies for systems with buffers

Accurate modeling of parallel scientific computations

Characterizations of parallelism in applications and their use in scheduling

An approximation to the response time for shortest queue routing

Approximating response time distributions

A closed network with a discriminatory processor-sharing server

Characterizations of parallelism in applications and their use in scheduling

Content Provider	ACM Digital Library
Author	Sevcik, K. C.
Abstract	As multiprocessors with large numbers of processors become more prevalent, we face the task of developing scheduling algorithms for the multiprogrammed use of such machines. The scheduling decisions must take into account the number of processors available, the overall system load, and the ability of each application awaiting activation to make use of a given number of processors.The parallelism within an application can be characterized at a number of different levels of detail. At the highest level, it might be characterized by a single parameter (such as the proportion of the application that is sequential, or the average number of processors the application would use if an unlimited number of processors were available). At the lowest level, representing all the parallelism in the application requires the full data dependency graph (which is more information than is practically manageable).In this paper, we examine the quality of processor allocation decisions under multiprogramming that can be made with several different high-level characterizations of application parallelism. We demonstrate that decisions based on parallelism characterizations with two to four parameters are superior to those based on single-parameter characterizations (such as fraction sequential or average parallelism). The results are based predominantly on simulation, with some guidance from a simple analytic model.
Starting Page	171
Ending Page	180
Page Count	10
File Format	PDF
ISBN	0897913159
DOI	10.1145/75108.75391
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1989-04-01
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

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

Characterizations of parallelism in applications and their use in scheduling

Scheduling mixed-parallel applications with advance reservations

On characterizations of truthful mechanisms for combinatorial auctions and scheduling

Data-Driven Tasks and Their Implementation

Efficient scheduling of fine grain parallelism in loops

Bottleneck identification and scheduling in multithreaded applications

List Scheduling Strategies for Task Graphs with Data Parallelism

A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications

Sulfur Nanoparticles: Synthesis, Characterizations and their Applications

Characterizations of parallelism in applications and their use in scheduling

Similar Documents

Characterizations of parallelism in applications and their use in scheduling

Scheduling mixed-parallel applications with advance reservations

On characterizations of truthful mechanisms for combinatorial auctions and scheduling

Data-Driven Tasks and Their Implementation

Efficient scheduling of fine grain parallelism in loops

Bottleneck identification and scheduling in multithreaded applications

List Scheduling Strategies for Task Graphs with Data Parallelism

A Priority-Based Scheduling Heuristic to Maximize Parallelism of Ready Tasks for DAG Applications

Sulfur Nanoparticles: Synthesis, Characterizations and their Applications

Characterizations of parallelism in applications and their use in scheduling