NDLI: Fast algorithms for scheduling imprecise computations

Content Provider	IEEE Xplore Digital Library
Author	Shih, W.-K. Liu, J.W.S. Chung, J.-Y.
Copyright Year	1989
Description	Author affiliation: Dept. of Comput. Sci., Illinois Univ., Urbana, IL, USA (Shih, W.-K.; Liu, J.W.S.)
Abstract	Consideration is given to the problem of scheduling tasks each of which is logically decomposed into a mandatory subtask and an optional subtask. The mandatory subtask must be executed to completion. If the available processor time is insufficient, the optional subtask can be left incomplete. The error in the result of a task is equal to the processing time of the unfinished portion of the optional subtask. A description is given of a preemptive algorithm for scheduling n dependent tasks with rational ready times, deadlines, and processing times on a uniprocessor system. This algorithm determines whether feasible schedules that meet the timing constraints of all tasks exist; when feasible schedules exist, it finds one that has the minimum total error. The complexity of this algorithm is O(n log n). A schedule is said to satisfy the 0/1 constraint when every optional subtask is either completed or discarded. The problem of finding an optimal feasible schedule that satisfies the 0/1 constraint and minimizes the number of discarded optional subtasks is NP-complete. Two algorithms are presented for finding optimal schedules of dependent tasks on a uniprocessor system for the special case when all optional subtasks have identical processing times.
Starting Page	12
Ending Page	19
File Size	583534
Page Count	8
File Format	PDF
ISBN	0818620048
DOI	10.1109/REAL.1989.63552
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1989-12-05
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Scheduling algorithm Processor scheduling Optimal scheduling Timing Real time systems Computer science Multiprocessing systems Weight measurement Time measurement
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

A fast algorithm for scheduling imprecise computations with timing constraints to minimize weighted error

Scheduling algorithms for parallel real-time systems

Algorithms for scheduling imprecise computations

An improved dynamic scheduling algorithm for multiprocessor real-time systems

On-line scheduling of imprecise computations to minimize error

Hard real-time multiobjective scheduling in heterogeneous systems using genetic algorithms

Scheduling parallelizable imprecise computations on multiprocessors

Multiprocessors scheduling for imprecise computations in a hard real-time environment

Scheduling algorithms for coalesced jobs in real-time systems

Fast algorithms for scheduling imprecise computations

Similar Documents

A fast algorithm for scheduling imprecise computations with timing constraints to minimize weighted error

Scheduling algorithms for parallel real-time systems

Algorithms for scheduling imprecise computations

An improved dynamic scheduling algorithm for multiprocessor real-time systems

On-line scheduling of imprecise computations to minimize error

Hard real-time multiobjective scheduling in heterogeneous systems using genetic algorithms

Scheduling parallelizable imprecise computations on multiprocessors

Multiprocessors scheduling for imprecise computations in a hard real-time environment

Scheduling algorithms for coalesced jobs in real-time systems

Fast algorithms for scheduling imprecise computations