A constraints programming approach to communication scheduling on SoPC architectures

Summary, in English

This paper presents a novel approach to scheduling communications among concurrent hardware processes mapped onto a "System on a Programmable Chip." Point-to-point, broadcast and multi-cast ommunication types are supported. The algorithm has been prototyped on the Processor-Coupled Polymorphous Fabric for the Altera Excalibur Arm architecture. The communication schedule problem has been specified using Constraints Programming. The advantages of our method are the following: Application of a general constraint solver makes it possible to express many different sorts of constraints in a uniform manner. All imposed constraints are handled by the solver concurrently which increases the chances of obtaining optimal results. The scheduler guarantees that loops periods are the same for each iteration so the smaller controllers can be generated. The method has been illustrated with a Fabric-based implementation of the K-means clustering algorithm for which an optimal communication schedule has been achieved.

• Författare: Christophe Wolinski; Krzysztof Kuchcinski; Maya Gokhale
• Avdelning/ar: Institutionen för datavetenskap; Parallella System
• Publiceringsår: 2004
• Språk: Engelska
• Sidor: 252-252
• Publikation/Tidskrift/Serie: Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
• Länkar: http://dx.doi.org/10.1145/968280.968336
• Dokumenttyp: Konferensbidrag
• Förlag: Association for Computing Machinery (ACM)
• Ämne: Computer Science
• Conference name: International Symposium on Field Programmable Gate Arrays
• Conference date: 2004-02-22 - 2004-02-24
• Conference place: Monterey, California, United States
• Status: Published
• Forskningsgrupp: ESDLAB
• ISBN/ISSN/Övrigt: ISBN: 1-58113-829-6