LATA: A latency and Throughput-Aware packet processing system
Current packet processing systems only aim at producing high throughput without considering packet latency reduction. For many real-time embedded network applications, it is essential that the processing time not exceed a given threshold. In this paper, we propose LATA, a LAtency and Throughput-Awar...
Saved in:
Published in: | Design Automation Conference pp. 36 - 41 |
---|---|
Main Authors: | , |
Format: | Conference Proceeding |
Language: | English |
Published: |
IEEE
01-06-2010
|
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Abstract | Current packet processing systems only aim at producing high throughput without considering packet latency reduction. For many real-time embedded network applications, it is essential that the processing time not exceed a given threshold. In this paper, we propose LATA, a LAtency and Throughput-Aware packet processing system for multicore architectures. Based on parallel pipeline core topology, LATA can satisfy the latency constraint and produce high throughput by exploiting fine-grained task-level parallelism. We implement LATA on an Intel machine with two Quad-Core Xeon E5335 processors and compare it with four other systems (Parallel, Greedy, Random and Bipar) for six network applications. LATA exhibits an average of 36.5% reduction of latency and a maximum of 62.2% reduction of latency for URL over Random with comparable throughput performance. |
---|---|
AbstractList | Current packet processing systems only aim at producing high throughput without considering packet latency reduction. For many real-time embedded network applications, it is essential that the processing time not exceed a given threshold. In this paper, we propose LATA, a LAtency and Throughput-Aware packet processing system for multicore architectures. Based on parallel pipeline core topology, LATA can satisfy the latency constraint and produce high throughput by exploiting fine-grained task-level parallelism. We implement LATA on an Intel machine with two Quad-Core Xeon E5335 processors and compare it with four other systems (Parallel, Greedy, Random and Bipar) for six network applications. LATA exhibits an average of 36.5% reduction of latency and a maximum of 62.2% reduction of latency for URL over Random with comparable throughput performance. |
Author | Bhuyan, Laxmi Jilong Kuang |
Author_xml | – sequence: 1 surname: Jilong Kuang fullname: Jilong Kuang email: jkuang@cs.ucr.edu organization: Comput. Sci. & Eng. Dept., Univ. of California, Riverside, Riverside, CA, USA – sequence: 2 givenname: Laxmi surname: Bhuyan fullname: Bhuyan, Laxmi email: bhuyan@cs.ucr.edu organization: Comput. Sci. & Eng. Dept., Univ. of California, Riverside, Riverside, CA, USA |
BookMark | eNotjE1LAzEURSO2YK2zduEmf2Bq3svL5I3gYij1AwpuKrgrmZi01XY6TKZI_71Fuzpc7rn3WgyafROEuAU1ASBzD6wtWpr8kYsLkZWWT4XSSik0l-eMREVhLQzESFnNOSj1MRQjNnlBVCJdiSylr9MEAJWxNBKP82pRPchKbl0fGn-UrvmUi3W3P6zW7aHPqx_XBdk6_x162XZ7H1LaNCuZjqkPuxsxjG6bQnbmWLw_zRbTl3z-9vw6rea5Q7J9Dsx1iKSMN8ZB9ACMYDX46DRyWWv0SBFjdCUrQFt7PjlInoxlr6Iei7v_300IYdl2m53rjktjUCOy_gVTD02Y |
ContentType | Conference Proceeding |
DBID | 6IE 6IH CBEJK RIE RIO |
DOI | 10.1145/1837274.1837286 |
DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library Online IEEE Proceedings Order Plans (POP) 1998-present |
DatabaseTitleList | |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library Online url: http://ieeexplore.ieee.org/Xplore/DynWel.jsp sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science |
EISBN | 9781450300025 1450300022 |
EndPage | 41 |
ExternalDocumentID | 5523228 |
Genre | orig-research |
GroupedDBID | 123 29O 6IE 6IF 6IH 6IK 6IL 6IM 6IN AAJGR ACGFS ACM ADZIZ ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IJVOP IPLJI JC5 M43 OCL RIE RIG RIL RIO RNS |
ID | FETCH-LOGICAL-a247t-188bef405c55a1fc11821731cfa3289b32c24f2ffa980127bc8c1124c4578c0f3 |
IEDL.DBID | RIE |
ISBN | 9781424466771 1424466776 |
ISSN | 0738-100X |
IngestDate | Wed Jun 26 19:24:18 EDT 2024 |
IsPeerReviewed | false |
IsScholarly | true |
LCCN | 85-644924 |
Language | English |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-a247t-188bef405c55a1fc11821731cfa3289b32c24f2ffa980127bc8c1124c4578c0f3 |
PageCount | 6 |
ParticipantIDs | ieee_primary_5523228 |
PublicationCentury | 2000 |
PublicationDate | 2010-June |
PublicationDateYYYYMMDD | 2010-06-01 |
PublicationDate_xml | – month: 06 year: 2010 text: 2010-June |
PublicationDecade | 2010 |
PublicationTitle | Design Automation Conference |
PublicationTitleAbbrev | DAC |
PublicationYear | 2010 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
SSID | ssj0001120574 ssj0004161 ssj0000452565 |
Score | 1.8116231 |
Snippet | Current packet processing systems only aim at producing high throughput without considering packet latency reduction. For many real-time embedded network... |
SourceID | ieee |
SourceType | Publisher |
StartPage | 36 |
SubjectTerms | Algorithm design and analysis Computer science Delay multicore architecture Multicore processing packet processing Parallel processing Parallel-pipelining Pipeline processing Protocols Scheduling algorithm Throughput Uniform resource locators |
Title | LATA: A latency and Throughput-Aware packet processing system |
URI | https://ieeexplore.ieee.org/document/5523228 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV05T8MwFLZoJ1gKbRG3PDCSNr7iBIkhglYdEEKiSN0qx3leQGlVGiH-Pc9JegwsTEksW4p86HuHv-8Rchs6i0CTq0AoMAHiNQSGKxPEVieQyCiLnI9DTt70yyx-GnmZnLstFwYAqstnMPCvVS4_X9jSh8qGCr0mzuMWaekkrrla23iKlwZXTcauiq8wjqaI3HEkWaWdijvay5mGsw3JK4q0jjbaT803azSAmFRD3PII8XJQPT3jeq8IS4VB487__v6Y9HdkPvq6hakTcgBFl3Q21Rxoc7i75GhPmrBHHp7TaXpPU_ppvFX9Q02R02ld1AcHBum3WQFFh_sD1nRZsw1wIK2VofvkfTyaPk6CptQCrozU64DFcQYOjTerlGHOereDacGsMwJdskxwy6XjzpnEQ5rObIx9uLQST7wNnTgl7WJRwBmhJs9AJy6LlBYSwjxxNtJcOYG2HLMCzknPz818WatpzJtpufi7-ZIc1vl6H_e4Iu31qoRr0vrKy5tq_X8BniGlgQ |
link.rule.ids | 310,311,782,786,791,792,798,27934,54767 |
linkProvider | IEEE |
linkToHtml | http://sdu.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFLVoGYCl0BbxxgMjaeNXnCAxRNCqiFIhEaRuleNcL6C0Kq0Qf4-dpI-BhSmJZUuRc61zHznnInTjG22BJhMeE6A8i9fgKSqUF2oZQcSDNDAuDzl4k6Nx-NhzMjm3ay4MABQ_n0HH3Ra1_Gyqly5V1hU2aqI0rKFdwWUgS7bWOqPixMFFVbMrMiyEWmeEb1iSpFBPtTbtBE398YrmFQRSBiv1p-qZVCpAhIuuNXoL8rxTXB3neqsNS4FC_cb_3v8QtTd0Pvy6BqojtAN5EzVW_Rxwdbyb6GBLnLCF7odxEt_hGH8q51f_YJVnOCnb-tiFXvyt5oBtyP0BCzwr-QZ2IS61odvovd9LHgZe1WzBfhsuFx4JwxSMdd-0EIoY7QIPIhnRRjEblKWMasoNNUZFDtRkqkM7h3LN7ZnXvmHHqJ5PczhBWGUpyMikgZCMg59FRgeSCsOsN0c0g1PUcnszmZV6GpNqW87-Hr5Ge4PkZTgZPo2ez9F-Wb13WZALVF_Ml3CJal_Z8qqwhV-QjqjS |
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=Design+Automation+Conference&rft.atitle=LATA%3A+A+latency+and+Throughput-Aware+packet+processing+system&rft.au=Jilong+Kuang&rft.au=Bhuyan%2C+Laxmi&rft.date=2010-06-01&rft.pub=IEEE&rft.isbn=9781424466771&rft.issn=0738-100X&rft.spage=36&rft.epage=41&rft_id=info:doi/10.1145%2F1837274.1837286&rft.externalDocID=5523228 |
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 |