Handshake packets - computer architecture, Computer Engineering

Assignment Help:

Handshake packets:

Handshake packets consist of nothing but a PID byte, and are usually sent in response to data packets. The 3 basic types are, NAK, indicating that the data cannot be retain at this time ACK, indicating that data was successfully retain and should be retried, and STALL, indicating that the device has an error and will never be able to successfully transfer data till some corrective action (e.g. device initialization) is performed.

USB 2.0 added 2 extra handshake packets called NYET which indicates that a split transaction is not still complete. A NYET packet is also used to tell the host that the receiver has accepted a data packet, but cannot accept any more for reason to buffers being full. Then the host will send PING packets and will continue along data packets once the components ACK's the PING. The other packet which is added was the ERR handshake to indicate that a split transaction failed. Only handshake packet the USB host may generate is called ACK; if it is not prepared to retain data, it should not instruct a component to send any.

 

 


Related Discussions:- Handshake packets - computer architecture

Describe data structures used during passes of assembler, Describe Data str...

Describe Data structures used during passes of assembler and their use. During passes of assembler, the Data structures define as: Pass 1 data base Input source pro

Summary of tasks, Summary of Tasks Task Summary attempts to show amoun...

Summary of Tasks Task Summary attempts to show amount of duration every task has spent starting from beginning of task until its completion on any processor as displayed in Fi

Construct the finite automata, Give the regular expression of the set of al...

Give the regular expression of the set of all even strings over the alphabet {a, b} along with at least one of the two substrings aa or bb. As well construct the finite automata wh

Explain tree, Tree (recursive definition) A tree is a finite set of one...

Tree (recursive definition) A tree is a finite set of one or more than one nodes such that. (1) There is a specially designated node known as the root. (2) The left over

Subsequent statements set every element of matrix, Q. Subsequent statements...

Q. Subsequent statements set every element of matrix? Let a= [2,4,6,8,10], b=[1,3,5,7,9], c=[0,0,0,0,0] Consider the subsequent program section FORALL (i = 2:4)   a(i)

What is a multiplexer tree, What is a Multiplexer Tree? Ans Multip...

What is a Multiplexer Tree? Ans Multiplexer Tree: The largest available MUX IC is 16 to 1. Meeting the larger input requires there must be a provision to expand this. It

Importance of decentralization, What are the importance of Decentralization...

What are the importance of Decentralization? a) Self responsibility b) Work autonomy c) Quick decisions d) Continuous involvement and e) Better control. What are the differe

Micooperation, please suggest me ,how to write microopertions,and study for...

please suggest me ,how to write microopertions,and study for computer architecture

Cache misses - computer architecture, Cache Misses Compulsory misse...

Cache Misses Compulsory misses -  it is caused by initial access to a block that has never been in the cache (also called cold start misses Capacity miss - it is cause

Structural classification-flynns classification , Structural Classification...

Structural Classification Flynn's classification examine the behavioural concept and does not receive into consideration the computer's structure. Parallel computers can be cla

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd