Presentation is loading. Please wait.

Presentation is loading. Please wait.

25-Jun-15 Rudolf Mak TU/e Computer Science, System Architecture and Networking 1 Rudolf Mak November 5, 2004 Taxonomy of maximally elastic.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "25-Jun-15 Rudolf Mak TU/e Computer Science, System Architecture and Networking 1 Rudolf Mak November 5, 2004 Taxonomy of maximally elastic."— Presentation transcript:

1 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 1 Rudolf Mak November 5, 2004 Taxonomy of maximally elastic buffers (based on CS-Report 04-26)

2 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 2 Motivation

3 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 3 B asic Building Blocks One-place buffer Split component Merge component

4 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 4 One-place buffer

5 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 5 Split component

6 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 6 Merge component

7 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 7 Composition Methods Serial composition Wagging composition Multi-wagging composition

8 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 8 Class S

9 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 9 Wagging Composition

10 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 10 Tree Buffers

11 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 11 Diamond Buffer

12 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 12 Class W n

13 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 13 Multi-wagging Composition

14 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 14 Square Buffers

15 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 15 Class M n

16 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 16 Lattice of Buffer Classes

17 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 17 Design Parameters Capacity I/o-distance

18 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 18 Design Space Area A2 con- tains all equi- distant buffers in class M

19 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 19 Performance Metrics Average throughput  (X) Average occupancy  (X) Elasticity   (X)

20 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 20 Optimal Buffers Elasticity bound: A buffer is optimal when its elasticity attains its upper bound for every throughput

21 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 21 Questions For a pair of design parameters we ask: Does there exists an optimal buffer? Does there exist a simple optimal buffer, where simple means: “in class M”? What is the simplest structure of an optimal buffer?

22 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 22 Bisection Lemma (before) UV

23 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 23 Bisection Lemma (after) UV

24 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 24 Production rules Application of the bisection lemma using each of the construction methods yields: 1. 2. 3.

25 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 25 Contours

26 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 26 Design Space revisited

27 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 27 Contour Computation Is based on production rules in ( ,  )-space: 1. 2. 3.

28 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 28 Wagging Contours

29 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 29 Multi-wagging Contours

30 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 30 Limit Contours

31 25-Jun-15 Rudolf Mak r.h.mak@tue.nl TU/e Computer Science, System Architecture and Networking 31 Conclusions Fine-grained, well-fitted taxonomy For almost all design parameters an optimal buffer is known. For almost all design parameters the optimal buffer has a simple structure The taxonomy is extendable –With additional building blocks –With additional construction methods

Download ppt "25-Jun-15 Rudolf Mak TU/e Computer Science, System Architecture and Networking 1 Rudolf Mak November 5, 2004 Taxonomy of maximally elastic."

Similar presentations

Clustering II.

Clustering II.
Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.

Routing and Congestion Problems in General Networks Presented by Jun Zou CAS 744.
Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.

Hierarchical Clustering. Produces a set of nested clusters organized as a hierarchical tree Can be visualized as a dendrogram – A tree-like diagram that.
Implementation Approaches with FPGAs Compile-time reconfiguration (CTR) CTR is a static implementation strategy where each application consists of one.

Implementation Approaches with FPGAs Compile-time reconfiguration (CTR) CTR is a static implementation strategy where each application consists of one.
2004/05/03 Clustering 1 Clustering (Part One) Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.

2004/05/03 Clustering 1 Clustering (Part One) Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
On Approximating the Average Distance Between Points Kfir Barhum, Oded Goldreich and Adi Shraibman Weizmann Institute of Science.

On Approximating the Average Distance Between Points Kfir Barhum, Oded Goldreich and Adi Shraibman Weizmann Institute of Science.
1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 19th Lecture 16.01.2007 Christian Schindelhauer.

1 University of Freiburg Computer Networks and Telematics Prof. Christian Schindelhauer Wireless Sensor Networks 19th Lecture Christian Schindelhauer.
Addressing Optimization for Loop Execution Targeting DSP with Auto-Increment/Decrement Architecture Wei-Kai Cheng Youn-Long Lin* Computer & Communications.

Addressing Optimization for Loop Execution Targeting DSP with Auto-Increment/Decrement Architecture Wei-Kai Cheng Youn-Long Lin* Computer & Communications.
Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems Slide 1 Process Scheduling for Performance Estimation and Synthesis.

Process Scheduling for Performance Estimation and Synthesis of Hardware/Software Systems Slide 1 Process Scheduling for Performance Estimation and Synthesis.
Several Graph Layout Problems for Grids Vladimir Lipets Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach.

Several Graph Layout Problems for Grids Vladimir Lipets Ben-Gurion University of the Negev Advisors: Prof. Daniel Berend Prof. Ephraim Korach.
Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.

Dept. of Computer Science Distributed Computing Group Asymptotically Optimal Mobile Ad-Hoc Routing Fabian Kuhn Roger Wattenhofer Aaron Zollinger.
Time-Variant Spatial Network Model Vijay Gandhi, Betsy George (Group : G04) Group Project Overview of Database Research Fall 2006.

Time-Variant Spatial Network Model Vijay Gandhi, Betsy George (Group : G04) Group Project Overview of Database Research Fall 2006.
Randomized Competitive Analysis for Two Server Problems Wolfgang Bein Kazuo Iwama Jun Kawahara.

Randomized Competitive Analysis for Two Server Problems Wolfgang Bein Kazuo Iwama Jun Kawahara.
A Platform-based Design Flow for Kahn Process Networks Abhijit Davare Qi Zhu December 10, 2004.

A Platform-based Design Flow for Kahn Process Networks Abhijit Davare Qi Zhu December 10, 2004.
Design and Performance Analysis of Buffers: a Constructive Approach Rudolf H. Mak Dept. of Mathematics and Computer Science Technische Universiteit Eindhoven.

Design and Performance Analysis of Buffers: a Constructive Approach Rudolf H. Mak Dept. of Mathematics and Computer Science Technische Universiteit Eindhoven.
Policy-based Fault Management for Integrating IP over Optical Networks Cláudio Carvalho Edmundo Madeira Institute of Computing (IC) Unicamp – Brazil São.

Policy-based Fault Management for Integrating IP over Optical Networks Cláudio Carvalho Edmundo Madeira Institute of Computing (IC) Unicamp – Brazil São.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.

Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
Dependability Models for Designing Disaster Tolerant Cloud Computing Systems.

Dependability Models for Designing Disaster Tolerant Cloud Computing Systems.
Computer Networks Performance Evaluation. Chapter 12 Single Class MVA Performance by Design: Computer Capacity Planning by Example Daniel A. Menascé,

Computer Networks Performance Evaluation. Chapter 12 Single Class MVA Performance by Design: Computer Capacity Planning by Example Daniel A. Menascé,
Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley AISP Workshop May 2, 2007 Joint.

Hierarchical Cooperation Achieves Linear Scaling in Ad Hoc Wireless Networks David Tse Wireless Foundations U.C. Berkeley AISP Workshop May 2, 2007 Joint.

Similar presentations

Ads by Google