6.189 Multicore Programming Primer
Mini-Quiz #3 (1/17/2007)
You've been hired by a new startup company to custom build them a new
multicore processor for their killer application. You have a team of architects and
engineers at your disposal who can design
Massachusetts Institute of Technology
Department of Electrical Engineering and Computer Science
6.111 Introductory Digital Systems Laboratory
Problem Set 3
Problem Set Issued: March 3, 2006
Problem Set Due: March 15, 2006
Problem 1: Critical Path Timing A
A Two Variable Linear Program
objective z = 3x + 5y
10
(1)
x + 2y
6
(2)
x
4
3
y
x, y
0
(3)
(4)
Constraints
2x + 3y
(5)
3
Graphing the Feasible Region
Graph the Constraints:
2x+ 3y
10
(1)
x
(5)
y
5
4
3
2x + 3y = 10
2
1
1
2
3
4
5
6
x
4
Add the Constraint:
x
Broadcast Routing
Route a packet from a source to all nodes in the network
Possible solutions:
Flooding: Each node sends packet on all outgoing links
Discard packets received a second time
Eytan Modiano
Slide 2
Spanning Tree Routing: Send packet along a t
On bounding in optimization
In solving network flow problems, we not only
solve the problem, but we provide a guarantee
that we solved the problem.
Guarantees are one of the major contributions of
an optimization approach.
But what can we do if a minimiza
Lagrangian Relaxation and Inequality Constraints
z*
=
Min
cx
subject to
Ax b,
(P*)
x X.
L() =
Min cx + (Ax - b)
subject to
(P*()
x X,
Lemma. L() z* for 0.
The Lagrange Multiplier Problem:
maximize (L() : 0).
Suppose L* denotes the optimal objective value,
6.826Principles of Computer Systems
2002
6.826Principles of Computer Systems
2002
What makes a system distributed?
21. Distributed Systems
One mans constant is another mans variable.
Alan Perlis
The rest of the course is about distributed computing system
Carrier Sense Multiple Access (CSMA)
In certain situations nodes can hear each other by listening to the channel
- Carrier Sensing
CSMA: Polite version of Aloha
Nodes listen to the channel before they start transmission
Channel idle => Transmit
Channel b
Routing
Must choose routes for various origin destination pairs (O/D pairs)
or for various sessions
Datagram routing: route chosen on a packet by packet basis
Using datagram routing is an easy way to split paths
Eytan Modiano
Slide 2
Virtual circuit routi
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Department of Electrical Engineering and Computer Science
6.374: Analysis and Design of Digital Integrated Circuits
Problem Set # 1 Solutions
Fall 2003
Issued: 9/18/03
Problem 1: Device Parameters
The data from ve mea
MASSACHUSETTS INSTITUTE OF TECHNOLOGY
Department of Electrical Engineering and Computer Science
6.374: Analysis and Design of Digital Integrated Circuits
Problem Set # 2 Solutions
Fall 2003
Issued: 9/18/03
Due: 9/30/03
For these problems you should use th
Massachusetts Institute of Technology
Department of Electrical Engineering and Computer Science
6 826 Principles of Computer Systems
PROBLEM SET 3 SOLUTIONS
Problem 1 Turtle Robot
a
MODULE TurtleImpl EXPORT Move, Position
TYPE Coord = [x: Int, y: Int]
Pat
Accident with No Component Failures
c
VENT
LA
GEARBOX
LC
CONDENSER
CATALYST
COOLING
VAPOR
WATER
REFLUX
REACTOR
COMPUTER
c
Types of Accidents
Component Failure Accidents
Single or multiple component failures
Usually assume random failure
System Accidents
A
6.189 Multicore Programming Primer
Mini-Quiz #4 (1/19/2007)
In 1968, ACM published Edsger Dijkstras letter titled Go To Statement Considered
Harmful. Dijkstra argued that GOTO statements should be abolished because they lead to
unstructured control flow a
What is Logic?
A Universal" Language
A formal Inference system that preserves truth
Not a guarantee of correct answers.
General spirit is to pour in the axioms and grind out the theorems.
E.g. to do inference, start with axioms and grind out consequences.
Packet switches
Packet
Routing
engine
Switch
Scheduler
Packet
Data
Header
DestinationAddress
or VC number
Tag
Output port number
A packet switch consists of a routing engine (table look-up), a
switch scheduler, and a switch fabric.
The routing engine look