NDLI: Static processor allocation in a soft real-time multiprocessor environment

Content Provider	IEEE Xplore Digital Library
Author	Carlson, B.M. Dowdy, L.W.
Copyright Year	1990
Abstract	Soft real-time environments consist of jobs that must receive service within a particular time interval. If service for a specific job is not completed by the end of its time interval, it is said to be lost; in addition, the computation time expended on the job is wasted, and any further computation for the job is discontinued. The goal of a system designer is to provide an environment that minimizes the number of jobs that are lost. If a parallel environment is available, the system designer has two options: Allow each processor to execute a job individually, or let multiple processors cooperate in executing a job. This article shows, for two classes of static allocation policies, that simple comparative analytical models may be used to indicate which option minimizes the number of lost jobs, as a function of workload intensity. The first class of policies, called equal partitions, statically decomposes the system into equal-size sets of processors and executes one job per partition. These policies are frequently employed in other contexts. The second class of policies, called two partitions, statically partitions the processors into two sets, not necessarily of the same size. Surprisingly, it is observed mathematically that even for statistically identical jobs, this class of policies is superior to equal partitions under certain loadings. The analysis is validated experimentally with a workload executed on a 16-node iPSC/2 hypercube.<>
Sponsorship	IEEE Computer Society
Starting Page	316
Ending Page	320
Page Count	5
File Size	569182
File Format	PDF
ISSN	10459219
Volume Number	5
Issue Number	3
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-03-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Real time systems Job design Multiprocessing systems Hypercubes Random variables Computer science Processor scheduling Analytical models Throughput Delay
Content Type	Text
Resource Type	Article
Subject	Signal Processing Computational Theory and Mathematics Hardware and Architecture

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

Job scheduling is more important than processor allocation for hypercube computers

A fault-tolerant dynamic scheduling algorithm for multiprocessor real-time systems and its analysis

An analysis of EDF schedulability on a multiprocessor

An efficient dynamic scheduling algorithm for multiprocessor real-time systems

Job scheduling in mesh multicomputers

Processor-optimal implementation of real-time DSP algorithms

Efficient scheduling algorithms for real-time multiprocessor systems

Scheduling DAG's for asynchronous multiprocessor execution

Fixed-Priority Allocation and Scheduling for Energy-Efficient Fault Tolerance in Hard Real-Time Multiprocessor Systems

Static processor allocation in a soft real-time multiprocessor environment

Similar Documents

Job scheduling is more important than processor allocation for hypercube computers

A fault-tolerant dynamic scheduling algorithm for multiprocessor real-time systems and its analysis

An analysis of EDF schedulability on a multiprocessor

An efficient dynamic scheduling algorithm for multiprocessor real-time systems

Job scheduling in mesh multicomputers

Processor-optimal implementation of real-time DSP algorithms

Efficient scheduling algorithms for real-time multiprocessor systems

Scheduling DAG's for asynchronous multiprocessor execution

Fixed-Priority Allocation and Scheduling for Energy-Efficient Fault Tolerance in Hard Real-Time Multiprocessor Systems

Static processor allocation in a soft real-time multiprocessor environment