Publica
Hier finden Sie wissenschaftliche Publikationen aus den FraunhoferInstituten. Nearoptimal scheduling of synchronous dataflow graphs by exact calculation of interprocessor communication costs
 Hertzberger, B.; Sloot, P.: Highperformance computing and networking. International Conference and Exhibition 1997. Proceedings Berlin: Springer, 1997 (Lecture Notes in Computer Science 1225) ISBN: 3540628983 ISSN: 03029743 pp.987988 : Lit. 
 International Conference and Exhibition on HighPerformance Computing and Networking (HPCN Europe) <1997, Wien> 

 English 
 Conference Paper 
 Fraunhofer IMS, Außenstelle Dresden ( IPMS) () 
 Kommunikation; Parallelverarbeitung; Rekonfigurierbarkeit; scheduling; Topologie 
Abstract
In this contribution we present an optimised method for mapping of dataflow graphs onto parallel processor networks. Its main advantage is the exact consideration of overhead times for data exchange within the network. Therefore, the well known Dynamic Level Scheduler has been extended by a software router which is capable of calculating communication costs for all commonly used network topologies. This task is based on a special minimal routing algorithm for reconfigurable processor networks. Comparisons between the original and our modified scheduling algorithm will show significant reduction of makespan. A possible integration of the algorithm in software environments for parallel processing will be demonstrated by means of the framework PTOLEMY.