Please use this identifier to cite or link to this item: https://doi.org/10.1145/1787275.1787301
DC FieldValue
dc.titleA predictable communication assist
dc.contributor.authorShabbir, A.
dc.contributor.authorStuijk, S.
dc.contributor.authorKumar, A.
dc.contributor.authorTheelen, B.
dc.contributor.authorMesman, B.
dc.contributor.authorCorporaal, H.
dc.date.accessioned2014-06-19T02:55:51Z
dc.date.available2014-06-19T02:55:51Z
dc.date.issued2010
dc.identifier.citationShabbir, A., Stuijk, S., Kumar, A., Theelen, B., Mesman, B., Corporaal, H. (2010). A predictable communication assist. CF 2010 - Proceedings of the 2010 Computing Frontiers Conference : 97-98. ScholarBank@NUS Repository. https://doi.org/10.1145/1787275.1787301
dc.identifier.isbn9781450300445
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/69011
dc.description.abstractModern multi-processor systems need to provide guaranteed services to their users. A communication assist (CA) helps in achieving tight timing guarantees. In this paper, we present a CA for a tile-based MP-SoC. Our CA has smaller memory requirements and a lower latency than existing CAs. The CA has been implemented in hardware. We compare it with two existing DMA controllers. When compared with these DMAs, our CA is up-to 44% smaller in terms of equivalent gate count. © 2010 author/owner(s).
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1145/1787275.1787301
dc.sourceScopus
dc.subjectca
dc.subjectcommunication
dc.subjectdma
dc.subjectfpga's
dc.subjectmp-soc
dc.subjectpredictable
dc.typeConference Paper
dc.contributor.departmentELECTRICAL & COMPUTER ENGINEERING
dc.description.doi10.1145/1787275.1787301
dc.description.sourcetitleCF 2010 - Proceedings of the 2010 Computing Frontiers Conference
dc.description.page97-98
dc.identifier.isiut000397815700021
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


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