Skip navigation
Skip navigation

Chain-based scheduling: Part I - loop transformations and code generation

Tang, Peiyi

Description

Chain-based scheduling [1] is an efficient partitioning and scheduling scheme for nested loops on distributed-memory multicomputers. The idea is to take advantage of the regular data dependence structure of a nested loop to overlap and pipeline the communication and computation. Most partitioning and scheduling algorithms proposed for nested loops on multicomputers [1,2,3] are graph algorithms on the iteration space of the nested loop. The graph algorithms for partitioning and scheduling are...[Show more]

CollectionsANU Research Publications
Date published: 1992
Type: Working/Technical Paper
URI: http://hdl.handle.net/1885/40801
http://digitalcollections.anu.edu.au/handle/1885/40801

Download

File Description SizeFormat Image
TR-CS-92-09.pdf243.73 kBAdobe PDFThumbnail


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  23 August 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator