• Home
  • Textbooks
  • Computers as Components: Principles of Embedded Computing System Design
  • Networks and Multiprocessors

Computers as Components: Principles of Embedded Computing System Design

Marilyn Wolf

Chapter 8

Networks and Multiprocessors - all with Video Answers

Educators


Chapter Questions

01:40

Problem 1

Describe an $\mathrm{I}^2 \mathrm{C}$ bus at the following OSI-compliant levels of detail:
a. physical
b. data link
c. network
d. transport

Vysakh M
Vysakh M
Numerade Educator
01:40

Problem 2

Describe a 10Base-T Ethernet at the following OSI-compliant levels of detail:
a. physical
b. data link
c. network
d. transport

Vysakh M
Vysakh M
Numerade Educator
01:08

Problem 3

Give examples of the component networks in a federated network for an automobile

Micah Hurewitz
Micah Hurewitz
Numerade Educator
04:23

Problem 4

You are designing an embedded system using an Intel Xeon as a host. Does it make sense to add an accelerator to implement the function $z=a x+b y$ $+c$ ? Explain.

Shelby Mohamed
Shelby Mohamed
Numerade Educator

Problem 5

You are designing an embedded system using an embedded processor with no floating-point support as host. Does it make sense to add an accelerator to implement the floating-point function $S=A \sin (2 \pi f+\phi)$ ? Explain.

Check back soon!

Problem 6

You are designing an embedded system using a high-performance embedded processor with floating point as host. Does it make sense to add an accelerator to implement the floating-point function $S=A \sin (2 \pi f+\phi)$ ? Explain.

Check back soon!
00:30

Problem 7

You are designing an accelerated system that performs the following function as its main task:
Assume that the accelerator has the entire $p i x$ and $f$ arrays in its internal memory during the entire computation-pix is read into the accelerator before the operations begin and $f$ is written out after all computations have been completed.
a. Show a system schedule for the host, accelerator, and bus assuming that the accelerator is inactive during all data transfers. (All data are sent to the accelerator before it starts and data are read from the accelerator after the computations are finished.)
b. Show a system schedule for the host, accelerator, and bus assuming that the accelerator has enough memory for two pix and $f$ arrays and that the host can transfer data for one set of computations while another set is being performed.

Erika Bustos
Erika Bustos
Numerade Educator
00:36

Problem 8

Find the longest path through the graph below, using the computation times on the nodes and the communication times on the edges.

WZ
Wen Zheng
Numerade Educator
01:57

Problem 9

Write pseudocode for an algorithm to determine the longest path through a system execution graph. The longest path is to be measured from one designated entry point to one exit point. Each node in the graph is labeled with a number giving the execution time of the process represented by that node.

WZ
Wen Zheng
Numerade Educator