NDLI: Job scheduling in mesh multicomputers

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

Job scheduling in mesh multicomputers

Content Provider	IEEE Xplore Digital Library
Author	Das Sharma, D. Pradhan, D.K.
Copyright Year	1990
Abstract	A new approach for dynamic job scheduling in mesh-connected multiprocessor systems, which supports a multiuser environment, is proposed in this paper. Our approach combines a submesh reservation policy with a priority-based scheduling policy to obtain high performance in terms of high throughput, high utilization, and low turn-around times for jobs. This high performance is achieved at the expense of scheduling jobs in a strictly fair, FCFS fashion; in fact, the algorithm is parameterized to allow trade-offs between performance and (short-term) POPS fairness. The proposed scheduler can be used with any submesh allocation policy. A fast and efficient implementation of the proposed scheduler has also been presented. The performance of the proposed scheme has been compared with the FCFS policy, the only existing scheduling strategy for meshes, to demonstrate the effectiveness of the proposed approach. Simulation results indicate that our scheduling strategy outperforms the FCFS policy significantly. Specifically, our strategy significantly reduces the average waiting delay of jobs over the FCFS policy. The fast implementation of the proposed scheduler results in low allocation and deallocation time overhead, as well as low space overhead.
Sponsorship	IEEE Computer Society
Starting Page	57
Ending Page	70
Page Count	14
File Size	422563
File Format	PDF
ISSN	10459219
Volume Number	9
Issue Number	1
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1998-01-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	Processor scheduling Delay Dynamic scheduling Multiprocessing systems Throughput Scheduling algorithm Operating systems Resource management Fault tolerance Scalability
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

Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems

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

Noncontiguous processor allocation algorithms for mesh-connected multicomputers

A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systems

Job scheduling is more important than processor allocation for hypercube computers

Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

Dynamic task scheduling using online optimization

Hierarchical Scheduling for Symmetric Multiprocessors

Static processor allocation in a soft real-time multiprocessor environment

Job scheduling in mesh multicomputers

Similar Documents

Fault-tolerant rate-monotonic first-fit scheduling in hard-real-time systems

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

Noncontiguous processor allocation algorithms for mesh-connected multicomputers

A scalable scheduling scheme for functional parallelism on distributed memory multiprocessor systems

Job scheduling is more important than processor allocation for hypercube computers

Fault-tolerance through scheduling of aperiodic tasks in hard real-time multiprocessor systems

Dynamic task scheduling using online optimization

Hierarchical Scheduling for Symmetric Multiprocessors

Static processor allocation in a soft real-time multiprocessor environment

Job scheduling in mesh multicomputers