A computing origami folding streams in FPGAs

Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has attracted significant attention because of their inherent parallelism and high performance requirements. Languages, tools,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2009 46th ACM/IEEE Design Automation Conference S. 282 - 287
Hauptverfasser: Hagiescu, Andrei, Wong, Weng-Fai, Bacon, David F., Rabbah, Rodric
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 26.07.2009
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
ISBN:9781605584973, 1605584975
ISSN:0738-100X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has attracted significant attention because of their inherent parallelism and high performance requirements. Languages, tools, and even custom hardware for streaming have been proposed, some of which are commercially available. There are several significant challenges to realizing streaming applications directly in hardware (FPGAs). Since FPGAs have finite resources, there are often many non-trivial tradeoffs between processing throughput and overall latency. In this paper, we describe an algorithm that computes refinements of stream graphs into designs that optimize processing throughput subject to user-specified area and latency constraints.
AbstractList Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has attracted significant attention because of their inherent parallelism and high performance requirements. Languages, tools, and even custom hardware for streaming have been proposed, some of which are commercially available. There are several significant challenges to realizing streaming applications directly in hardware (FPGAs). Since FPGAs have finite resources, there are often many non-trivial tradeoffs between processing throughput and overall latency. In this paper, we describe an algorithm that computes refinements of stream graphs into designs that optimize processing throughput subject to user-specified area and latency constraints.
Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming programs in FPGAs has attracted significant attention because of their inherent parallelism and high performance requirements. Languages, tools, and even custom hardware for streaming have been proposed, some of which are commercially available. There are several significant challenges to realizing streaming applications directly in hardware (FPGAs). Since FPGAs have finite resources, there are often many non-trivial tradeoffs between processing throughput and overall latency. In this paper, we describe an algorithm that computes refinements of stream graphs into designs that optimize processing throughput subject to user-specified area and latency constraints.
Author Hagiescu, Andrei
Wong, Weng-Fai
Rabbah, Rodric
Bacon, David F.
Author_xml – sequence: 1
  givenname: Andrei
  surname: Hagiescu
  fullname: Hagiescu, Andrei
  organization: National University of Singapore
– sequence: 2
  givenname: Weng-Fai
  surname: Wong
  fullname: Wong, Weng-Fai
  organization: National University of Singapore
– sequence: 3
  givenname: David F.
  surname: Bacon
  fullname: Bacon, David F.
  organization: IBM T.J. Watson Research Center
– sequence: 4
  givenname: Rodric
  surname: Rabbah
  fullname: Rabbah, Rodric
  organization: IBM T.J. Watson Research Center
BookMark eNqNjztPwzAURi3RSi0lEwMDS0eWhHvt69dYVbykSiwgsVmOY1cG0lRJGfj3FJofwHSGo--Tzjmb7LpdZOwKoUIkeYuKW4tY_dHoM1ZYbVCBlIasFhM2By1MiQBvUzYzUhFZTjNWDMM7ACBq0kbO2eVqGbp2_3XIu-2y6_PWt_mCTZP_HGIxcsFe7-9e1o_l5vnhab3alJ6TPpQyBBDgZaMiGkiCFGnNQw2cfJM8R6KgvEwiBlvH2hobdCBKAZrIo-Jiwa5PvznG6PZ9bn3_7STnGskcbXWyPrSu7rqPwSG433g3xrsx3tV9juk4uPnnQPwAoSRVcg
ContentType Conference Proceeding
Copyright 2009 ACM
Copyright_xml – notice: 2009 ACM
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1145/1629911.1629987
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Xplore
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Engineering
EndPage 287
ExternalDocumentID 5227148
Genre orig-research
GroupedDBID 6IE
6IF
6IG
6IH
6IK
6IL
6IM
6IN
AAJGR
AARBI
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
IERZE
OCL
RIE
RIL
RIO
123
29O
AAWTH
ACGFS
ADZIZ
CHZPO
IEGSK
IJVOP
IPLJI
M43
RNS
ID FETCH-LOGICAL-a247t-5cc030a5d6e180f3464772cb024adfa2144c6a5f3ec9beb989c7c44fc0de2e623
IEDL.DBID RIE
ISBN 9781605584973
1605584975
ISICitedReferencesCount 19
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000279394200058&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0738-100X
IngestDate Wed Aug 27 02:18:50 EDT 2025
Wed Jan 31 06:44:10 EST 2024
Wed Jan 31 06:39:35 EST 2024
IsPeerReviewed false
IsScholarly true
Keywords streaming
throughput
FPGA
latency
LCCN 85644924
Language English
License Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org
LinkModel DirectLink
MeetingName DAC '09: The 46th Annual Design Automation Conference 2009
MergedId FETCHMERGED-LOGICAL-a247t-5cc030a5d6e180f3464772cb024adfa2144c6a5f3ec9beb989c7c44fc0de2e623
PageCount 6
ParticipantIDs acm_books_10_1145_1629911_1629987_brief
acm_books_10_1145_1629911_1629987
ieee_primary_5227148
PublicationCentury 2000
PublicationDate 20090726
2009-July
PublicationDateYYYYMMDD 2009-07-26
2009-07-01
PublicationDate_xml – month: 07
  year: 2009
  text: 20090726
  day: 26
