Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 4, Problem 39CRP
Program Plan Intro
Bus topology:
The bus topology is the type of network setup in which all the devices are connected to a common cable. This topology works fine for a very small network.
Deadlock condition:
In bus topology, the bus is non shareable resource for which all the machines must compete with each other in order to transmit message. If all the machines transmit the message at the same time, then it creates a situation of deadlock condition.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
Bus topology is a form of nearest neighbour, the network is cheap but the time it takes to communicate with other computers depends on distance between computers.
1- True
2- False
Computer Science
A source computer is connected to a destination computer through one router (R1). The throughput of the first hop is 1000Mbps and the throughput of the second hop is 10000 Mbps. What is the end-to-end throughput?
The VAX SBI bus uses a distributed, synchronous arbitration scheme. Each SBIN device (i.e., processor, memory, I/O module) has a unique priority and is assigned a unique transfer request (TR) line. The SBI has 16 such lines (TR0, TR1, . . ., TR15), with TR0 having the highest priority. When a device wants to use the bus, it places
a reservation for a future time slot by asserting its TR line during the current time slot. At the end of the current time slot, each device with a pending reservation examines the TR lines; the highest-priority device with a reservation uses the next time slot.
A maximum of 17 devices can be attached to the bus. The device with priority 16 has no TR line. Why not?
Chapter 4 Solutions
Computer Science: An Overview (12th Edition)
Ch. 4.1 - What is an open network?Ch. 4.1 - Prob. 2QECh. 4.1 - What is a router?Ch. 4.1 - Prob. 4QECh. 4.1 - Prob. 5QECh. 4.1 - Prob. 6QECh. 4.2 - Prob. 1QECh. 4.2 - Prob. 2QECh. 4.2 - Prob. 3QECh. 4.2 - Prob. 4QE
Ch. 4.2 - Prob. 5QECh. 4.2 - Prob. 6QECh. 4.2 - Prob. 7QECh. 4.2 - Prob. 8QECh. 4.3 - Prob. 1QECh. 4.3 - Prob. 2QECh. 4.3 - Prob. 3QECh. 4.3 - Prob. 4QECh. 4.3 - Prob. 5QECh. 4.4 - Prob. 1QECh. 4.4 - Prob. 2QECh. 4.4 - Prob. 3QECh. 4.4 - What keeps a computer on the Internet from...Ch. 4.5 - Prob. 1QECh. 4.5 - Prob. 2QECh. 4.5 - Prob. 3QECh. 4.5 - Prob. 4QECh. 4.5 - Prob. 5QECh. 4 - Prob. 1CRPCh. 4 - Prob. 2CRPCh. 4 - Prob. 3CRPCh. 4 - Prob. 4CRPCh. 4 - Prob. 5CRPCh. 4 - Prob. 6CRPCh. 4 - Prob. 7CRPCh. 4 - Prob. 8CRPCh. 4 - Prob. 9CRPCh. 4 - Prob. 10CRPCh. 4 - Prob. 11CRPCh. 4 - Prob. 12CRPCh. 4 - Prob. 13CRPCh. 4 - Prob. 14CRPCh. 4 - Prob. 15CRPCh. 4 - Prob. 16CRPCh. 4 - Prob. 17CRPCh. 4 - Prob. 18CRPCh. 4 - Prob. 19CRPCh. 4 - Prob. 20CRPCh. 4 - Prob. 21CRPCh. 4 - Prob. 22CRPCh. 4 - Prob. 23CRPCh. 4 - Prob. 24CRPCh. 4 - Prob. 25CRPCh. 4 - Prob. 26CRPCh. 4 - Prob. 27CRPCh. 4 - Prob. 28CRPCh. 4 - Prob. 29CRPCh. 4 - Prob. 30CRPCh. 4 - Prob. 31CRPCh. 4 - Prob. 32CRPCh. 4 - Prob. 33CRPCh. 4 - Prob. 34CRPCh. 4 - Prob. 35CRPCh. 4 - Prob. 36CRPCh. 4 - Prob. 37CRPCh. 4 - Prob. 38CRPCh. 4 - Prob. 39CRPCh. 4 - Prob. 40CRPCh. 4 - Prob. 41CRPCh. 4 - Prob. 42CRPCh. 4 - Prob. 43CRPCh. 4 - Prob. 44CRPCh. 4 - Prob. 45CRPCh. 4 - Prob. 46CRPCh. 4 - Prob. 47CRPCh. 4 - Prob. 48CRPCh. 4 - Prob. 49CRPCh. 4 - Prob. 50CRPCh. 4 - Prob. 1SICh. 4 - Prob. 2SICh. 4 - Prob. 3SICh. 4 - Prob. 4SICh. 4 - Prob. 5SICh. 4 - Prob. 6SICh. 4 - Prob. 7SICh. 4 - Prob. 8SICh. 4 - Prob. 9SICh. 4 - Prob. 10SICh. 4 - Prob. 11SICh. 4 - Prob. 12SI
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- If each interval shown in Figure 7.11 is 50ns, how long would it take to transfer 10 bytes of data? Devise a bus protocol, using as many control lines as you need, that would reduce the time required for this transfer to take place. What happens if the address lines are eliminated and the data bus is used for addressing instead? (Hint: An additional control line may be needed.)arrow_forwardGive a brief summary of one of the cache-related protocols.arrow_forwardThe minimum number of columns in a datagram network is two; the minimum number of columns in a virtual-circuit network is four. Can you explain the reason? Is the difference related to the type of addresses carried in the packets of each network?arrow_forward
- On a three-bus organization, O two buses as source buses and third is destination. one bus as source bus and two are used as destination. Three buses as source buses and fourth is used as destination.arrow_forwardThe CAN interface operates like a network where any node is allowed to use the bus. What physical layer (wiring) and protocol features (message format) of the CAN interface make this possible? How do these features keep nodes from using the bus at the same time. How do these features impact the design of a system using CAN?arrow_forwardWhen designing Elementary data connection protocols, what kind of assumptions were made?arrow_forward
- Why is it essential for you to have a network address that is only accessible to you? Is it feasible that in the distant future, a datagram with an address that belongs to a private network can, at some point in time, become accessible on the public Internet as a whole? Explain.arrow_forwardWrite down the benefits and drawbacks of bus topology.arrow_forwardARP and RARP both map addresses from one space to another. In this respect, they are similar. However, their implementations are fundamentally different. In what major way do they differ?arrow_forward
- Consider a paging system with the page table stored in memory. 80 percent of all page-table references are found in the TLBS. We assume that a memory reference takes 300 ns and finding a page-table entry in the TLBS takes 50 ns. What is the effective access time?arrow_forwardComputer Networks Problem In the CSMA/CD protocol, the network adapter waits K-512 bit times after a collision, where K is drawn randomly. For K=20, how long does the adapter wait until returning to Step 2 for a 10 Mbps broadcast channel?arrow_forwardWrite the advantages and disadvantages of bus topology.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning