Advanced

A constraints programming approach to communication scheduling on SoPC architectures

Wolinski, Christophe; Kuchcinski, Krzysztof LU and Gokhale, Maya (2004) International Symposium on Field Programmable Gate Arrays In Proceedings of the 2004 ACM/SIGDA 12th 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:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
pages
1 pages
publisher
ACM
conference name
International Symposium on Field Programmable Gate Arrays
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
2007-12-06 11:07:30
date last changed
2017-01-01 08:00:11
@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    = {ACM},
  title        = {A constraints programming approach to communication scheduling on SoPC architectures},
  url          = {http://dx.doi.org/10.1145/968280.968336},
  year         = {2004},
}