PublicationDecade 2000
PublicationPlace New York, NY, USA
PublicationPlace_xml – name: New York, NY, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle 2009 46th ACM/IEEE Design Automation Conference
PublicationTitleAbbrev DAC
PublicationYear 2009
Publisher ACM
IEEE
Publisher_xml – name: ACM
– name: IEEE
SSID ssj0001174785
ssj0004161
Score 1.8767676
Snippet Stream processing represents an important class of applications that spans telecommunications, multimedia and the Internet. The implementation of streaming...
SourceID ieee
acm
SourceType Publisher
StartPage 282
SubjectTerms Algorithm design and analysis
Delay
Field programmable gate arrays
FPGA
Hardware
Hardware -- Electronic design automation -- Logic synthesis -- Circuit optimization
Internet
Latency
Parallel processing
Process design
Streaming
Streaming media
Telecommunication computing
Throughput
Subtitle folding streams in FPGAs
Title A computing origami
URI https://ieeexplore.ieee.org/document/5227148
WOSCitedRecordID wos000279394200058&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8NAEB3a4kEv1bZi_WIFwYtp87XJxpuI0YOUHhR6C5vdCeTQVprW3-_sJrYKgnhKNswhzGYzb3b2vQG49mMscsG1QwbCCfMwcXIRRI6idIgnigAuWqLwSzyZiNksmbbgdsuFQUR7-AxH5tbW8vVSbcxW2ZiwQkzwvQ3tOI5qrtZuP8UzSvA76GuAu5XgDIx8qTszpC6C7hRvk5g3Wk9f46DR_PFCPvYi-kF73shehQ1aav6j9YqNPGn3f-98CIMdhY9Nt8HpCFq46EG3wZysWdFVDw6-CRL2wblnyrZ5oBEzPbPkvLxjaV2hYoZXIucVKxcsnT7dVwN4Sx9fH56dpqGCI_0wXjtcKVrTkusIPeEWQWhYqL7KKU5LXUijnqYiyYsAVZJjngiaLBWGhXI1-khA6Rg6i-UCT4C5vsZI8wgLsiAvJkLFOtSBTqTQlMUN4Yr8lplMocpq8jPPGt9mjW-HcPOnTZavSiyG0Deezd5rBY6scerp74_PYL-u-ZhDtefQWa82eAF76mNdVqtL-9l8AkqgtTI
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8JAEJ0gmqgXFDTi55qYeLFAP7bdeiNGxIiEAybcmnZ3mnAADAV_v7PLCpqYGE_tNnNoZrudNzv73gDceBHmmeDKIQPhBFkQO5nwQ0dSOsRjSQAXDVG4F_X7YjSKByW4W3NhENEcPsOGvjW1fDWTS71V1iSsEBF834Jt3TnLsrU2Oyqu1oLfgF8N3Y0Ip68FTFsjTesi8E4RN464VXv6GvtW9ccNeNMN6Rftug1zFSZsycmP5ism9nQq_3vrAzjakPjYYB2eDqGE0ypULOpkdk0XVdj_JklYA6fNpGn0QCOmu2alk_E966xqVEwzS9JJwcZT1hk8tYsjeOs8Dh-6jm2p4KReEC0cLiWt6pSrEF3Ryv1A81A9mVGkTlWeav00GaY891HGGWaxoOmSQZDLlkIPCSodQ3k6m-IJsJanMFQ8xJwsyIuxkJEKlK_iVCjK4-pwTX5LdK5QJCv6M0-sbxPr2zrc_mmTZPMx5nWoac8m7ysNjsQ69fT3x1ew2x2-9pLec__lDPZWFSB9xPYcyov5Ei9gR34sxsX80nxCn_ahuHs
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2009+46th+ACM%2FIEEE+Design+Automation+Conference&rft.atitle=A+computing+origami%3A+Folding+streams+in+FPGAs&rft.au=Hagiescu%2C+A.&rft.au=Weng-Fai+Wong&rft.au=Bacon%2C+D.F.&rft.au=Rabbah%2C+R.&rft.date=2009-07-01&rft.pub=IEEE&rft.isbn=9781605584973&rft.issn=0738-100X&rft.spage=282&rft.epage=287&rft_id=info:doi/10.1145%2F1629911.1629987&rft.externalDocID=5227148
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0738-100X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0738-100X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0738-100X&client=summon