NDLI: Scheduling with confidence for probabilistic data-flow graphs

Content Provider	IEEE Xplore Digital Library
Author	Tongsima, S. Chantrapornchai, C. Sha, E.H.-M. Passos, N.L.
Copyright Year	1997
Description	Author affiliation: Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA (Tongsima, S.)
Abstract	One of the biggest problems in high-level synthesis is to obtain a good schedule without the knowledge of exact computation time of tasks. While the target applications in high-level synthesis are becoming larger a task in the applications such as artificial intelligent systems or interface may have uncertain computation time. In this paper an algorithm to schedule these repetitive tasks and optimize the schedule is presented. A probabilistic data-flow graph is employed to model the problem where each node represents a task associated with the probabilistic computation time and a set of edges represents the dependences between the tasks. A novel polynomial-time probabilistic retiming algorithm for optimizing the graph and an algorithm for computing the optimized schedule, subject to the acceptable probability and resource constraint, are presented. The optimization algorithm also guarantees to give such a short schedule length with a given qualitatively provable, confidence level. The experiments show that the resulting schedule length for a given confidence probability can be significantly reduced.
Starting Page	150
Ending Page	155
File Size	666906
Page Count	6
File Format	PDF
ISBN	0818679042
ISSN	10661395
DOI	10.1109/GLSV.1997.580528
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1997-03-13
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Constraint optimization Delay Computer science High level synthesis Application software Scheduling algorithm Timing Knowledge engineering Polynomials
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

Scheduling with Confidence for Probabilistic Data Flow Graphs (1997)

An Optimal Lower-Bound Algorithm for the High-Level Synthesis Scheduling Problem

A scheduling algorithm for pipelined data path synthesis with gradual mobility reduction

An approach to synthesis delay semantics in VHDL

Precise-MD: a software tool for resources constrained scheduling of multi-dimensional applications

Verification of scheduling in high-level synthesis

Scheduling of signal transition graphs under timing constraints

Unfolding probabilistic data-flow graphs under different timing models

Loop scheduling algorithm for timing and memory operation minimization with register constraint

Scheduling with confidence for probabilistic data-flow graphs

Similar Documents

Scheduling with Confidence for Probabilistic Data Flow Graphs (1997)

An Optimal Lower-Bound Algorithm for the High-Level Synthesis Scheduling Problem

A scheduling algorithm for pipelined data path synthesis with gradual mobility reduction

An approach to synthesis delay semantics in VHDL

Precise-MD: a software tool for resources constrained scheduling of multi-dimensional applications

Verification of scheduling in high-level synthesis

Scheduling of signal transition graphs under timing constraints

Unfolding probabilistic data-flow graphs under different timing models

Loop scheduling algorithm for timing and memory operation minimization with register constraint

Scheduling with confidence for probabilistic data-flow graphs