Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/513918.514136acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article

A framework for evaluating design tradeoffs in packet processing architectures

Published: 10 June 2002 Publication History

Abstract

We present an analytical method to evaluate embedded network packet processor architectures, and to explore their design space. Our approach is in contrast to those based on simulation, which tend to be infeasible when the design space is very large. We illustrate the feasibility of our method using a detailed case study.

References

[1]
American National Standards Institute. Triple Data Encryption Algorithm Modes of Operation, ANSI X9.52-1998, 1998]]
[2]
J. L. Boudec and P. Thiran. Network Calculus - A Theory of Deterministic Queuing Systems for the Internet. LNCS 2050, Springer Verlag, 2001]]
[3]
G. Buttazzo. Hard Real-Time Computing Systems - Predictable Scheduling Algorithms and Applications. Kluwer Academic Publishers, 1997]]
[4]
P. Crowley, M. Fiuczynski, J.-L. Baer, and B. Bershad. Characterizing processor architectures for programmable network interfaces. In Proc. International Conference on Supercomputing, Santa Fe, 2000]]
[5]
R. Cruz. A calculus for network delay. IEEE Trans. Information Theory, 37(1):114--141, 1991]]
[6]
K. Deb. Multi-objective optimization using evolutionary algorithms. John Wiley, Chichester, 2001]]
[7]
MOSES project. www.tik.ee.ethz.ch/~moses/]]
[8]
A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks. IEEE/ACM Trans. Networking, 2-2:137--150, 1994]]
[9]
Ptolemy project. ptolemy.eecs.berkeley.edu/]]
[10]
S. Shenker and J. Wroclawski. General characterization parameters for integrated service network elements. RFC 2215, Internet Engineering Task Force (IETF), Sept. 1997]]
[11]
L. Thiele, S. Chakraborty, M. Gries, A. Maxiaguine, and J. Greutert. Embedded software in network processors -- models and algorithms. In First Workshop on Embedded Software, LNCS 2211. Springer-Verlag, 2001]]
[12]
L. Thiele, S. Chakraborty, and M. Naedele. Real-time calculus for scheduling hard real-time systems. In Proc. IEEE International Symposium on Circuits and Systems, volume~4, pages 101--104, 2000. Invited paper]]
[13]
L. Thiele, S. Chakraborty, and M. Naedele. Real-time calculus for scheduling hard real-time systems. In Proc. IEEE International Conference on Circuits and Systems, volume~4, pages 101--104, 2000]]
[14]
T. Wolf, M. Franklin, and E. Spitznagel. Design tradeoffs for embedded network processors. Technical Report WUCS-00-24, Department of Computer Science, Washington University in St. Louis, 2000]]
[15]
D. Ziegenbein, K. Richter, R. Ernst, L. Thiele, and J. Teich. SPI -- a system model for heterogeneously specified embedded systems. IEEE Trans. Very Large Scale Integration (VLSI) Systems, 2002. Accepted for publication]]

Cited By

View all
  • (2021)Beyond the limitations of real-time scheduling theory: a unified scheduling theory for the analysis of real-time systemsSICS Software-Intensive Cyber-Physical Systems10.1007/s00450-021-00429-1Online publication date: 29-Nov-2021
  • (2016)A VHDL-Based Modeling of Network Interface Card Buffers: Design and Teaching MethodologyHigh Performance Computer Applications10.1007/978-3-319-32243-8_18(250-273)Online publication date: 8-Apr-2016
  • (2014)General and efficient response time analysis for EDF schedulingProceedings of the conference on Design, Automation & Test in Europe10.5555/2616606.2616986(1-6)Online publication date: 24-Mar-2014
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DAC '02: Proceedings of the 39th annual Design Automation Conference
June 2002
956 pages
ISBN:1581134614
DOI:10.1145/513918
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 [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 June 2002

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

DAC02
Sponsor:
DAC02: 39th Design Automation Conference
June 10 - 14, 2002
Louisiana, New Orleans, USA

Acceptance Rates

DAC '02 Paper Acceptance Rate 147 of 491 submissions, 30%;
Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25
62nd ACM/IEEE Design Automation Conference
June 22 - 26, 2025
San Francisco , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)4
  • Downloads (Last 6 weeks)2
Reflects downloads up to 12 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Beyond the limitations of real-time scheduling theory: a unified scheduling theory for the analysis of real-time systemsSICS Software-Intensive Cyber-Physical Systems10.1007/s00450-021-00429-1Online publication date: 29-Nov-2021
  • (2016)A VHDL-Based Modeling of Network Interface Card Buffers: Design and Teaching MethodologyHigh Performance Computer Applications10.1007/978-3-319-32243-8_18(250-273)Online publication date: 8-Apr-2016
  • (2014)General and efficient response time analysis for EDF schedulingProceedings of the conference on Design, Automation & Test in Europe10.5555/2616606.2616986(1-6)Online publication date: 24-Mar-2014
  • (2013)System performance evaluation by combining RTC and VHDL simulationJournal of Systems Architecture: the EUROMICRO Journal10.1016/j.sysarc.2013.09.00659:10(1277-1298)Online publication date: 1-Nov-2013
  • (2013)Methods and Tools for Mapping Process Networks onto Multi-Processor Systems-On-ChipHandbook of Signal Processing Systems10.1007/978-1-4614-6859-2_27(867-903)Online publication date: 10-May-2013
  • (2011)Runtime improved computation of path latencies with the real-time calculusProceedings of the 1st International Workshop on Worst-Case Traversal Time10.1145/2071589.2071597(58-65)Online publication date: 29-Nov-2011
  • (2011)Mapping Embedded Applications on MPSoCs: The MNEMEE ApproachVLSI 2010 Annual Symposium10.1007/978-94-007-1488-5_10(165-179)Online publication date: 8-Sep-2011
  • (2011)Related WorkMultiprocessor Systems on Chip10.1007/978-1-4419-8153-0_4(49-54)Online publication date: 10-Jan-2011
  • (2011)Approximating Pareto optimal compiler optimization sequences—a trade-off between WCET, ACET and code sizeSoftware—Practice & Experience10.1002/spe.107941:12(1437-1458)Online publication date: 1-Nov-2011
  • (2010)Methods and Tools for Mapping Process Networks onto Multi-Processor Systems-On-ChipHandbook of Signal Processing Systems10.1007/978-1-4419-6345-1_35(1007-1040)Online publication date: 16-Jul-2010
  • Show More Cited By

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media