NDLI: Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors

Content Provider	IEEE Xplore Digital Library
Author	Tae-ho Shin Hyunok Oh Soonhoi Ha
Copyright Year	2010
Description	Author affiliation: Department of Information Systems, Hanyang University, Seoul, Korea (Hyunok Oh) \|\| School of EECS, Seoul National University, Seoul, Korea (Tae-ho Shin; Soonhoi Ha)
Abstract	This paper determines a static scheduling and the minimal size of arc buffers for a given synchronous dataflow (SDF) graph, satisfying a throughput constraint. Unlike the previous work, we assume that the target architecture and the mapping information are given. In addition we consider the unfolding of the SDF graph to improve the throughput. To solve this problem, we adopt answer set programming (ASP) with constraint programming (CP) technique which always finds optimal solutions. The proposed ASP+CP formulation is compact enough to list the scheduling rules in 27 lines and could be applied to a small-but-practical size of coarse-grain SDF graphs successfully.
Starting Page	298
Ending Page	301
File Size	109054
Page Count	4
File Format	PDF
ISBN	9781424486335
e-ISBN	9781424486328
DOI	10.1109/SOCDC.2010.5682911
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-11-22
Publisher Place	Korea (South)
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Processor scheduling Computational modeling Optimal scheduling Programming throughput constraint Throughput Scheduling Synchronous Dataflow Graph static scheduling buffer size minimization Pipeline processing
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

Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph

Cyclo-static DataFlow phases scheduling optimization for buffer sizes minimization

Abstract scheduling techniques for synchronous and multidimensional synchronous.

Resource minimized static mapping and dynamic scheduling of SDF graphs

A new method for minimizing buffer sizes for Cyclo-Static Dataflow graphs

Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs

Phased scheduling of stream programs

Resource minimized static mapping and dynamic scheduling of sdf graphs.

Efficient static buffering to guarantee throughput-optimal FPGA implementation of synchronous dataflow graphs

Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors

Similar Documents

Minimizing buffer requirements for throughput constrained parallel execution of synchronous dataflow graph

Cyclo-static DataFlow phases scheduling optimization for buffer sizes minimization

Abstract scheduling techniques for synchronous and multidimensional synchronous.

Resource minimized static mapping and dynamic scheduling of SDF graphs

A new method for minimizing buffer sizes for Cyclo-Static Dataflow graphs

Exploring trade-offs in buffer requirements and throughput constraints for synchronous dataflow graphs

Phased scheduling of stream programs

Resource minimized static mapping and dynamic scheduling of sdf graphs.

Efficient static buffering to guarantee throughput-optimal FPGA implementation of synchronous dataflow graphs

Buffer optimal static scheduling with a throughput constraint for synchronous dataflow applications on multiprocessors