Answer:
Means no matter how many processors you use, speed up never increase from 10 times.
Explanation:
If a problem of size W has a serial component Ws,then performance using parallelism:
Using Amdahl's Law:
Tp = (W - Ws )/ N + Ws
Here, Ws = .1,
W - Ws = .9
Performance Tp = (.9 / N) + .1
---------------------------------------------------------
Speed Up = 1 / ( (.9 / N) + .1)
If N -> infinity, Speed Up <= 10
Means no matter how many processors you use, speed up never increase from 10 times.
Answer:
<u>The correct answer is B. The use of an analog modem to transmit data over voice telephone lines.</u>
Explanation:
<u>Dial-up</u> is the oldest Internet connection method and was the only one used when the Internet took its first steps. Access is made by the user through an analog modem and a conventional telephone line. It is less and less used, since the data transmission capacity does not exceed 56 kbps, which makes navigation very slow, unstable and keeps the telephone line busy when connected to the internet. With the popularization of broadband access services and their very affordable prices, <u>dial-up</u> access is virtually obsolete.
Answer:
1. 2588672 bits
2. 4308992 bits
3. The larger the data size of the cache, the larger the area of memory you will need to "search" making the access time and performance slower than the a cache with a smaller data size.
Explanation:
1. Number of bits in the first cache
Using the formula: (2^index bits) * (valid bits + tag bits + (data bits * 2^offset bits))
total bits = 2^15 (1+14+(32*2^1)) = 2588672 bits
2. Number of bits in the Cache with 16 word blocks
Using the formula: (2^index bits) * (valid bits + tag bits + (data bits * 2^offset bits))
total bits = 2^13(1 +13+(32*2^4)) = 4308992 bits
3. Caches are used to help achieve good performance with slow main memories. However, due to architectural limitations of cache, larger data size of cache are not as effective than the smaller data size. A larger cache will have a lower miss rate and a higher delay. The larger the data size of the cache, the larger the area of memory you will need to "search" making the access time and performance slower than the a cache with a smaller data size.
Answer is
(HMAC)
Hashed Message Authentication Code
This combines authentication via a shared secret
cryptography algorithm key with hashing. It involves the client and server each
with a private key. The client creates a unique hash per request to the server
through hashing the request with private keys.
Answer:
Multimedia messaging service
Explanation: