A constraints programming approach to communication scheduling on SoPC architectures
(2004) International Symposium on Field Programmable Gate Arrays p.252-252- Abstract
- 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... (More)
- 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. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/623082
- author
- Wolinski, Christophe ; Kuchcinski, Krzysztof LU and Gokhale, Maya
- organization
- publishing date
- 2004
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
- pages
- 1 pages
- publisher
- Association for Computing Machinery (ACM)
- conference name
- International Symposium on Field Programmable Gate Arrays
- conference location
- Monterey, California, United States
- conference dates
- 2004-02-22 - 2004-02-24
- external identifiers
-
- scopus:13944267522
- ISBN
- 1-58113-829-6
- DOI
- 10.1145/968280.968336
- language
- English
- LU publication?
- yes
- id
- 102d6edf-1e83-4ec6-856f-30948cd6fbc6 (old id 623082)
- date added to LUP
- 2016-04-04 10:51:39
- date last changed
- 2022-01-29 20:58:31
@inproceedings{102d6edf-1e83-4ec6-856f-30948cd6fbc6, abstract = {{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.}}, author = {{Wolinski, Christophe and Kuchcinski, Krzysztof and Gokhale, Maya}}, booktitle = {{Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays}}, isbn = {{1-58113-829-6}}, language = {{eng}}, pages = {{252--252}}, publisher = {{Association for Computing Machinery (ACM)}}, title = {{A constraints programming approach to communication scheduling on SoPC architectures}}, url = {{http://dx.doi.org/10.1145/968280.968336}}, doi = {{10.1145/968280.968336}}, year = {{2004}}, }